./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/pc_sfifo_3.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e04fb08f 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_6b95077d-648b-4751-8119-54f94f39b50c/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b95077d-648b-4751-8119-54f94f39b50c/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b95077d-648b-4751-8119-54f94f39b50c/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b95077d-648b-4751-8119-54f94f39b50c/bin/uautomizer-tPACEb0tL8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/pc_sfifo_3.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b95077d-648b-4751-8119-54f94f39b50c/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b95077d-648b-4751-8119-54f94f39b50c/bin/uautomizer-tPACEb0tL8 --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 677126e8d6773c92cc337bfe0a3ec155f49f784424155f33a8c9c24ee0a42113 --- 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-e04fb08 [2022-11-16 12:22:34,479 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 12:22:34,482 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 12:22:34,526 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 12:22:34,526 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 12:22:34,530 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 12:22:34,533 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 12:22:34,537 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 12:22:34,540 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 12:22:34,545 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 12:22:34,547 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 12:22:34,548 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 12:22:34,549 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 12:22:34,552 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 12:22:34,553 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 12:22:34,556 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 12:22:34,558 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 12:22:34,559 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 12:22:34,560 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 12:22:34,567 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 12:22:34,570 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 12:22:34,571 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 12:22:34,574 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 12:22:34,575 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 12:22:34,584 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 12:22:34,585 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 12:22:34,586 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 12:22:34,588 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 12:22:34,588 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 12:22:34,589 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 12:22:34,590 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 12:22:34,591 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 12:22:34,593 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 12:22:34,594 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 12:22:34,597 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 12:22:34,597 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 12:22:34,598 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 12:22:34,598 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 12:22:34,599 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 12:22:34,600 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 12:22:34,600 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 12:22:34,601 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b95077d-648b-4751-8119-54f94f39b50c/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-16 12:22:34,641 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 12:22:34,642 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 12:22:34,643 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 12:22:34,643 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 12:22:34,644 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 12:22:34,644 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 12:22:34,645 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 12:22:34,645 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 12:22:34,645 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 12:22:34,646 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 12:22:34,647 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 12:22:34,647 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 12:22:34,648 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 12:22:34,648 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 12:22:34,648 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 12:22:34,648 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 12:22:34,649 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 12:22:34,649 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 12:22:34,649 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 12:22:34,650 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 12:22:34,650 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 12:22:34,650 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 12:22:34,650 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 12:22:34,651 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 12:22:34,651 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:22:34,651 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 12:22:34,652 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 12:22:34,652 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 12:22:34,652 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 12:22:34,652 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 12:22:34,653 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 12:22:34,653 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-16 12:22:34,653 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 12:22:34,654 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_6b95077d-648b-4751-8119-54f94f39b50c/bin/uautomizer-tPACEb0tL8/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_6b95077d-648b-4751-8119-54f94f39b50c/bin/uautomizer-tPACEb0tL8 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 -> 677126e8d6773c92cc337bfe0a3ec155f49f784424155f33a8c9c24ee0a42113 [2022-11-16 12:22:34,989 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 12:22:35,018 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 12:22:35,021 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 12:22:35,022 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 12:22:35,023 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 12:22:35,024 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b95077d-648b-4751-8119-54f94f39b50c/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/systemc/pc_sfifo_3.cil.c [2022-11-16 12:22:35,091 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b95077d-648b-4751-8119-54f94f39b50c/bin/uautomizer-tPACEb0tL8/data/49a31b69a/7fd901b1af8e45b888db519f9ad9ea6b/FLAG6f013a060 [2022-11-16 12:22:35,640 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 12:22:35,641 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b95077d-648b-4751-8119-54f94f39b50c/sv-benchmarks/c/systemc/pc_sfifo_3.cil.c [2022-11-16 12:22:35,650 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b95077d-648b-4751-8119-54f94f39b50c/bin/uautomizer-tPACEb0tL8/data/49a31b69a/7fd901b1af8e45b888db519f9ad9ea6b/FLAG6f013a060 [2022-11-16 12:22:35,995 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b95077d-648b-4751-8119-54f94f39b50c/bin/uautomizer-tPACEb0tL8/data/49a31b69a/7fd901b1af8e45b888db519f9ad9ea6b [2022-11-16 12:22:35,997 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 12:22:35,999 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 12:22:36,002 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 12:22:36,002 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 12:22:36,006 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 12:22:36,007 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:22:35" (1/1) ... [2022-11-16 12:22:36,008 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37b83af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:22:36, skipping insertion in model container [2022-11-16 12:22:36,008 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:22:35" (1/1) ... [2022-11-16 12:22:36,015 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 12:22:36,043 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 12:22:36,239 WARN L229 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_6b95077d-648b-4751-8119-54f94f39b50c/sv-benchmarks/c/systemc/pc_sfifo_3.cil.c[640,653] [2022-11-16 12:22:36,315 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:22:36,329 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 12:22:36,345 WARN L229 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_6b95077d-648b-4751-8119-54f94f39b50c/sv-benchmarks/c/systemc/pc_sfifo_3.cil.c[640,653] [2022-11-16 12:22:36,395 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:22:36,410 INFO L208 MainTranslator]: Completed translation [2022-11-16 12:22:36,411 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:22:36 WrapperNode [2022-11-16 12:22:36,411 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 12:22:36,412 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 12:22:36,412 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 12:22:36,412 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 12:22:36,420 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:22:36" (1/1) ... [2022-11-16 12:22:36,428 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:22:36" (1/1) ... [2022-11-16 12:22:36,451 INFO L138 Inliner]: procedures = 31, calls = 35, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 225 [2022-11-16 12:22:36,451 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 12:22:36,452 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 12:22:36,452 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 12:22:36,452 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 12:22:36,461 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:22:36" (1/1) ... [2022-11-16 12:22:36,461 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:22:36" (1/1) ... [2022-11-16 12:22:36,463 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:22:36" (1/1) ... [2022-11-16 12:22:36,464 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:22:36" (1/1) ... [2022-11-16 12:22:36,469 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:22:36" (1/1) ... [2022-11-16 12:22:36,475 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:22:36" (1/1) ... [2022-11-16 12:22:36,476 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:22:36" (1/1) ... [2022-11-16 12:22:36,478 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:22:36" (1/1) ... [2022-11-16 12:22:36,481 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 12:22:36,481 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 12:22:36,482 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 12:22:36,482 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 12:22:36,483 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:22:36" (1/1) ... [2022-11-16 12:22:36,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:22:36,501 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b95077d-648b-4751-8119-54f94f39b50c/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:22:36,515 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b95077d-648b-4751-8119-54f94f39b50c/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 12:22:36,543 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b95077d-648b-4751-8119-54f94f39b50c/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 12:22:36,567 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 12:22:36,567 INFO L130 BoogieDeclarations]: Found specification of procedure error [2022-11-16 12:22:36,568 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2022-11-16 12:22:36,568 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-11-16 12:22:36,568 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-11-16 12:22:36,568 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2022-11-16 12:22:36,568 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2022-11-16 12:22:36,568 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2022-11-16 12:22:36,569 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2022-11-16 12:22:36,569 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2022-11-16 12:22:36,569 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2022-11-16 12:22:36,569 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2022-11-16 12:22:36,569 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2022-11-16 12:22:36,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 12:22:36,569 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2022-11-16 12:22:36,569 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2022-11-16 12:22:36,570 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 12:22:36,570 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 12:22:36,570 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-11-16 12:22:36,570 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-11-16 12:22:36,700 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 12:22:36,702 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 12:22:37,085 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##54: assume !(1 == ~q_free~0); [2022-11-16 12:22:37,085 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##53: assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 2;~a_t~0 := do_read_c_~a~0#1; [2022-11-16 12:22:37,123 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 12:22:37,131 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 12:22:37,131 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-16 12:22:37,133 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:22:37 BoogieIcfgContainer [2022-11-16 12:22:37,134 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 12:22:37,142 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 12:22:37,142 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 12:22:37,146 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 12:22:37,146 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:22:35" (1/3) ... [2022-11-16 12:22:37,147 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4440f882 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:22:37, skipping insertion in model container [2022-11-16 12:22:37,147 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:22:36" (2/3) ... [2022-11-16 12:22:37,148 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4440f882 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:22:37, skipping insertion in model container [2022-11-16 12:22:37,148 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:22:37" (3/3) ... [2022-11-16 12:22:37,149 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil.c [2022-11-16 12:22:37,171 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 12:22:37,171 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-16 12:22:37,258 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 12:22:37,275 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;@17ded8c7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 12:22:37,275 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-16 12:22:37,280 INFO L276 IsEmpty]: Start isEmpty. Operand has 119 states, 93 states have (on average 1.5268817204301075) internal successors, (142), 97 states have internal predecessors, (142), 16 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-11-16 12:22:37,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-11-16 12:22:37,295 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:22:37,295 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] [2022-11-16 12:22:37,296 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:22:37,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:22:37,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1330697302, now seen corresponding path program 1 times [2022-11-16 12:22:37,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:22:37,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127399103] [2022-11-16 12:22:37,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:22:37,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:22:37,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:37,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 12:22:37,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:37,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-16 12:22:37,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:37,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 12:22:37,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:37,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:22:37,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:37,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-16 12:22:37,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:37,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-16 12:22:38,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:38,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-16 12:22:38,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:38,023 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-16 12:22:38,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:22:38,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127399103] [2022-11-16 12:22:38,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127399103] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:22:38,025 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:22:38,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 12:22:38,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22346187] [2022-11-16 12:22:38,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:22:38,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 12:22:38,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:22:38,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 12:22:38,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-16 12:22:38,074 INFO L87 Difference]: Start difference. First operand has 119 states, 93 states have (on average 1.5268817204301075) internal successors, (142), 97 states have internal predecessors, (142), 16 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 5 states have internal predecessors, (49), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-16 12:22:39,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:22:39,197 INFO L93 Difference]: Finished difference Result 382 states and 574 transitions. [2022-11-16 12:22:39,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-16 12:22:39,200 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 5 states have internal predecessors, (49), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 64 [2022-11-16 12:22:39,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:22:39,226 INFO L225 Difference]: With dead ends: 382 [2022-11-16 12:22:39,227 INFO L226 Difference]: Without dead ends: 264 [2022-11-16 12:22:39,233 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2022-11-16 12:22:39,238 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 379 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 592 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-16 12:22:39,239 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 544 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 592 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-16 12:22:39,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2022-11-16 12:22:39,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 225. [2022-11-16 12:22:39,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 179 states have (on average 1.4245810055865922) internal successors, (255), 183 states have internal predecessors, (255), 29 states have call successors, (29), 15 states have call predecessors, (29), 16 states have return successors, (32), 28 states have call predecessors, (32), 27 states have call successors, (32) [2022-11-16 12:22:39,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 316 transitions. [2022-11-16 12:22:39,316 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 316 transitions. Word has length 64 [2022-11-16 12:22:39,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:22:39,317 INFO L495 AbstractCegarLoop]: Abstraction has 225 states and 316 transitions. [2022-11-16 12:22:39,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 5 states have internal predecessors, (49), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-16 12:22:39,317 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 316 transitions. [2022-11-16 12:22:39,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-11-16 12:22:39,320 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:22:39,321 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] [2022-11-16 12:22:39,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 12:22:39,321 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:22:39,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:22:39,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1285381354, now seen corresponding path program 1 times [2022-11-16 12:22:39,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:22:39,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703184615] [2022-11-16 12:22:39,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:22:39,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:22:39,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:39,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 12:22:39,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:39,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-16 12:22:39,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:39,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 12:22:39,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:39,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:22:39,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:39,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-16 12:22:39,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:39,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-16 12:22:39,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:39,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-16 12:22:39,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:39,671 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-16 12:22:39,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:22:39,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703184615] [2022-11-16 12:22:39,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703184615] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:22:39,688 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:22:39,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 12:22:39,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673389131] [2022-11-16 12:22:39,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:22:39,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 12:22:39,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:22:39,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 12:22:39,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-16 12:22:39,691 INFO L87 Difference]: Start difference. First operand 225 states and 316 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 6 states have internal predecessors, (49), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-16 12:22:40,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:22:40,668 INFO L93 Difference]: Finished difference Result 622 states and 882 transitions. [2022-11-16 12:22:40,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-16 12:22:40,669 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 6 states have internal predecessors, (49), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 64 [2022-11-16 12:22:40,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:22:40,677 INFO L225 Difference]: With dead ends: 622 [2022-11-16 12:22:40,677 INFO L226 Difference]: Without dead ends: 413 [2022-11-16 12:22:40,679 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2022-11-16 12:22:40,680 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 457 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 788 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 750 SdHoareTripleChecker+Invalid, 890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 788 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-16 12:22:40,681 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 750 Invalid, 890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 788 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-16 12:22:40,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2022-11-16 12:22:40,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 337. [2022-11-16 12:22:40,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 269 states have (on average 1.41635687732342) internal successors, (381), 275 states have internal predecessors, (381), 42 states have call successors, (42), 22 states have call predecessors, (42), 25 states have return successors, (53), 42 states have call predecessors, (53), 40 states have call successors, (53) [2022-11-16 12:22:40,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 476 transitions. [2022-11-16 12:22:40,736 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 476 transitions. Word has length 64 [2022-11-16 12:22:40,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:22:40,737 INFO L495 AbstractCegarLoop]: Abstraction has 337 states and 476 transitions. [2022-11-16 12:22:40,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 6 states have internal predecessors, (49), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-16 12:22:40,737 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 476 transitions. [2022-11-16 12:22:40,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-11-16 12:22:40,741 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:22:40,741 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] [2022-11-16 12:22:40,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 12:22:40,742 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:22:40,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:22:40,742 INFO L85 PathProgramCache]: Analyzing trace with hash 980999832, now seen corresponding path program 1 times [2022-11-16 12:22:40,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:22:40,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089250122] [2022-11-16 12:22:40,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:22:40,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:22:40,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:40,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 12:22:40,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:40,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-16 12:22:40,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:40,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 12:22:40,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:40,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:22:40,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:40,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-16 12:22:40,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:40,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-16 12:22:40,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:40,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-16 12:22:40,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:40,949 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-16 12:22:40,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:22:40,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089250122] [2022-11-16 12:22:40,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089250122] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:22:40,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:22:40,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-16 12:22:40,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451451020] [2022-11-16 12:22:40,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:22:40,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-16 12:22:40,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:22:40,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-16 12:22:40,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-11-16 12:22:40,952 INFO L87 Difference]: Start difference. First operand 337 states and 476 transitions. Second operand has 10 states, 10 states have (on average 4.9) internal successors, (49), 7 states have internal predecessors, (49), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2022-11-16 12:22:42,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:22:42,852 INFO L93 Difference]: Finished difference Result 1883 states and 2674 transitions. [2022-11-16 12:22:42,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-16 12:22:42,853 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 7 states have internal predecessors, (49), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) Word has length 64 [2022-11-16 12:22:42,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:22:42,865 INFO L225 Difference]: With dead ends: 1883 [2022-11-16 12:22:42,866 INFO L226 Difference]: Without dead ends: 1550 [2022-11-16 12:22:42,870 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2022-11-16 12:22:42,878 INFO L413 NwaCegarLoop]: 217 mSDtfsCounter, 1663 mSDsluCounter, 832 mSDsCounter, 0 mSdLazyCounter, 1463 mSolverCounterSat, 445 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1681 SdHoareTripleChecker+Valid, 1049 SdHoareTripleChecker+Invalid, 1908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 445 IncrementalHoareTripleChecker+Valid, 1463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:22:42,879 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1681 Valid, 1049 Invalid, 1908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [445 Valid, 1463 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-11-16 12:22:42,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1550 states. [2022-11-16 12:22:43,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1550 to 1390. [2022-11-16 12:22:43,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1390 states, 1117 states have (on average 1.3652641002685766) internal successors, (1525), 1138 states have internal predecessors, (1525), 152 states have call successors, (152), 105 states have call predecessors, (152), 120 states have return successors, (186), 148 states have call predecessors, (186), 150 states have call successors, (186) [2022-11-16 12:22:43,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1390 states to 1390 states and 1863 transitions. [2022-11-16 12:22:43,072 INFO L78 Accepts]: Start accepts. Automaton has 1390 states and 1863 transitions. Word has length 64 [2022-11-16 12:22:43,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:22:43,073 INFO L495 AbstractCegarLoop]: Abstraction has 1390 states and 1863 transitions. [2022-11-16 12:22:43,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 7 states have internal predecessors, (49), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2022-11-16 12:22:43,073 INFO L276 IsEmpty]: Start isEmpty. Operand 1390 states and 1863 transitions. [2022-11-16 12:22:43,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-16 12:22:43,075 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:22:43,075 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:22:43,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 12:22:43,076 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:22:43,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:22:43,077 INFO L85 PathProgramCache]: Analyzing trace with hash 779831852, now seen corresponding path program 1 times [2022-11-16 12:22:43,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:22:43,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617684448] [2022-11-16 12:22:43,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:22:43,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:22:43,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:43,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 12:22:43,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:43,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-16 12:22:43,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:43,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 12:22:43,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:43,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:22:43,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:43,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-16 12:22:43,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:43,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-16 12:22:43,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:43,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-16 12:22:43,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:43,241 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-16 12:22:43,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:22:43,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617684448] [2022-11-16 12:22:43,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617684448] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:22:43,242 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:22:43,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-16 12:22:43,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322050091] [2022-11-16 12:22:43,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:22:43,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 12:22:43,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:22:43,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 12:22:43,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-11-16 12:22:43,245 INFO L87 Difference]: Start difference. First operand 1390 states and 1863 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-16 12:22:43,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:22:43,884 INFO L93 Difference]: Finished difference Result 2918 states and 3942 transitions. [2022-11-16 12:22:43,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 12:22:43,884 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2022-11-16 12:22:43,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:22:43,895 INFO L225 Difference]: With dead ends: 2918 [2022-11-16 12:22:43,895 INFO L226 Difference]: Without dead ends: 1538 [2022-11-16 12:22:43,899 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-11-16 12:22:43,910 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 137 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 12:22:43,911 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 619 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 524 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-16 12:22:43,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1538 states. [2022-11-16 12:22:44,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1538 to 1430. [2022-11-16 12:22:44,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1430 states, 1149 states have (on average 1.349869451697128) internal successors, (1551), 1170 states have internal predecessors, (1551), 152 states have call successors, (152), 105 states have call predecessors, (152), 128 states have return successors, (194), 156 states have call predecessors, (194), 150 states have call successors, (194) [2022-11-16 12:22:44,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1430 states to 1430 states and 1897 transitions. [2022-11-16 12:22:44,067 INFO L78 Accepts]: Start accepts. Automaton has 1430 states and 1897 transitions. Word has length 65 [2022-11-16 12:22:44,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:22:44,067 INFO L495 AbstractCegarLoop]: Abstraction has 1430 states and 1897 transitions. [2022-11-16 12:22:44,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-16 12:22:44,068 INFO L276 IsEmpty]: Start isEmpty. Operand 1430 states and 1897 transitions. [2022-11-16 12:22:44,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-16 12:22:44,069 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:22:44,070 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:22:44,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 12:22:44,070 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:22:44,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:22:44,071 INFO L85 PathProgramCache]: Analyzing trace with hash -249527446, now seen corresponding path program 1 times [2022-11-16 12:22:44,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:22:44,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366494808] [2022-11-16 12:22:44,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:22:44,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:22:44,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:44,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 12:22:44,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:44,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-16 12:22:44,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:44,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 12:22:44,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:44,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:22:44,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:44,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-16 12:22:44,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:44,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-16 12:22:44,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:44,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-16 12:22:44,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:44,249 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-16 12:22:44,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:22:44,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366494808] [2022-11-16 12:22:44,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366494808] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:22:44,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:22:44,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-16 12:22:44,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132924021] [2022-11-16 12:22:44,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:22:44,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-16 12:22:44,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:22:44,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-16 12:22:44,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-11-16 12:22:44,251 INFO L87 Difference]: Start difference. First operand 1430 states and 1897 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-11-16 12:22:46,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:22:46,296 INFO L93 Difference]: Finished difference Result 5002 states and 6771 transitions. [2022-11-16 12:22:46,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-16 12:22:46,297 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 65 [2022-11-16 12:22:46,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:22:46,306 INFO L225 Difference]: With dead ends: 5002 [2022-11-16 12:22:46,306 INFO L226 Difference]: Without dead ends: 1821 [2022-11-16 12:22:46,313 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2022-11-16 12:22:46,314 INFO L413 NwaCegarLoop]: 217 mSDtfsCounter, 1565 mSDsluCounter, 1014 mSDsCounter, 0 mSdLazyCounter, 1490 mSolverCounterSat, 398 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1583 SdHoareTripleChecker+Valid, 1231 SdHoareTripleChecker+Invalid, 1888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 398 IncrementalHoareTripleChecker+Valid, 1490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:22:46,314 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1583 Valid, 1231 Invalid, 1888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [398 Valid, 1490 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-11-16 12:22:46,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1821 states. [2022-11-16 12:22:46,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1821 to 1641. [2022-11-16 12:22:46,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1641 states, 1288 states have (on average 1.3020186335403727) internal successors, (1677), 1311 states have internal predecessors, (1677), 192 states have call successors, (192), 133 states have call predecessors, (192), 160 states have return successors, (240), 198 states have call predecessors, (240), 190 states have call successors, (240) [2022-11-16 12:22:46,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1641 states to 1641 states and 2109 transitions. [2022-11-16 12:22:46,475 INFO L78 Accepts]: Start accepts. Automaton has 1641 states and 2109 transitions. Word has length 65 [2022-11-16 12:22:46,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:22:46,475 INFO L495 AbstractCegarLoop]: Abstraction has 1641 states and 2109 transitions. [2022-11-16 12:22:46,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-11-16 12:22:46,476 INFO L276 IsEmpty]: Start isEmpty. Operand 1641 states and 2109 transitions. [2022-11-16 12:22:46,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-11-16 12:22:46,478 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:22:46,478 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:22:46,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 12:22:46,478 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:22:46,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:22:46,479 INFO L85 PathProgramCache]: Analyzing trace with hash -31264562, now seen corresponding path program 1 times [2022-11-16 12:22:46,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:22:46,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689891653] [2022-11-16 12:22:46,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:22:46,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:22:46,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:46,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 12:22:46,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:46,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-16 12:22:46,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:46,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 12:22:46,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:46,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:22:46,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:46,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-16 12:22:46,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:46,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-16 12:22:46,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:46,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-16 12:22:46,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:46,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-16 12:22:46,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:46,665 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-16 12:22:46,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:22:46,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689891653] [2022-11-16 12:22:46,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689891653] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:22:46,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:22:46,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-16 12:22:46,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013549894] [2022-11-16 12:22:46,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:22:46,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 12:22:46,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:22:46,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 12:22:46,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-11-16 12:22:46,669 INFO L87 Difference]: Start difference. First operand 1641 states and 2109 transitions. Second operand has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-16 12:22:47,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:22:47,270 INFO L93 Difference]: Finished difference Result 3466 states and 4511 transitions. [2022-11-16 12:22:47,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-16 12:22:47,271 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 90 [2022-11-16 12:22:47,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:22:47,280 INFO L225 Difference]: With dead ends: 3466 [2022-11-16 12:22:47,280 INFO L226 Difference]: Without dead ends: 1835 [2022-11-16 12:22:47,285 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-11-16 12:22:47,285 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 192 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 12:22:47,286 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 511 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 12:22:47,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1835 states. [2022-11-16 12:22:47,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1835 to 1701. [2022-11-16 12:22:47,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1701 states, 1336 states have (on average 1.2866766467065869) internal successors, (1719), 1359 states have internal predecessors, (1719), 192 states have call successors, (192), 133 states have call predecessors, (192), 172 states have return successors, (252), 210 states have call predecessors, (252), 190 states have call successors, (252) [2022-11-16 12:22:47,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1701 states to 1701 states and 2163 transitions. [2022-11-16 12:22:47,430 INFO L78 Accepts]: Start accepts. Automaton has 1701 states and 2163 transitions. Word has length 90 [2022-11-16 12:22:47,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:22:47,430 INFO L495 AbstractCegarLoop]: Abstraction has 1701 states and 2163 transitions. [2022-11-16 12:22:47,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-16 12:22:47,431 INFO L276 IsEmpty]: Start isEmpty. Operand 1701 states and 2163 transitions. [2022-11-16 12:22:47,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-11-16 12:22:47,432 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:22:47,433 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:22:47,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-16 12:22:47,433 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:22:47,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:22:47,434 INFO L85 PathProgramCache]: Analyzing trace with hash 412636112, now seen corresponding path program 1 times [2022-11-16 12:22:47,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:22:47,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432900959] [2022-11-16 12:22:47,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:22:47,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:22:47,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:47,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 12:22:47,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:47,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-16 12:22:47,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:47,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 12:22:47,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:47,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:22:47,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:47,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-16 12:22:47,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:47,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-16 12:22:47,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:47,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-16 12:22:47,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:47,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-16 12:22:47,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:47,654 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-16 12:22:47,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:22:47,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432900959] [2022-11-16 12:22:47,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432900959] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:22:47,655 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:22:47,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 12:22:47,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926147428] [2022-11-16 12:22:47,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:22:47,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 12:22:47,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:22:47,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 12:22:47,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-16 12:22:47,657 INFO L87 Difference]: Start difference. First operand 1701 states and 2163 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 6 states have internal predecessors, (61), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-16 12:22:48,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:22:48,509 INFO L93 Difference]: Finished difference Result 3228 states and 4127 transitions. [2022-11-16 12:22:48,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-16 12:22:48,510 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), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 90 [2022-11-16 12:22:48,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:22:48,520 INFO L225 Difference]: With dead ends: 3228 [2022-11-16 12:22:48,520 INFO L226 Difference]: Without dead ends: 1775 [2022-11-16 12:22:48,524 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2022-11-16 12:22:48,525 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 370 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 696 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-16 12:22:48,526 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 569 Invalid, 790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 696 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-16 12:22:48,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1775 states. [2022-11-16 12:22:48,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1775 to 1480. [2022-11-16 12:22:48,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1480 states, 1168 states have (on average 1.2851027397260273) internal successors, (1501), 1186 states have internal predecessors, (1501), 164 states have call successors, (164), 114 states have call predecessors, (164), 147 states have return successors, (212), 180 states have call predecessors, (212), 162 states have call successors, (212) [2022-11-16 12:22:48,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1480 states to 1480 states and 1877 transitions. [2022-11-16 12:22:48,701 INFO L78 Accepts]: Start accepts. Automaton has 1480 states and 1877 transitions. Word has length 90 [2022-11-16 12:22:48,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:22:48,701 INFO L495 AbstractCegarLoop]: Abstraction has 1480 states and 1877 transitions. [2022-11-16 12:22:48,701 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), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-16 12:22:48,701 INFO L276 IsEmpty]: Start isEmpty. Operand 1480 states and 1877 transitions. [2022-11-16 12:22:48,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-11-16 12:22:48,702 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:22:48,703 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:22:48,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-16 12:22:48,703 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:22:48,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:22:48,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1943169138, now seen corresponding path program 1 times [2022-11-16 12:22:48,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:22:48,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686463265] [2022-11-16 12:22:48,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:22:48,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:22:48,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:48,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 12:22:48,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:48,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-16 12:22:48,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:48,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 12:22:48,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:48,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:22:48,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:48,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-16 12:22:48,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:48,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-16 12:22:48,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:48,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-16 12:22:48,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:48,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-16 12:22:48,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:48,835 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-16 12:22:48,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:22:48,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686463265] [2022-11-16 12:22:48,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686463265] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:22:48,836 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:22:48,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 12:22:48,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810369682] [2022-11-16 12:22:48,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:22:48,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:22:48,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:22:48,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:22:48,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:22:48,838 INFO L87 Difference]: Start difference. First operand 1480 states and 1877 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 4 states have internal predecessors, (69), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-11-16 12:22:49,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:22:49,499 INFO L93 Difference]: Finished difference Result 4632 states and 5989 transitions. [2022-11-16 12:22:49,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-16 12:22:49,500 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 4 states have internal predecessors, (69), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 90 [2022-11-16 12:22:49,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:22:49,516 INFO L225 Difference]: With dead ends: 4632 [2022-11-16 12:22:49,519 INFO L226 Difference]: Without dead ends: 3163 [2022-11-16 12:22:49,524 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2022-11-16 12:22:49,526 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 371 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 12:22:49,526 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 424 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-16 12:22:49,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3163 states. [2022-11-16 12:22:49,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3163 to 2949. [2022-11-16 12:22:49,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2949 states, 2317 states have (on average 1.2641346568839016) internal successors, (2929), 2364 states have internal predecessors, (2929), 325 states have call successors, (325), 227 states have call predecessors, (325), 306 states have return successors, (495), 359 states have call predecessors, (495), 323 states have call successors, (495) [2022-11-16 12:22:49,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2949 states to 2949 states and 3749 transitions. [2022-11-16 12:22:49,793 INFO L78 Accepts]: Start accepts. Automaton has 2949 states and 3749 transitions. Word has length 90 [2022-11-16 12:22:49,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:22:49,795 INFO L495 AbstractCegarLoop]: Abstraction has 2949 states and 3749 transitions. [2022-11-16 12:22:49,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 4 states have internal predecessors, (69), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-11-16 12:22:49,797 INFO L276 IsEmpty]: Start isEmpty. Operand 2949 states and 3749 transitions. [2022-11-16 12:22:49,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-11-16 12:22:49,799 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:22:49,799 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:22:49,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-16 12:22:49,800 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:22:49,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:22:49,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1293960080, now seen corresponding path program 1 times [2022-11-16 12:22:49,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:22:49,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746562179] [2022-11-16 12:22:49,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:22:49,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:22:49,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:49,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 12:22:49,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:49,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-16 12:22:49,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:49,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 12:22:49,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:49,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:22:49,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:49,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-16 12:22:49,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:49,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-16 12:22:49,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:49,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-16 12:22:49,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:49,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-16 12:22:49,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:49,876 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-16 12:22:49,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:22:49,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746562179] [2022-11-16 12:22:49,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746562179] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:22:49,876 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:22:49,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 12:22:49,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509048685] [2022-11-16 12:22:49,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:22:49,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 12:22:49,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:22:49,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 12:22:49,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:22:49,879 INFO L87 Difference]: Start difference. First operand 2949 states and 3749 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 3 states have internal predecessors, (61), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-16 12:22:50,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:22:50,225 INFO L93 Difference]: Finished difference Result 4533 states and 5733 transitions. [2022-11-16 12:22:50,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 12:22:50,226 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 3 states have internal predecessors, (61), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 90 [2022-11-16 12:22:50,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:22:50,234 INFO L225 Difference]: With dead ends: 4533 [2022-11-16 12:22:50,234 INFO L226 Difference]: Without dead ends: 1595 [2022-11-16 12:22:50,240 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-11-16 12:22:50,243 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 294 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:22:50,243 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 195 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 12:22:50,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1595 states. [2022-11-16 12:22:50,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1595 to 1480. [2022-11-16 12:22:50,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1480 states, 1168 states have (on average 1.2534246575342465) internal successors, (1464), 1186 states have internal predecessors, (1464), 164 states have call successors, (164), 114 states have call predecessors, (164), 147 states have return successors, (212), 180 states have call predecessors, (212), 162 states have call successors, (212) [2022-11-16 12:22:50,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1480 states to 1480 states and 1840 transitions. [2022-11-16 12:22:50,427 INFO L78 Accepts]: Start accepts. Automaton has 1480 states and 1840 transitions. Word has length 90 [2022-11-16 12:22:50,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:22:50,427 INFO L495 AbstractCegarLoop]: Abstraction has 1480 states and 1840 transitions. [2022-11-16 12:22:50,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 3 states have internal predecessors, (61), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-16 12:22:50,428 INFO L276 IsEmpty]: Start isEmpty. Operand 1480 states and 1840 transitions. [2022-11-16 12:22:50,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-11-16 12:22:50,430 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:22:50,430 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:22:50,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-16 12:22:50,431 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:22:50,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:22:50,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1668589887, now seen corresponding path program 1 times [2022-11-16 12:22:50,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:22:50,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761159672] [2022-11-16 12:22:50,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:22:50,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:22:50,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:50,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 12:22:50,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:50,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-16 12:22:50,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:50,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 12:22:50,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:50,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:22:50,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:50,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-16 12:22:50,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:50,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-16 12:22:50,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:50,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-16 12:22:50,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:50,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-16 12:22:50,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:50,613 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-16 12:22:50,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:22:50,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761159672] [2022-11-16 12:22:50,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761159672] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:22:50,614 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:22:50,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-16 12:22:50,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512232544] [2022-11-16 12:22:50,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:22:50,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 12:22:50,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:22:50,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 12:22:50,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-11-16 12:22:50,616 INFO L87 Difference]: Start difference. First operand 1480 states and 1840 transitions. Second operand has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 6 states have internal predecessors, (73), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-11-16 12:22:51,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:22:51,894 INFO L93 Difference]: Finished difference Result 3898 states and 4923 transitions. [2022-11-16 12:22:51,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-16 12:22:51,895 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 6 states have internal predecessors, (73), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 91 [2022-11-16 12:22:51,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:22:51,906 INFO L225 Difference]: With dead ends: 3898 [2022-11-16 12:22:51,906 INFO L226 Difference]: Without dead ends: 2278 [2022-11-16 12:22:51,911 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=720, Unknown=0, NotChecked=0, Total=930 [2022-11-16 12:22:51,911 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 1335 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 793 mSolverCounterSat, 442 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1353 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 1235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 442 IncrementalHoareTripleChecker+Valid, 793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-16 12:22:51,912 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1353 Valid, 509 Invalid, 1235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [442 Valid, 793 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-16 12:22:51,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2278 states. [2022-11-16 12:22:52,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2278 to 2101. [2022-11-16 12:22:52,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2101 states, 1635 states have (on average 1.2269113149847095) internal successors, (2006), 1661 states have internal predecessors, (2006), 241 states have call successors, (241), 162 states have call predecessors, (241), 224 states have return successors, (343), 278 states have call predecessors, (343), 239 states have call successors, (343) [2022-11-16 12:22:52,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2101 states to 2101 states and 2590 transitions. [2022-11-16 12:22:52,130 INFO L78 Accepts]: Start accepts. Automaton has 2101 states and 2590 transitions. Word has length 91 [2022-11-16 12:22:52,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:22:52,131 INFO L495 AbstractCegarLoop]: Abstraction has 2101 states and 2590 transitions. [2022-11-16 12:22:52,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 6 states have internal predecessors, (73), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-11-16 12:22:52,132 INFO L276 IsEmpty]: Start isEmpty. Operand 2101 states and 2590 transitions. [2022-11-16 12:22:52,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-11-16 12:22:52,134 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:22:52,134 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:22:52,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-16 12:22:52,136 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:22:52,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:22:52,136 INFO L85 PathProgramCache]: Analyzing trace with hash -633049043, now seen corresponding path program 1 times [2022-11-16 12:22:52,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:22:52,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20470150] [2022-11-16 12:22:52,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:22:52,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:22:52,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:52,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 12:22:52,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:52,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-16 12:22:52,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:52,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 12:22:52,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:52,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:22:52,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:52,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-16 12:22:52,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:52,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-16 12:22:52,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:52,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-16 12:22:52,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:52,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-16 12:22:52,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:52,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-16 12:22:52,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:52,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-16 12:22:52,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:52,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-16 12:22:52,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:52,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:22:52,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:52,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-16 12:22:52,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:52,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-11-16 12:22:52,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:52,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-11-16 12:22:52,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:52,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-16 12:22:52,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:52,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-11-16 12:22:52,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:52,347 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 23 proven. 9 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-11-16 12:22:52,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:22:52,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20470150] [2022-11-16 12:22:52,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20470150] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:22:52,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1177303956] [2022-11-16 12:22:52,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:22:52,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:22:52,348 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b95077d-648b-4751-8119-54f94f39b50c/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:22:52,355 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b95077d-648b-4751-8119-54f94f39b50c/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:22:52,367 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b95077d-648b-4751-8119-54f94f39b50c/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-16 12:22:52,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:52,496 INFO L263 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-16 12:22:52,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:22:52,722 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-11-16 12:22:52,722 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:22:52,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1177303956] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:22:52,723 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 12:22:52,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2022-11-16 12:22:52,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63484355] [2022-11-16 12:22:52,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:22:52,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:22:52,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:22:52,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:22:52,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-11-16 12:22:52,725 INFO L87 Difference]: Start difference. First operand 2101 states and 2590 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-11-16 12:22:53,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:22:53,038 INFO L93 Difference]: Finished difference Result 6027 states and 7419 transitions. [2022-11-16 12:22:53,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:22:53,038 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 162 [2022-11-16 12:22:53,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:22:53,056 INFO L225 Difference]: With dead ends: 6027 [2022-11-16 12:22:53,057 INFO L226 Difference]: Without dead ends: 4013 [2022-11-16 12:22:53,063 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-11-16 12:22:53,064 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 61 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 12:22:53,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 281 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 12:22:53,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4013 states. [2022-11-16 12:22:53,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4013 to 3971. [2022-11-16 12:22:53,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3971 states, 3092 states have (on average 1.2160413971539457) internal successors, (3760), 3141 states have internal predecessors, (3760), 448 states have call successors, (448), 323 states have call predecessors, (448), 430 states have return successors, (611), 507 states have call predecessors, (611), 446 states have call successors, (611) [2022-11-16 12:22:53,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3971 states to 3971 states and 4819 transitions. [2022-11-16 12:22:53,553 INFO L78 Accepts]: Start accepts. Automaton has 3971 states and 4819 transitions. Word has length 162 [2022-11-16 12:22:53,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:22:53,555 INFO L495 AbstractCegarLoop]: Abstraction has 3971 states and 4819 transitions. [2022-11-16 12:22:53,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-11-16 12:22:53,556 INFO L276 IsEmpty]: Start isEmpty. Operand 3971 states and 4819 transitions. [2022-11-16 12:22:53,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2022-11-16 12:22:53,560 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:22:53,560 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:22:53,567 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b95077d-648b-4751-8119-54f94f39b50c/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-16 12:22:53,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b95077d-648b-4751-8119-54f94f39b50c/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-16 12:22:53,768 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:22:53,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:22:53,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1912569076, now seen corresponding path program 1 times [2022-11-16 12:22:53,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:22:53,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380470434] [2022-11-16 12:22:53,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:22:53,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:22:53,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:53,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 12:22:53,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:53,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-16 12:22:53,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:53,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 12:22:53,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:53,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:22:53,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:53,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-16 12:22:53,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:53,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-16 12:22:53,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:53,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-16 12:22:53,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:53,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-16 12:22:53,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:54,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-16 12:22:54,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:54,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-16 12:22:54,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:54,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-16 12:22:54,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:54,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:22:54,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:54,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:22:54,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:54,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-11-16 12:22:54,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:54,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-16 12:22:54,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:54,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-11-16 12:22:54,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:54,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:22:54,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:54,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-16 12:22:54,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:54,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-11-16 12:22:54,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:54,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2022-11-16 12:22:54,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:54,054 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 23 proven. 9 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2022-11-16 12:22:54,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:22:54,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380470434] [2022-11-16 12:22:54,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380470434] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:22:54,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [792158348] [2022-11-16 12:22:54,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:22:54,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:22:54,055 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b95077d-648b-4751-8119-54f94f39b50c/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:22:54,059 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b95077d-648b-4751-8119-54f94f39b50c/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:22:54,074 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b95077d-648b-4751-8119-54f94f39b50c/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-16 12:22:54,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:54,196 INFO L263 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-16 12:22:54,201 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:22:54,431 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2022-11-16 12:22:54,431 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:22:54,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [792158348] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:22:54,432 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 12:22:54,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2022-11-16 12:22:54,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816791520] [2022-11-16 12:22:54,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:22:54,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:22:54,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:22:54,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:22:54,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-11-16 12:22:54,434 INFO L87 Difference]: Start difference. First operand 3971 states and 4819 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-16 12:22:55,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:22:55,160 INFO L93 Difference]: Finished difference Result 11891 states and 14427 transitions. [2022-11-16 12:22:55,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:22:55,160 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 194 [2022-11-16 12:22:55,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:22:55,204 INFO L225 Difference]: With dead ends: 11891 [2022-11-16 12:22:55,204 INFO L226 Difference]: Without dead ends: 7931 [2022-11-16 12:22:55,213 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-11-16 12:22:55,215 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 52 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 12:22:55,215 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 281 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 12:22:55,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7931 states. [2022-11-16 12:22:56,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7931 to 7921. [2022-11-16 12:22:56,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7921 states, 6170 states have (on average 1.2092382495948135) internal successors, (7461), 6266 states have internal predecessors, (7461), 890 states have call successors, (890), 645 states have call predecessors, (890), 860 states have return successors, (1218), 1010 states have call predecessors, (1218), 888 states have call successors, (1218) [2022-11-16 12:22:56,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7921 states to 7921 states and 9569 transitions. [2022-11-16 12:22:56,079 INFO L78 Accepts]: Start accepts. Automaton has 7921 states and 9569 transitions. Word has length 194 [2022-11-16 12:22:56,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:22:56,079 INFO L495 AbstractCegarLoop]: Abstraction has 7921 states and 9569 transitions. [2022-11-16 12:22:56,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-16 12:22:56,080 INFO L276 IsEmpty]: Start isEmpty. Operand 7921 states and 9569 transitions. [2022-11-16 12:22:56,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2022-11-16 12:22:56,084 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:22:56,084 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:22:56,101 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b95077d-648b-4751-8119-54f94f39b50c/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-16 12:22:56,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b95077d-648b-4751-8119-54f94f39b50c/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-16 12:22:56,296 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:22:56,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:22:56,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1015175798, now seen corresponding path program 1 times [2022-11-16 12:22:56,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:22:56,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757994830] [2022-11-16 12:22:56,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:22:56,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:22:56,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:56,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 12:22:56,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:56,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-16 12:22:56,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:56,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 12:22:56,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:56,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:22:56,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:56,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-16 12:22:56,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:56,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-16 12:22:56,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:56,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-16 12:22:56,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:56,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-16 12:22:56,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:56,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-16 12:22:56,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:56,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-16 12:22:56,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:56,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-16 12:22:56,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:56,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:22:56,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:56,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:22:56,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:56,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-11-16 12:22:56,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:56,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-16 12:22:56,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:56,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-11-16 12:22:56,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:56,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:22:56,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:56,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-16 12:22:56,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:56,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-11-16 12:22:56,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:56,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2022-11-16 12:22:56,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:56,528 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 23 proven. 9 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2022-11-16 12:22:56,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:22:56,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757994830] [2022-11-16 12:22:56,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757994830] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:22:56,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1660068864] [2022-11-16 12:22:56,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:22:56,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:22:56,529 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b95077d-648b-4751-8119-54f94f39b50c/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:22:56,531 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b95077d-648b-4751-8119-54f94f39b50c/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:22:56,563 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b95077d-648b-4751-8119-54f94f39b50c/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-16 12:22:56,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:56,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-16 12:22:56,668 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:22:56,933 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-11-16 12:22:56,933 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:22:56,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1660068864] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:22:56,933 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 12:22:56,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2022-11-16 12:22:56,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091564307] [2022-11-16 12:22:56,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:22:56,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:22:56,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:22:56,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:22:56,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-11-16 12:22:56,935 INFO L87 Difference]: Start difference. First operand 7921 states and 9569 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2022-11-16 12:22:57,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:22:57,647 INFO L93 Difference]: Finished difference Result 14427 states and 17761 transitions. [2022-11-16 12:22:57,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:22:57,664 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 194 [2022-11-16 12:22:57,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:22:57,667 INFO L225 Difference]: With dead ends: 14427 [2022-11-16 12:22:57,667 INFO L226 Difference]: Without dead ends: 0 [2022-11-16 12:22:57,690 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-11-16 12:22:57,691 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 25 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 12:22:57,692 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 129 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 12:22:57,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-16 12:22:57,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-16 12:22:57,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:22:57,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-16 12:22:57,695 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 194 [2022-11-16 12:22:57,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:22:57,695 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-16 12:22:57,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2022-11-16 12:22:57,696 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-16 12:22:57,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-16 12:22:57,698 INFO L805 garLoopResultBuilder]: Registering result SAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-16 12:22:57,711 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b95077d-648b-4751-8119-54f94f39b50c/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-16 12:22:57,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b95077d-648b-4751-8119-54f94f39b50c/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-16 12:22:57,906 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-16 12:23:47,801 INFO L895 garLoopResultBuilder]: At program point L385(line 385) the Hoare annotation is: (let ((.cse0 (and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|)))) (and (or (not (<= ~c_dr_pc~0 0)) (not (= |old(~c_dr_st~0)| 0)) .cse0 (not (= 1 ~c_dr_i~0))) (or .cse0 (not (= ~c_dr_pc~0 1))))) [2022-11-16 12:23:47,802 INFO L895 garLoopResultBuilder]: At program point L387-2(lines 387 391) the Hoare annotation is: (let ((.cse2 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse9 (= ~p_dw_st~0 0)) (.cse6 (not (<= ~c_dr_pc~0 0))) (.cse7 (not (= |old(~c_dr_st~0)| 0))) (.cse0 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse1 (< 0 (+ activate_threads_~tmp~1 1))) (.cse3 (<= activate_threads_~tmp~1 0)) (.cse4 (= ~p_dw_pc~0 1)) (.cse5 (not (= ~q_read_ev~0 2))) (.cse10 (not (= 1 ~c_dr_i~0)))) (and (or (and .cse0 .cse1 .cse2 .cse3) .cse4 (not (= ~c_dr_pc~0 1)) .cse5) (let ((.cse8 (= ~c_dr_st~0 0))) (or .cse6 .cse7 (and .cse0 .cse8 .cse2) (and .cse8 .cse2 .cse9) .cse10)) (or .cse6 (not .cse9) .cse7 (= |old(~p_dw_st~0)| 0) (not (<= 2 ~fast_clk_edge~0)) (not .cse4) .cse10) (or .cse6 .cse7 (and .cse0 .cse1 .cse3) .cse4 .cse5 .cse10))) [2022-11-16 12:23:47,802 INFO L899 garLoopResultBuilder]: For program point L385-1(line 385) no Hoare annotation was computed. [2022-11-16 12:23:47,802 INFO L895 garLoopResultBuilder]: At program point activate_threadsENTRY(lines 379 403) the Hoare annotation is: (let ((.cse0 (and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|)))) (and (or (not (<= ~c_dr_pc~0 0)) (not (= |old(~c_dr_st~0)| 0)) .cse0 (not (= 1 ~c_dr_i~0))) (or .cse0 (not (= ~c_dr_pc~0 1))))) [2022-11-16 12:23:47,802 INFO L899 garLoopResultBuilder]: For program point L395(lines 395 399) no Hoare annotation was computed. [2022-11-16 12:23:47,802 INFO L899 garLoopResultBuilder]: For program point activate_threadsEXIT(lines 379 403) no Hoare annotation was computed. [2022-11-16 12:23:47,803 INFO L899 garLoopResultBuilder]: For program point L393(line 393) no Hoare annotation was computed. [2022-11-16 12:23:47,803 INFO L899 garLoopResultBuilder]: For program point L395-2(lines 379 403) no Hoare annotation was computed. [2022-11-16 12:23:47,803 INFO L899 garLoopResultBuilder]: For program point L387(lines 387 391) no Hoare annotation was computed. [2022-11-16 12:23:47,803 INFO L899 garLoopResultBuilder]: For program point exists_runnable_threadEXIT(lines 287 306) no Hoare annotation was computed. [2022-11-16 12:23:47,803 INFO L902 garLoopResultBuilder]: At program point exists_runnable_threadENTRY(lines 287 306) the Hoare annotation is: true [2022-11-16 12:23:47,803 INFO L902 garLoopResultBuilder]: At program point L303(lines 290 305) the Hoare annotation is: true [2022-11-16 12:23:47,804 INFO L899 garLoopResultBuilder]: For program point L295(lines 295 300) no Hoare annotation was computed. [2022-11-16 12:23:47,804 INFO L899 garLoopResultBuilder]: For program point L291(lines 291 301) no Hoare annotation was computed. [2022-11-16 12:23:47,804 INFO L899 garLoopResultBuilder]: For program point exists_runnable_threadFINAL(lines 287 306) no Hoare annotation was computed. [2022-11-16 12:23:47,804 INFO L899 garLoopResultBuilder]: For program point L96(lines 96 101) no Hoare annotation was computed. [2022-11-16 12:23:47,804 INFO L899 garLoopResultBuilder]: For program point L95(lines 95 104) no Hoare annotation was computed. [2022-11-16 12:23:47,804 INFO L899 garLoopResultBuilder]: For program point L95-2(lines 94 118) no Hoare annotation was computed. [2022-11-16 12:23:47,804 INFO L902 garLoopResultBuilder]: At program point is_do_read_c_triggeredENTRY(lines 91 119) the Hoare annotation is: true [2022-11-16 12:23:47,805 INFO L895 garLoopResultBuilder]: At program point L116(lines 94 118) the Hoare annotation is: (or (not (<= ~c_dr_pc~0 0)) (not (= ~c_dr_st~0 0)) (and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1)) (not (= 1 ~c_dr_i~0))) [2022-11-16 12:23:47,805 INFO L899 garLoopResultBuilder]: For program point is_do_read_c_triggeredFINAL(lines 91 119) no Hoare annotation was computed. [2022-11-16 12:23:47,805 INFO L899 garLoopResultBuilder]: For program point L106(lines 106 111) no Hoare annotation was computed. [2022-11-16 12:23:47,805 INFO L899 garLoopResultBuilder]: For program point L105-1(lines 105 114) no Hoare annotation was computed. [2022-11-16 12:23:47,805 INFO L899 garLoopResultBuilder]: For program point is_do_read_c_triggeredEXIT(lines 91 119) no Hoare annotation was computed. [2022-11-16 12:23:47,806 INFO L895 garLoopResultBuilder]: At program point fire_delta_eventsENTRY(lines 307 324) the Hoare annotation is: (let ((.cse0 (and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0)))) (and (or .cse0 (not (= ~c_dr_pc~0 1))) (or (not (<= ~c_dr_pc~0 0)) (not (= ~c_dr_st~0 0)) .cse0 (not (= 1 ~c_dr_i~0))))) [2022-11-16 12:23:47,806 INFO L899 garLoopResultBuilder]: For program point L316-1(lines 307 324) no Hoare annotation was computed. [2022-11-16 12:23:47,806 INFO L899 garLoopResultBuilder]: For program point L311-1(lines 310 323) no Hoare annotation was computed. [2022-11-16 12:23:47,806 INFO L899 garLoopResultBuilder]: For program point fire_delta_eventsEXIT(lines 307 324) no Hoare annotation was computed. [2022-11-16 12:23:47,806 INFO L899 garLoopResultBuilder]: For program point L258-1(lines 254 268) no Hoare annotation was computed. [2022-11-16 12:23:47,807 INFO L895 garLoopResultBuilder]: At program point L49(lines 32 51) the Hoare annotation is: (let ((.cse1 (not (= ~c_dr_pc~0 1))) (.cse0 (= ~q_req_up~0 0)) (.cse3 (not (<= ~c_dr_pc~0 0))) (.cse4 (not (= ~c_dr_st~0 0))) (.cse2 (not (= |old(~q_req_up~0)| 0))) (.cse5 (not (= 1 ~c_dr_i~0)))) (and (or .cse0 .cse1) (or .cse1 .cse2) (or .cse3 .cse4 .cse0 .cse5) (or .cse3 .cse4 .cse2 .cse5))) [2022-11-16 12:23:47,809 INFO L895 garLoopResultBuilder]: At program point update_channelsENTRY(lines 254 268) the Hoare annotation is: (let ((.cse0 (and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|)))) (and (or .cse0 (not (= ~c_dr_pc~0 1))) (or (not (<= ~c_dr_pc~0 0)) .cse0 (not (= ~c_dr_st~0 0)) (not (= 1 ~c_dr_i~0))))) [2022-11-16 12:23:47,809 INFO L899 garLoopResultBuilder]: For program point update_channelsEXIT(lines 254 268) no Hoare annotation was computed. [2022-11-16 12:23:47,809 INFO L899 garLoopResultBuilder]: For program point L41-1(lines 41 45) no Hoare annotation was computed. [2022-11-16 12:23:47,809 INFO L899 garLoopResultBuilder]: For program point L36(lines 36 40) no Hoare annotation was computed. [2022-11-16 12:23:47,809 INFO L899 garLoopResultBuilder]: For program point L36-2(lines 35 50) no Hoare annotation was computed. [2022-11-16 12:23:47,810 INFO L899 garLoopResultBuilder]: For program point reset_delta_eventsEXIT(lines 325 342) no Hoare annotation was computed. [2022-11-16 12:23:47,810 INFO L899 garLoopResultBuilder]: For program point L334-1(lines 325 342) no Hoare annotation was computed. [2022-11-16 12:23:47,810 INFO L899 garLoopResultBuilder]: For program point L329-1(lines 328 341) no Hoare annotation was computed. [2022-11-16 12:23:47,810 INFO L895 garLoopResultBuilder]: At program point reset_delta_eventsENTRY(lines 325 342) the Hoare annotation is: (let ((.cse0 (and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0)))) (and (or .cse0 (not (= ~c_dr_pc~0 1))) (or (not (<= ~c_dr_pc~0 0)) (not (= ~c_dr_st~0 0)) .cse0 (not (= 1 ~c_dr_i~0))))) [2022-11-16 12:23:47,810 INFO L899 garLoopResultBuilder]: For program point L514-1(line 514) no Hoare annotation was computed. [2022-11-16 12:23:47,810 INFO L899 garLoopResultBuilder]: For program point L415(lines 415 419) no Hoare annotation was computed. [2022-11-16 12:23:47,811 INFO L899 garLoopResultBuilder]: For program point L415-1(lines 410 450) no Hoare annotation was computed. [2022-11-16 12:23:47,811 INFO L899 garLoopResultBuilder]: For program point L349(lines 349 356) no Hoare annotation was computed. [2022-11-16 12:23:47,811 INFO L895 garLoopResultBuilder]: At program point L349-2(lines 345 360) the Hoare annotation is: (or (and (= ~c_dr_st~0 0) (= 1 ~c_dr_i~0) (<= ~c_dr_pc~0 0)) (= ~c_dr_pc~0 1)) [2022-11-16 12:23:47,811 INFO L899 garLoopResultBuilder]: For program point L465(lines 465 470) no Hoare annotation was computed. [2022-11-16 12:23:47,811 INFO L899 garLoopResultBuilder]: For program point L234(lines 234 246) no Hoare annotation was computed. [2022-11-16 12:23:47,811 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-16 12:23:47,812 INFO L899 garLoopResultBuilder]: For program point L218-1(lines 218 228) no Hoare annotation was computed. [2022-11-16 12:23:47,812 INFO L899 garLoopResultBuilder]: For program point L152(lines 152 160) no Hoare annotation was computed. [2022-11-16 12:23:47,812 INFO L895 garLoopResultBuilder]: At program point L499(line 499) the Hoare annotation is: (or (and (= ~c_dr_st~0 0) (= 1 ~c_dr_i~0) (<= ~c_dr_pc~0 0)) (= ~c_dr_pc~0 1)) [2022-11-16 12:23:47,812 INFO L899 garLoopResultBuilder]: For program point L499-1(line 499) no Hoare annotation was computed. [2022-11-16 12:23:47,812 INFO L899 garLoopResultBuilder]: For program point L235(lines 235 241) no Hoare annotation was computed. [2022-11-16 12:23:47,812 INFO L899 garLoopResultBuilder]: For program point L202(lines 202 206) no Hoare annotation was computed. [2022-11-16 12:23:47,813 INFO L895 garLoopResultBuilder]: At program point L153(lines 148 192) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 1))) (or (and (= ~c_dr_st~0 0) (not (= ~p_dw_st~0 0)) (= 1 ~c_dr_i~0) .cse0 (<= ~c_dr_pc~0 0)) (and (= ~c_dr_pc~0 1) .cse0))) [2022-11-16 12:23:47,813 INFO L895 garLoopResultBuilder]: At program point L203(lines 198 252) the Hoare annotation is: false [2022-11-16 12:23:47,813 INFO L895 garLoopResultBuilder]: At program point L484(line 484) the Hoare annotation is: (and (= ~c_dr_st~0 0) (= ~q_write_ev~0 ~q_read_ev~0) (= 1 ~c_dr_i~0) (= ~q_req_up~0 0) (= ~p_dw_st~0 0) (<= 2 ~slow_clk_edge~0) (= ~q_read_ev~0 2) (<= 2 ~fast_clk_edge~0) (= ~q_req_up~0 ~p_dw_pc~0) (= ~c_dr_pc~0 ~q_req_up~0)) [2022-11-16 12:23:47,813 INFO L899 garLoopResultBuilder]: For program point L484-1(line 484) no Hoare annotation was computed. [2022-11-16 12:23:47,813 INFO L895 garLoopResultBuilder]: At program point L451(lines 404 456) the Hoare annotation is: (or (and (= ~c_dr_st~0 0) (= 1 ~c_dr_i~0) (<= ~c_dr_pc~0 0)) (= ~c_dr_pc~0 1)) [2022-11-16 12:23:47,813 INFO L895 garLoopResultBuilder]: At program point L435(lines 410 450) the Hoare annotation is: (or (and (= ~c_dr_st~0 0) (= 1 ~c_dr_i~0) (<= ~c_dr_pc~0 0)) (= ~c_dr_pc~0 1)) [2022-11-16 12:23:47,814 INFO L895 garLoopResultBuilder]: At program point L171(lines 148 192) the Hoare annotation is: (or (and (= ~c_dr_st~0 0) (not (= ~p_dw_st~0 0)) (= 1 ~c_dr_i~0) (<= ~c_dr_pc~0 0)) (= ~c_dr_pc~0 1)) [2022-11-16 12:23:47,814 INFO L895 garLoopResultBuilder]: At program point L551(lines 535 553) the Hoare annotation is: (and (= ~c_dr_st~0 0) (= ~q_write_ev~0 ~q_read_ev~0) (= 1 ~c_dr_i~0) (= ~q_req_up~0 0) (= ~p_dw_st~0 0) (<= 2 ~slow_clk_edge~0) (= ~q_read_ev~0 2) (<= 2 ~fast_clk_edge~0) (= ~q_req_up~0 ~p_dw_pc~0) (= ~c_dr_pc~0 ~q_req_up~0)) [2022-11-16 12:23:47,814 INFO L895 garLoopResultBuilder]: At program point L188(lines 145 193) the Hoare annotation is: (or (and (= ~c_dr_st~0 0) (not (= ~p_dw_st~0 0)) (= 1 ~c_dr_i~0) (<= ~c_dr_pc~0 0)) (= ~c_dr_pc~0 1)) [2022-11-16 12:23:47,814 INFO L899 garLoopResultBuilder]: For program point L155(lines 155 159) no Hoare annotation was computed. [2022-11-16 12:23:47,814 INFO L895 garLoopResultBuilder]: At program point L370-1(lines 361 378) the Hoare annotation is: (or (and (= ~c_dr_st~0 0) (= 1 ~c_dr_i~0) (<= ~c_dr_pc~0 0)) (= ~c_dr_pc~0 1)) [2022-11-16 12:23:47,815 INFO L895 garLoopResultBuilder]: At program point L486(line 486) the Hoare annotation is: (let ((.cse0 (= ~c_dr_st~0 0)) (.cse1 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse2 (= 1 ~c_dr_i~0)) (.cse3 (= ~q_req_up~0 0)) (.cse4 (= ~q_read_ev~0 2)) (.cse5 (= ~q_req_up~0 ~p_dw_pc~0)) (.cse6 (= ~c_dr_pc~0 ~q_req_up~0))) (or (and .cse0 (not (= ~p_dw_st~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 (<= 2 ~slow_clk_edge~0) .cse4 (<= 2 ~fast_clk_edge~0) .cse5 .cse6))) [2022-11-16 12:23:47,815 INFO L895 garLoopResultBuilder]: At program point L486-1(line 486) the Hoare annotation is: (let ((.cse0 (= ~c_dr_st~0 0)) (.cse1 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse2 (= 1 ~c_dr_i~0)) (.cse3 (= ~q_req_up~0 0)) (.cse4 (= ~q_read_ev~0 2)) (.cse5 (= ~q_req_up~0 ~p_dw_pc~0)) (.cse6 (= ~c_dr_pc~0 ~q_req_up~0))) (or (and .cse0 (not (= ~p_dw_st~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 (<= 2 ~slow_clk_edge~0) .cse4 (<= 2 ~fast_clk_edge~0) .cse5 .cse6))) [2022-11-16 12:23:47,815 INFO L899 garLoopResultBuilder]: For program point L420(lines 410 450) no Hoare annotation was computed. [2022-11-16 12:23:47,815 INFO L895 garLoopResultBuilder]: At program point L503(line 503) the Hoare annotation is: (or (and (= ~c_dr_st~0 0) (= 1 ~c_dr_i~0) (<= ~c_dr_pc~0 0)) (= ~c_dr_pc~0 1)) [2022-11-16 12:23:47,815 INFO L895 garLoopResultBuilder]: At program point L503-1(line 503) the Hoare annotation is: (or (and (= ~c_dr_st~0 0) (= 1 ~c_dr_i~0) (<= ~c_dr_pc~0 0)) (= ~c_dr_pc~0 1)) [2022-11-16 12:23:47,816 INFO L895 garLoopResultBuilder]: At program point L239(line 239) the Hoare annotation is: false [2022-11-16 12:23:47,816 INFO L895 garLoopResultBuilder]: At program point L487(line 487) the Hoare annotation is: (let ((.cse0 (= ~c_dr_st~0 0)) (.cse1 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse2 (= 1 ~c_dr_i~0)) (.cse3 (= ~q_req_up~0 0)) (.cse4 (= ~q_read_ev~0 2)) (.cse5 (= ~q_req_up~0 ~p_dw_pc~0)) (.cse6 (= ~c_dr_pc~0 ~q_req_up~0))) (or (and .cse0 (not (= ~p_dw_st~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 (<= 2 ~slow_clk_edge~0) .cse4 (<= 2 ~fast_clk_edge~0) .cse5 .cse6))) [2022-11-16 12:23:47,816 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-16 12:23:47,816 INFO L895 garLoopResultBuilder]: At program point L504(line 504) the Hoare annotation is: (or (and (= ~c_dr_st~0 0) (= 1 ~c_dr_i~0) (<= ~c_dr_pc~0 0)) (= ~c_dr_pc~0 1)) [2022-11-16 12:23:47,816 INFO L899 garLoopResultBuilder]: For program point L273(lines 273 277) no Hoare annotation was computed. [2022-11-16 12:23:47,816 INFO L899 garLoopResultBuilder]: For program point L273-2(lines 272 285) no Hoare annotation was computed. [2022-11-16 12:23:47,817 INFO L895 garLoopResultBuilder]: At program point L505(line 505) the Hoare annotation is: (or (and (= ~c_dr_st~0 0) (= 1 ~c_dr_i~0) (<= ~c_dr_pc~0 0)) (= ~c_dr_pc~0 1)) [2022-11-16 12:23:47,817 INFO L895 garLoopResultBuilder]: At program point L472(lines 461 474) the Hoare annotation is: (or (and (= ~c_dr_st~0 0) (= 1 ~c_dr_i~0) (<= ~c_dr_pc~0 0)) (= ~c_dr_pc~0 1)) [2022-11-16 12:23:47,817 INFO L899 garLoopResultBuilder]: For program point L439(lines 439 446) no Hoare annotation was computed. [2022-11-16 12:23:47,817 INFO L895 garLoopResultBuilder]: At program point L473(lines 457 475) the Hoare annotation is: (or (and (= ~c_dr_st~0 0) (= 1 ~c_dr_i~0) (<= ~c_dr_pc~0 0)) (= ~c_dr_pc~0 1)) [2022-11-16 12:23:47,817 INFO L899 garLoopResultBuilder]: For program point L523(lines 523 527) no Hoare annotation was computed. [2022-11-16 12:23:47,817 INFO L899 garLoopResultBuilder]: For program point L424(lines 424 431) no Hoare annotation was computed. [2022-11-16 12:23:47,818 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-16 12:23:47,818 INFO L895 garLoopResultBuilder]: At program point L491-1(lines 488 528) the Hoare annotation is: (or (and (= ~c_dr_st~0 0) (= 1 ~c_dr_i~0) (<= ~c_dr_pc~0 0)) (= ~c_dr_pc~0 1)) [2022-11-16 12:23:47,818 INFO L899 garLoopResultBuilder]: For program point L508(line 508) no Hoare annotation was computed. [2022-11-16 12:23:47,818 INFO L895 garLoopResultBuilder]: At program point L244(line 244) the Hoare annotation is: false [2022-11-16 12:23:47,818 INFO L899 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2022-11-16 12:23:47,818 INFO L902 garLoopResultBuilder]: At program point L244-1(lines 198 252) the Hoare annotation is: true [2022-11-16 12:23:47,819 INFO L899 garLoopResultBuilder]: For program point L492(line 492) no Hoare annotation was computed. [2022-11-16 12:23:47,819 INFO L895 garLoopResultBuilder]: At program point L278-1(lines 269 286) the Hoare annotation is: (let ((.cse0 (= ~c_dr_st~0 0)) (.cse1 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse2 (= 1 ~c_dr_i~0)) (.cse3 (= ~q_req_up~0 0)) (.cse4 (= ~q_read_ev~0 2)) (.cse5 (= ~q_req_up~0 ~p_dw_pc~0)) (.cse6 (= ~c_dr_pc~0 ~q_req_up~0))) (or (and .cse0 (not (= ~p_dw_st~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 (<= 2 ~slow_clk_edge~0) .cse4 (<= 2 ~fast_clk_edge~0) .cse5 .cse6))) [2022-11-16 12:23:47,819 INFO L899 garLoopResultBuilder]: For program point L510(lines 510 519) no Hoare annotation was computed. [2022-11-16 12:23:47,819 INFO L899 garLoopResultBuilder]: For program point L510-2(lines 510 519) no Hoare annotation was computed. [2022-11-16 12:23:47,819 INFO L895 garLoopResultBuilder]: At program point L411(line 411) the Hoare annotation is: (or (and (= ~c_dr_st~0 0) (= 1 ~c_dr_i~0) (<= ~c_dr_pc~0 0)) (= ~c_dr_pc~0 1)) [2022-11-16 12:23:47,820 INFO L895 garLoopResultBuilder]: At program point L164-1(lines 148 192) the Hoare annotation is: (let ((.cse6 (= ~p_dw_pc~0 1))) (let ((.cse1 (= ~c_dr_st~0 0)) (.cse2 (not (= ~p_dw_st~0 0))) (.cse3 (= 1 ~c_dr_i~0)) (.cse0 (not .cse6)) (.cse4 (<= ~c_dr_pc~0 0)) (.cse5 (= ~q_req_up~0 ~p_dw_pc~0))) (or (and (= ~c_dr_pc~0 1) .cse0) (and .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse1 .cse2 .cse3 .cse0 .cse4) (and .cse6 .cse5 (= ~c_dr_pc~0 ~q_req_up~0))))) [2022-11-16 12:23:47,820 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-16 12:23:47,820 INFO L899 garLoopResultBuilder]: For program point L165(line 165) no Hoare annotation was computed. [2022-11-16 12:23:47,820 INFO L899 garLoopResultBuilder]: For program point L413(line 413) no Hoare annotation was computed. [2022-11-16 12:23:47,820 INFO L895 garLoopResultBuilder]: At program point L248(lines 195 253) the Hoare annotation is: (= ~c_dr_pc~0 1) [2022-11-16 12:23:47,820 INFO L899 garLoopResultBuilder]: For program point L149(lines 149 161) no Hoare annotation was computed. [2022-11-16 12:23:47,821 INFO L902 garLoopResultBuilder]: At program point L529(lines 476 534) the Hoare annotation is: true [2022-11-16 12:23:47,821 INFO L895 garLoopResultBuilder]: At program point L463(line 463) the Hoare annotation is: (or (and (= ~c_dr_st~0 0) (= 1 ~c_dr_i~0) (<= ~c_dr_pc~0 0)) (= ~c_dr_pc~0 1)) [2022-11-16 12:23:47,821 INFO L899 garLoopResultBuilder]: For program point L463-1(line 463) no Hoare annotation was computed. [2022-11-16 12:23:47,821 INFO L899 garLoopResultBuilder]: For program point L199(lines 199 207) no Hoare annotation was computed. [2022-11-16 12:23:47,821 INFO L902 garLoopResultBuilder]: At program point L563(lines 554 565) the Hoare annotation is: true [2022-11-16 12:23:47,821 INFO L899 garLoopResultBuilder]: For program point L365(lines 365 369) no Hoare annotation was computed. [2022-11-16 12:23:47,822 INFO L899 garLoopResultBuilder]: For program point L365-2(lines 364 377) no Hoare annotation was computed. [2022-11-16 12:23:47,822 INFO L895 garLoopResultBuilder]: At program point L514(line 514) the Hoare annotation is: (or (and (= ~c_dr_st~0 0) (= 1 ~c_dr_i~0) (<= ~c_dr_pc~0 0)) (= ~c_dr_pc~0 1)) [2022-11-16 12:23:47,822 INFO L899 garLoopResultBuilder]: For program point L66-2(lines 65 89) no Hoare annotation was computed. [2022-11-16 12:23:47,822 INFO L895 garLoopResultBuilder]: At program point L87(lines 65 89) the Hoare annotation is: (let ((.cse2 (not (= ~q_read_ev~0 2))) (.cse3 (not (<= ~c_dr_pc~0 0))) (.cse4 (not (= ~c_dr_st~0 0))) (.cse0 (and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))) (.cse1 (= ~p_dw_pc~0 1)) (.cse5 (not (= 1 ~c_dr_i~0)))) (and (or .cse0 .cse1 (not (= ~c_dr_pc~0 1)) .cse2) (or .cse3 .cse4 .cse0 .cse1 .cse2 .cse5) (or .cse3 (not (<= 2 ~fast_clk_edge~0)) .cse4 .cse0 (not .cse1) .cse5))) [2022-11-16 12:23:47,822 INFO L899 garLoopResultBuilder]: For program point is_do_write_p_triggeredFINAL(lines 62 90) no Hoare annotation was computed. [2022-11-16 12:23:47,823 INFO L899 garLoopResultBuilder]: For program point is_do_write_p_triggeredEXIT(lines 62 90) no Hoare annotation was computed. [2022-11-16 12:23:47,823 INFO L899 garLoopResultBuilder]: For program point L77(lines 77 82) no Hoare annotation was computed. [2022-11-16 12:23:47,823 INFO L899 garLoopResultBuilder]: For program point L76-1(lines 76 85) no Hoare annotation was computed. [2022-11-16 12:23:47,823 INFO L902 garLoopResultBuilder]: At program point is_do_write_p_triggeredENTRY(lines 62 90) the Hoare annotation is: true [2022-11-16 12:23:47,823 INFO L899 garLoopResultBuilder]: For program point L67(lines 67 72) no Hoare annotation was computed. [2022-11-16 12:23:47,823 INFO L899 garLoopResultBuilder]: For program point L66(lines 66 75) no Hoare annotation was computed. [2022-11-16 12:23:47,823 INFO L899 garLoopResultBuilder]: For program point errorEXIT(lines 15 22) no Hoare annotation was computed. [2022-11-16 12:23:47,824 INFO L899 garLoopResultBuilder]: For program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2022-11-16 12:23:47,824 INFO L902 garLoopResultBuilder]: At program point errorENTRY(lines 15 22) the Hoare annotation is: true [2022-11-16 12:23:47,824 INFO L899 garLoopResultBuilder]: For program point errorFINAL(lines 15 22) no Hoare annotation was computed. [2022-11-16 12:23:47,827 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:23:47,829 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-16 12:23:47,849 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:23:47 BoogieIcfgContainer [2022-11-16 12:23:47,849 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-16 12:23:47,850 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-16 12:23:47,850 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-16 12:23:47,850 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-16 12:23:47,850 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:22:37" (3/4) ... [2022-11-16 12:23:47,853 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-16 12:23:47,859 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads [2022-11-16 12:23:47,859 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread [2022-11-16 12:23:47,860 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_read_c_triggered [2022-11-16 12:23:47,860 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events [2022-11-16 12:23:47,860 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels [2022-11-16 12:23:47,860 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events [2022-11-16 12:23:47,860 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_write_p_triggered [2022-11-16 12:23:47,860 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure error [2022-11-16 12:23:47,867 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2022-11-16 12:23:47,868 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-11-16 12:23:47,868 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-16 12:23:47,869 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-16 12:23:47,893 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((q_req_up == 0 || !(c_dr_pc == 1)) && (!(c_dr_pc == 1) || !(\old(q_req_up) == 0))) && (((!(c_dr_pc <= 0) || !(c_dr_st == 0)) || q_req_up == 0) || !(1 == c_dr_i))) && (((!(c_dr_pc <= 0) || !(c_dr_st == 0)) || !(\old(q_req_up) == 0)) || !(1 == c_dr_i)) [2022-11-16 12:23:47,927 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b95077d-648b-4751-8119-54f94f39b50c/bin/uautomizer-tPACEb0tL8/witness.graphml [2022-11-16 12:23:47,928 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-16 12:23:47,928 INFO L158 Benchmark]: Toolchain (without parser) took 71929.46ms. Allocated memory was 134.2MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 93.2MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 81.9MB. Max. memory is 16.1GB. [2022-11-16 12:23:47,929 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 134.2MB. Free memory is still 110.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 12:23:47,929 INFO L158 Benchmark]: CACSL2BoogieTranslator took 408.95ms. Allocated memory is still 134.2MB. Free memory was 93.1MB in the beginning and 104.5MB in the end (delta: -11.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-16 12:23:47,930 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.86ms. Allocated memory is still 134.2MB. Free memory was 104.5MB in the beginning and 102.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 12:23:47,930 INFO L158 Benchmark]: Boogie Preprocessor took 28.69ms. Allocated memory is still 134.2MB. Free memory was 102.4MB in the beginning and 100.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 12:23:47,931 INFO L158 Benchmark]: RCFGBuilder took 652.35ms. Allocated memory is still 134.2MB. Free memory was 100.9MB in the beginning and 81.4MB in the end (delta: 19.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-11-16 12:23:47,932 INFO L158 Benchmark]: TraceAbstraction took 70706.83ms. Allocated memory was 134.2MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 80.8MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 925.3MB. Max. memory is 16.1GB. [2022-11-16 12:23:47,932 INFO L158 Benchmark]: Witness Printer took 78.16ms. Allocated memory is still 1.5GB. Free memory was 1.4GB in the beginning and 1.4GB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-16 12:23:47,938 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.31ms. Allocated memory is still 134.2MB. Free memory is still 110.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 408.95ms. Allocated memory is still 134.2MB. Free memory was 93.1MB in the beginning and 104.5MB in the end (delta: -11.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.86ms. Allocated memory is still 134.2MB. Free memory was 104.5MB in the beginning and 102.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.69ms. Allocated memory is still 134.2MB. Free memory was 102.4MB in the beginning and 100.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 652.35ms. Allocated memory is still 134.2MB. Free memory was 100.9MB in the beginning and 81.4MB in the end (delta: 19.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 70706.83ms. Allocated memory was 134.2MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 80.8MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 925.3MB. Max. memory is 16.1GB. * Witness Printer took 78.16ms. Allocated memory is still 1.5GB. Free memory was 1.4GB in the beginning and 1.4GB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. 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 - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 119 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 70.6s, OverallIterations: 13, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 12.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 49.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7004 SdHoareTripleChecker+Valid, 6.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6901 mSDsluCounter, 7092 SdHoareTripleChecker+Invalid, 5.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5281 mSDsCounter, 1832 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7339 IncrementalHoareTripleChecker+Invalid, 9171 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1832 mSolverCounterUnsat, 1811 mSDtfsCounter, 7339 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1096 GetRequests, 870 SyntacticMatches, 0 SemanticMatches, 226 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1170 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7921occurred in iteration=12, InterpolantAutomatonStates: 186, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 1550 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 46 LocationsWithAnnotation, 7671 PreInvPairs, 10405 NumberOfFragments, 1065 HoareAnnotationTreeSize, 7671 FomulaSimplifications, 10320 FormulaSimplificationTreeSizeReduction, 32.5s HoareSimplificationTime, 46 FomulaSimplificationsInter, 785301 FormulaSimplificationTreeSizeReductionInter, 17.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 1873 NumberOfCodeBlocks, 1873 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1857 ConstructedInterpolants, 0 QuantifiedInterpolants, 3640 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1629 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 16 InterpolantComputations, 13 PerfectInterpolantSequences, 862/889 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 461]: Loop Invariant Derived loop invariant: ((c_dr_st == 0 && 1 == c_dr_i) && c_dr_pc <= 0) || c_dr_pc == 1 - InvariantResult [Line: 476]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 457]: Loop Invariant Derived loop invariant: ((c_dr_st == 0 && 1 == c_dr_i) && c_dr_pc <= 0) || c_dr_pc == 1 - InvariantResult [Line: 290]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: (((((__retres1 <= 0 && 0 <= __retres1) || p_dw_pc == 1) || !(c_dr_pc == 1)) || !(q_read_ev == 2)) && (((((!(c_dr_pc <= 0) || !(c_dr_st == 0)) || (__retres1 <= 0 && 0 <= __retres1)) || p_dw_pc == 1) || !(q_read_ev == 2)) || !(1 == c_dr_i))) && (((((!(c_dr_pc <= 0) || !(2 <= fast_clk_edge)) || !(c_dr_st == 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_dw_pc == 1)) || !(1 == c_dr_i)) - InvariantResult [Line: 148]: Loop Invariant Derived loop invariant: ((((c_dr_st == 0 && !(p_dw_st == 0)) && 1 == c_dr_i) && p_dw_pc == 1) && c_dr_pc <= 0) || (c_dr_pc == 1 && p_dw_pc == 1) - InvariantResult [Line: 361]: Loop Invariant Derived loop invariant: ((c_dr_st == 0 && 1 == c_dr_i) && c_dr_pc <= 0) || c_dr_pc == 1 - InvariantResult [Line: 148]: Loop Invariant Derived loop invariant: (((c_dr_st == 0 && !(p_dw_st == 0)) && 1 == c_dr_i) && c_dr_pc <= 0) || c_dr_pc == 1 - InvariantResult [Line: 488]: Loop Invariant Derived loop invariant: ((c_dr_st == 0 && 1 == c_dr_i) && c_dr_pc <= 0) || c_dr_pc == 1 - InvariantResult [Line: 94]: Loop Invariant Derived loop invariant: ((!(c_dr_pc <= 0) || !(c_dr_st == 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(1 == c_dr_i) - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 410]: Loop Invariant Derived loop invariant: ((c_dr_st == 0 && 1 == c_dr_i) && c_dr_pc <= 0) || c_dr_pc == 1 - InvariantResult [Line: 148]: Loop Invariant Derived loop invariant: (((c_dr_pc == 1 && !(p_dw_pc == 1)) || ((((c_dr_st == 0 && !(p_dw_st == 0)) && 1 == c_dr_i) && c_dr_pc <= 0) && q_req_up == p_dw_pc)) || ((((c_dr_st == 0 && !(p_dw_st == 0)) && 1 == c_dr_i) && !(p_dw_pc == 1)) && c_dr_pc <= 0)) || ((p_dw_pc == 1 && q_req_up == p_dw_pc) && c_dr_pc == q_req_up) - InvariantResult [Line: 269]: Loop Invariant Derived loop invariant: (((((((c_dr_st == 0 && !(p_dw_st == 0)) && q_write_ev == q_read_ev) && 1 == c_dr_i) && q_req_up == 0) && q_read_ev == 2) && q_req_up == p_dw_pc) && c_dr_pc == q_req_up) || ((((((((c_dr_st == 0 && q_write_ev == q_read_ev) && 1 == c_dr_i) && q_req_up == 0) && 2 <= slow_clk_edge) && q_read_ev == 2) && 2 <= fast_clk_edge) && q_req_up == p_dw_pc) && c_dr_pc == q_req_up) - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: (((q_req_up == 0 || !(c_dr_pc == 1)) && (!(c_dr_pc == 1) || !(\old(q_req_up) == 0))) && (((!(c_dr_pc <= 0) || !(c_dr_st == 0)) || q_req_up == 0) || !(1 == c_dr_i))) && (((!(c_dr_pc <= 0) || !(c_dr_st == 0)) || !(\old(q_req_up) == 0)) || !(1 == c_dr_i)) - InvariantResult [Line: 554]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 535]: Loop Invariant Derived loop invariant: ((((((((c_dr_st == 0 && q_write_ev == q_read_ev) && 1 == c_dr_i) && q_req_up == 0) && p_dw_st == 0) && 2 <= slow_clk_edge) && q_read_ev == 2) && 2 <= fast_clk_edge) && q_req_up == p_dw_pc) && c_dr_pc == q_req_up - InvariantResult [Line: 195]: Loop Invariant Derived loop invariant: c_dr_pc == 1 - InvariantResult [Line: 345]: Loop Invariant Derived loop invariant: ((c_dr_st == 0 && 1 == c_dr_i) && c_dr_pc <= 0) || c_dr_pc == 1 - InvariantResult [Line: 404]: Loop Invariant Derived loop invariant: ((c_dr_st == 0 && 1 == c_dr_i) && c_dr_pc <= 0) || c_dr_pc == 1 - InvariantResult [Line: 145]: Loop Invariant Derived loop invariant: (((c_dr_st == 0 && !(p_dw_st == 0)) && 1 == c_dr_i) && c_dr_pc <= 0) || c_dr_pc == 1 RESULT: Ultimate proved your program to be correct! [2022-11-16 12:23:47,995 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b95077d-648b-4751-8119-54f94f39b50c/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE