./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/transmitter.01.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c6f43a4-3ea8-4c77-b692-b36297a46b39/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c6f43a4-3ea8-4c77-b692-b36297a46b39/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c6f43a4-3ea8-4c77-b692-b36297a46b39/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c6f43a4-3ea8-4c77-b692-b36297a46b39/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/transmitter.01.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c6f43a4-3ea8-4c77-b692-b36297a46b39/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c6f43a4-3ea8-4c77-b692-b36297a46b39/bin/uautomizer-Dbtcem3rbc --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ea17b00cb6ed3e05e0ac7861fb220a62ceca6ba97bc4fe703ce3eb0d0ec5cbfe --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 21:07:30,453 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 21:07:30,456 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 21:07:30,485 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 21:07:30,485 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 21:07:30,487 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 21:07:30,488 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 21:07:30,490 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 21:07:30,491 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 21:07:30,493 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 21:07:30,494 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 21:07:30,498 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 21:07:30,500 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 21:07:30,503 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 21:07:30,504 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 21:07:30,506 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 21:07:30,508 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 21:07:30,513 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 21:07:30,515 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 21:07:30,517 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 21:07:30,522 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 21:07:30,523 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 21:07:30,524 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 21:07:30,525 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 21:07:30,535 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 21:07:30,537 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 21:07:30,538 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 21:07:30,539 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 21:07:30,541 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 21:07:30,542 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 21:07:30,543 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 21:07:30,544 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 21:07:30,546 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 21:07:30,547 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 21:07:30,549 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 21:07:30,550 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 21:07:30,550 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 21:07:30,551 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 21:07:30,551 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 21:07:30,552 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 21:07:30,553 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 21:07:30,553 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c6f43a4-3ea8-4c77-b692-b36297a46b39/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-02 21:07:30,588 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 21:07:30,588 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 21:07:30,589 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 21:07:30,589 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 21:07:30,591 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 21:07:30,591 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 21:07:30,592 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 21:07:30,592 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 21:07:30,593 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 21:07:30,593 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 21:07:30,594 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 21:07:30,594 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 21:07:30,594 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 21:07:30,595 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 21:07:30,595 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 21:07:30,595 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 21:07:30,595 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 21:07:30,595 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 21:07:30,595 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 21:07:30,596 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 21:07:30,596 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 21:07:30,596 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 21:07:30,596 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 21:07:30,596 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 21:07:30,596 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 21:07:30,597 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 21:07:30,597 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 21:07:30,597 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 21:07:30,597 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 21:07:30,597 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 21:07:30,598 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 21:07:30,598 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 21:07:30,599 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 21:07:30,599 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_3c6f43a4-3ea8-4c77-b692-b36297a46b39/bin/uautomizer-Dbtcem3rbc/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c6f43a4-3ea8-4c77-b692-b36297a46b39/bin/uautomizer-Dbtcem3rbc Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ea17b00cb6ed3e05e0ac7861fb220a62ceca6ba97bc4fe703ce3eb0d0ec5cbfe [2022-11-02 21:07:30,944 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 21:07:30,985 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 21:07:30,988 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 21:07:30,989 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 21:07:30,990 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 21:07:30,991 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c6f43a4-3ea8-4c77-b692-b36297a46b39/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/systemc/transmitter.01.cil.c [2022-11-02 21:07:31,074 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c6f43a4-3ea8-4c77-b692-b36297a46b39/bin/uautomizer-Dbtcem3rbc/data/1cf4e78a4/df27d643a165455e84d4e795d3be5b03/FLAGfaf6b7b40 [2022-11-02 21:07:31,587 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 21:07:31,588 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c6f43a4-3ea8-4c77-b692-b36297a46b39/sv-benchmarks/c/systemc/transmitter.01.cil.c [2022-11-02 21:07:31,601 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c6f43a4-3ea8-4c77-b692-b36297a46b39/bin/uautomizer-Dbtcem3rbc/data/1cf4e78a4/df27d643a165455e84d4e795d3be5b03/FLAGfaf6b7b40 [2022-11-02 21:07:31,955 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c6f43a4-3ea8-4c77-b692-b36297a46b39/bin/uautomizer-Dbtcem3rbc/data/1cf4e78a4/df27d643a165455e84d4e795d3be5b03 [2022-11-02 21:07:31,958 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 21:07:31,961 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 21:07:31,965 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 21:07:31,967 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 21:07:31,970 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 21:07:31,971 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 09:07:31" (1/1) ... [2022-11-02 21:07:31,973 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6de06e13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:07:31, skipping insertion in model container [2022-11-02 21:07:31,974 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 09:07:31" (1/1) ... [2022-11-02 21:07:31,982 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 21:07:32,031 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 21:07:32,247 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c6f43a4-3ea8-4c77-b692-b36297a46b39/sv-benchmarks/c/systemc/transmitter.01.cil.c[706,719] [2022-11-02 21:07:32,304 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 21:07:32,319 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 21:07:32,340 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c6f43a4-3ea8-4c77-b692-b36297a46b39/sv-benchmarks/c/systemc/transmitter.01.cil.c[706,719] [2022-11-02 21:07:32,371 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 21:07:32,399 INFO L208 MainTranslator]: Completed translation [2022-11-02 21:07:32,399 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:07:32 WrapperNode [2022-11-02 21:07:32,399 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 21:07:32,400 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 21:07:32,400 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 21:07:32,400 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 21:07:32,408 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:07:32" (1/1) ... [2022-11-02 21:07:32,425 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:07:32" (1/1) ... [2022-11-02 21:07:32,445 INFO L138 Inliner]: procedures = 30, calls = 33, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 209 [2022-11-02 21:07:32,445 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 21:07:32,446 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 21:07:32,446 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 21:07:32,446 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 21:07:32,456 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:07:32" (1/1) ... [2022-11-02 21:07:32,456 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:07:32" (1/1) ... [2022-11-02 21:07:32,458 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:07:32" (1/1) ... [2022-11-02 21:07:32,458 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:07:32" (1/1) ... [2022-11-02 21:07:32,462 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:07:32" (1/1) ... [2022-11-02 21:07:32,467 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:07:32" (1/1) ... [2022-11-02 21:07:32,468 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:07:32" (1/1) ... [2022-11-02 21:07:32,469 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:07:32" (1/1) ... [2022-11-02 21:07:32,472 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 21:07:32,472 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 21:07:32,472 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 21:07:32,473 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 21:07:32,473 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:07:32" (1/1) ... [2022-11-02 21:07:32,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 21:07:32,492 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c6f43a4-3ea8-4c77-b692-b36297a46b39/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:07:32,504 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c6f43a4-3ea8-4c77-b692-b36297a46b39/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 21:07:32,530 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c6f43a4-3ea8-4c77-b692-b36297a46b39/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 21:07:32,573 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 21:07:32,573 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2022-11-02 21:07:32,573 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2022-11-02 21:07:32,573 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2022-11-02 21:07:32,573 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2022-11-02 21:07:32,574 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2022-11-02 21:07:32,574 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2022-11-02 21:07:32,574 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2022-11-02 21:07:32,574 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2022-11-02 21:07:32,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 21:07:32,575 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2022-11-02 21:07:32,575 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2022-11-02 21:07:32,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 21:07:32,575 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 21:07:32,642 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 21:07:32,644 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 21:07:33,075 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 21:07:33,092 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 21:07:33,092 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2022-11-02 21:07:33,095 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:07:33 BoogieIcfgContainer [2022-11-02 21:07:33,098 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 21:07:33,100 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 21:07:33,103 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 21:07:33,107 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 21:07:33,107 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 09:07:31" (1/3) ... [2022-11-02 21:07:33,108 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1741aa21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 09:07:33, skipping insertion in model container [2022-11-02 21:07:33,109 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:07:32" (2/3) ... [2022-11-02 21:07:33,109 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1741aa21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 09:07:33, skipping insertion in model container [2022-11-02 21:07:33,109 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:07:33" (3/3) ... [2022-11-02 21:07:33,111 INFO L112 eAbstractionObserver]: Analyzing ICFG transmitter.01.cil.c [2022-11-02 21:07:33,132 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 21:07:33,132 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-02 21:07:33,211 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 21:07:33,220 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;@532b8c90, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 21:07:33,220 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-02 21:07:33,229 INFO L276 IsEmpty]: Start isEmpty. Operand has 100 states, 80 states have (on average 1.525) internal successors, (122), 82 states have internal predecessors, (122), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-02 21:07:33,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-02 21:07:33,243 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:07:33,244 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] [2022-11-02 21:07:33,244 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:07:33,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:33,252 INFO L85 PathProgramCache]: Analyzing trace with hash -20293138, now seen corresponding path program 1 times [2022-11-02 21:07:33,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:33,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169893716] [2022-11-02 21:07:33,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:33,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:33,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:33,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 21:07:33,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:33,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 21:07:33,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:33,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-02 21:07:33,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:33,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-02 21:07:33,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:33,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-02 21:07:33,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:33,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:07:33,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:33,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169893716] [2022-11-02 21:07:33,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169893716] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:07:33,865 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:07:33,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 21:07:33,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220860499] [2022-11-02 21:07:33,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:07:33,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 21:07:33,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:33,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 21:07:33,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:07:33,953 INFO L87 Difference]: Start difference. First operand has 100 states, 80 states have (on average 1.525) internal successors, (122), 82 states have internal predecessors, (122), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 21:07:34,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:07:34,531 INFO L93 Difference]: Finished difference Result 210 states and 318 transitions. [2022-11-02 21:07:34,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 21:07:34,533 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55 [2022-11-02 21:07:34,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:07:34,551 INFO L225 Difference]: With dead ends: 210 [2022-11-02 21:07:34,552 INFO L226 Difference]: Without dead ends: 115 [2022-11-02 21:07:34,555 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-11-02 21:07:34,558 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 197 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 21:07:34,559 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 357 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 21:07:34,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-11-02 21:07:34,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 95. [2022-11-02 21:07:34,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 76 states have (on average 1.381578947368421) internal successors, (105), 77 states have internal predecessors, (105), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-02 21:07:34,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 131 transitions. [2022-11-02 21:07:34,606 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 131 transitions. Word has length 55 [2022-11-02 21:07:34,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:07:34,607 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 131 transitions. [2022-11-02 21:07:34,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 21:07:34,607 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 131 transitions. [2022-11-02 21:07:34,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-02 21:07:34,609 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:07:34,610 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] [2022-11-02 21:07:34,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 21:07:34,610 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:07:34,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:34,611 INFO L85 PathProgramCache]: Analyzing trace with hash -917686416, now seen corresponding path program 1 times [2022-11-02 21:07:34,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:34,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481964567] [2022-11-02 21:07:34,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:34,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:34,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:34,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 21:07:34,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:34,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 21:07:34,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:34,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-02 21:07:34,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:34,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-02 21:07:34,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:34,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-02 21:07:34,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:34,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:07:34,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:34,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481964567] [2022-11-02 21:07:34,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481964567] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:07:34,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:07:34,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 21:07:34,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280774505] [2022-11-02 21:07:34,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:07:34,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 21:07:34,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:34,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 21:07:34,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:07:34,828 INFO L87 Difference]: Start difference. First operand 95 states and 131 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 21:07:35,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:07:35,604 INFO L93 Difference]: Finished difference Result 334 states and 477 transitions. [2022-11-02 21:07:35,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 21:07:35,605 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55 [2022-11-02 21:07:35,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:07:35,608 INFO L225 Difference]: With dead ends: 334 [2022-11-02 21:07:35,608 INFO L226 Difference]: Without dead ends: 248 [2022-11-02 21:07:35,609 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-11-02 21:07:35,611 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 336 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 521 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 21:07:35,611 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 635 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 521 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 21:07:35,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2022-11-02 21:07:35,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 175. [2022-11-02 21:07:35,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 140 states have (on average 1.3928571428571428) internal successors, (195), 143 states have internal predecessors, (195), 22 states have call successors, (22), 10 states have call predecessors, (22), 12 states have return successors, (29), 23 states have call predecessors, (29), 22 states have call successors, (29) [2022-11-02 21:07:35,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 246 transitions. [2022-11-02 21:07:35,661 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 246 transitions. Word has length 55 [2022-11-02 21:07:35,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:07:35,662 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 246 transitions. [2022-11-02 21:07:35,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 21:07:35,662 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 246 transitions. [2022-11-02 21:07:35,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-02 21:07:35,664 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:07:35,664 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] [2022-11-02 21:07:35,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 21:07:35,665 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:07:35,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:35,666 INFO L85 PathProgramCache]: Analyzing trace with hash -669539922, now seen corresponding path program 1 times [2022-11-02 21:07:35,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:35,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375641649] [2022-11-02 21:07:35,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:35,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:35,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:35,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 21:07:35,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:35,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 21:07:35,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:35,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-02 21:07:35,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:35,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-02 21:07:35,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:35,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-02 21:07:35,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:35,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:07:35,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:35,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375641649] [2022-11-02 21:07:35,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375641649] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:07:35,774 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:07:35,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:07:35,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221051747] [2022-11-02 21:07:35,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:07:35,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:07:35,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:35,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:07:35,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:07:35,776 INFO L87 Difference]: Start difference. First operand 175 states and 246 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 21:07:36,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:07:36,325 INFO L93 Difference]: Finished difference Result 457 states and 644 transitions. [2022-11-02 21:07:36,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 21:07:36,326 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55 [2022-11-02 21:07:36,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:07:36,335 INFO L225 Difference]: With dead ends: 457 [2022-11-02 21:07:36,335 INFO L226 Difference]: Without dead ends: 293 [2022-11-02 21:07:36,342 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-11-02 21:07:36,347 INFO L413 NwaCegarLoop]: 236 mSDtfsCounter, 344 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 21:07:36,350 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 517 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 21:07:36,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2022-11-02 21:07:36,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 244. [2022-11-02 21:07:36,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 195 states have (on average 1.3743589743589744) internal successors, (268), 199 states have internal predecessors, (268), 31 states have call successors, (31), 15 states have call predecessors, (31), 17 states have return successors, (38), 31 states have call predecessors, (38), 31 states have call successors, (38) [2022-11-02 21:07:36,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 337 transitions. [2022-11-02 21:07:36,413 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 337 transitions. Word has length 55 [2022-11-02 21:07:36,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:07:36,413 INFO L495 AbstractCegarLoop]: Abstraction has 244 states and 337 transitions. [2022-11-02 21:07:36,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 21:07:36,414 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 337 transitions. [2022-11-02 21:07:36,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-02 21:07:36,424 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:07:36,424 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] [2022-11-02 21:07:36,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 21:07:36,425 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:07:36,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:36,426 INFO L85 PathProgramCache]: Analyzing trace with hash 455720047, now seen corresponding path program 1 times [2022-11-02 21:07:36,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:36,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471205203] [2022-11-02 21:07:36,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:36,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:36,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:36,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 21:07:36,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:36,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 21:07:36,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:36,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-02 21:07:36,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:36,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-02 21:07:36,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:36,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-02 21:07:36,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:36,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:07:36,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:36,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471205203] [2022-11-02 21:07:36,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471205203] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:07:36,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:07:36,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 21:07:36,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167127541] [2022-11-02 21:07:36,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:07:36,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 21:07:36,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:36,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 21:07:36,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:07:36,566 INFO L87 Difference]: Start difference. First operand 244 states and 337 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 21:07:36,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:07:36,989 INFO L93 Difference]: Finished difference Result 519 states and 731 transitions. [2022-11-02 21:07:36,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 21:07:36,989 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55 [2022-11-02 21:07:36,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:07:36,993 INFO L225 Difference]: With dead ends: 519 [2022-11-02 21:07:36,993 INFO L226 Difference]: Without dead ends: 286 [2022-11-02 21:07:36,994 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2022-11-02 21:07:37,004 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 155 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 21:07:37,007 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 455 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 21:07:37,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2022-11-02 21:07:37,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 247. [2022-11-02 21:07:37,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 198 states have (on average 1.3585858585858586) internal successors, (269), 202 states have internal predecessors, (269), 31 states have call successors, (31), 15 states have call predecessors, (31), 17 states have return successors, (38), 31 states have call predecessors, (38), 31 states have call successors, (38) [2022-11-02 21:07:37,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 338 transitions. [2022-11-02 21:07:37,047 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 338 transitions. Word has length 55 [2022-11-02 21:07:37,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:07:37,048 INFO L495 AbstractCegarLoop]: Abstraction has 247 states and 338 transitions. [2022-11-02 21:07:37,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 21:07:37,048 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 338 transitions. [2022-11-02 21:07:37,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-02 21:07:37,049 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:07:37,049 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] [2022-11-02 21:07:37,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 21:07:37,050 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:07:37,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:37,051 INFO L85 PathProgramCache]: Analyzing trace with hash 383333489, now seen corresponding path program 1 times [2022-11-02 21:07:37,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:37,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435293296] [2022-11-02 21:07:37,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:37,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:37,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:37,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 21:07:37,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:37,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 21:07:37,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:37,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-02 21:07:37,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:37,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-02 21:07:37,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:37,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-02 21:07:37,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:37,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:07:37,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:37,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435293296] [2022-11-02 21:07:37,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435293296] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:07:37,212 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:07:37,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 21:07:37,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249081917] [2022-11-02 21:07:37,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:07:37,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 21:07:37,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:37,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 21:07:37,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:07:37,214 INFO L87 Difference]: Start difference. First operand 247 states and 338 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 21:07:37,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:07:37,691 INFO L93 Difference]: Finished difference Result 531 states and 743 transitions. [2022-11-02 21:07:37,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 21:07:37,692 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55 [2022-11-02 21:07:37,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:07:37,694 INFO L225 Difference]: With dead ends: 531 [2022-11-02 21:07:37,694 INFO L226 Difference]: Without dead ends: 295 [2022-11-02 21:07:37,695 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2022-11-02 21:07:37,696 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 119 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 21:07:37,697 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 449 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 21:07:37,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2022-11-02 21:07:37,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 256. [2022-11-02 21:07:37,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 207 states have (on average 1.3429951690821256) internal successors, (278), 211 states have internal predecessors, (278), 31 states have call successors, (31), 15 states have call predecessors, (31), 17 states have return successors, (38), 31 states have call predecessors, (38), 31 states have call successors, (38) [2022-11-02 21:07:37,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 347 transitions. [2022-11-02 21:07:37,736 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 347 transitions. Word has length 55 [2022-11-02 21:07:37,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:07:37,736 INFO L495 AbstractCegarLoop]: Abstraction has 256 states and 347 transitions. [2022-11-02 21:07:37,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 21:07:37,737 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 347 transitions. [2022-11-02 21:07:37,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-02 21:07:37,738 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:07:37,738 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] [2022-11-02 21:07:37,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 21:07:37,738 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:07:37,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:37,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1988405773, now seen corresponding path program 1 times [2022-11-02 21:07:37,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:37,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107595064] [2022-11-02 21:07:37,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:37,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:37,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:37,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 21:07:37,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:37,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 21:07:37,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:37,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-02 21:07:37,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:37,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-02 21:07:37,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:37,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-02 21:07:37,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:37,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:07:37,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:37,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107595064] [2022-11-02 21:07:37,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107595064] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:07:37,843 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:07:37,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 21:07:37,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789818134] [2022-11-02 21:07:37,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:07:37,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 21:07:37,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:37,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 21:07:37,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:07:37,845 INFO L87 Difference]: Start difference. First operand 256 states and 347 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 21:07:38,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:07:38,326 INFO L93 Difference]: Finished difference Result 654 states and 887 transitions. [2022-11-02 21:07:38,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 21:07:38,327 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55 [2022-11-02 21:07:38,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:07:38,330 INFO L225 Difference]: With dead ends: 654 [2022-11-02 21:07:38,330 INFO L226 Difference]: Without dead ends: 476 [2022-11-02 21:07:38,331 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2022-11-02 21:07:38,332 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 366 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 21:07:38,333 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 402 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 21:07:38,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2022-11-02 21:07:38,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 411. [2022-11-02 21:07:38,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 337 states have (on average 1.3293768545994065) internal successors, (448), 343 states have internal predecessors, (448), 45 states have call successors, (45), 25 states have call predecessors, (45), 28 states have return successors, (50), 44 states have call predecessors, (50), 45 states have call successors, (50) [2022-11-02 21:07:38,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 543 transitions. [2022-11-02 21:07:38,385 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 543 transitions. Word has length 55 [2022-11-02 21:07:38,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:07:38,385 INFO L495 AbstractCegarLoop]: Abstraction has 411 states and 543 transitions. [2022-11-02 21:07:38,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 21:07:38,386 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 543 transitions. [2022-11-02 21:07:38,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-02 21:07:38,386 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:07:38,387 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] [2022-11-02 21:07:38,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 21:07:38,387 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:07:38,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:38,388 INFO L85 PathProgramCache]: Analyzing trace with hash 501123189, now seen corresponding path program 1 times [2022-11-02 21:07:38,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:38,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356933222] [2022-11-02 21:07:38,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:38,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:38,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:38,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 21:07:38,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:38,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 21:07:38,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:38,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-02 21:07:38,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:38,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-02 21:07:38,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:38,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-02 21:07:38,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:38,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:07:38,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:38,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356933222] [2022-11-02 21:07:38,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356933222] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:07:38,496 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:07:38,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 21:07:38,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669721884] [2022-11-02 21:07:38,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:07:38,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 21:07:38,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:38,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 21:07:38,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:07:38,498 INFO L87 Difference]: Start difference. First operand 411 states and 543 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 21:07:38,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:07:38,768 INFO L93 Difference]: Finished difference Result 848 states and 1126 transitions. [2022-11-02 21:07:38,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 21:07:38,769 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55 [2022-11-02 21:07:38,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:07:38,772 INFO L225 Difference]: With dead ends: 848 [2022-11-02 21:07:38,772 INFO L226 Difference]: Without dead ends: 448 [2022-11-02 21:07:38,774 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-02 21:07:38,779 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 220 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:07:38,779 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 319 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 21:07:38,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2022-11-02 21:07:38,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 410. [2022-11-02 21:07:38,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 336 states have (on average 1.2946428571428572) internal successors, (435), 342 states have internal predecessors, (435), 45 states have call successors, (45), 25 states have call predecessors, (45), 28 states have return successors, (50), 44 states have call predecessors, (50), 45 states have call successors, (50) [2022-11-02 21:07:38,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 530 transitions. [2022-11-02 21:07:38,840 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 530 transitions. Word has length 55 [2022-11-02 21:07:38,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:07:38,842 INFO L495 AbstractCegarLoop]: Abstraction has 410 states and 530 transitions. [2022-11-02 21:07:38,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 21:07:38,843 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 530 transitions. [2022-11-02 21:07:38,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-02 21:07:38,844 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:07:38,844 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] [2022-11-02 21:07:38,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 21:07:38,845 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:07:38,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:38,845 INFO L85 PathProgramCache]: Analyzing trace with hash 719977907, now seen corresponding path program 1 times [2022-11-02 21:07:38,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:38,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367308802] [2022-11-02 21:07:38,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:38,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:38,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:38,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 21:07:38,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:38,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 21:07:38,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:38,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-02 21:07:38,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:38,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-02 21:07:38,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:38,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-02 21:07:38,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:38,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:07:38,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:38,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367308802] [2022-11-02 21:07:38,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367308802] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:07:38,968 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:07:38,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:07:38,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112131432] [2022-11-02 21:07:38,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:07:38,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:07:38,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:38,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:07:38,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:07:38,970 INFO L87 Difference]: Start difference. First operand 410 states and 530 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 21:07:39,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:07:39,382 INFO L93 Difference]: Finished difference Result 1248 states and 1632 transitions. [2022-11-02 21:07:39,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 21:07:39,383 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55 [2022-11-02 21:07:39,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:07:39,388 INFO L225 Difference]: With dead ends: 1248 [2022-11-02 21:07:39,388 INFO L226 Difference]: Without dead ends: 849 [2022-11-02 21:07:39,390 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-11-02 21:07:39,390 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 324 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:07:39,391 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 291 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 21:07:39,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2022-11-02 21:07:39,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 787. [2022-11-02 21:07:39,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 787 states, 644 states have (on average 1.2763975155279503) internal successors, (822), 655 states have internal predecessors, (822), 85 states have call successors, (85), 50 states have call predecessors, (85), 57 states have return successors, (113), 85 states have call predecessors, (113), 85 states have call successors, (113) [2022-11-02 21:07:39,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 1020 transitions. [2022-11-02 21:07:39,485 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 1020 transitions. Word has length 55 [2022-11-02 21:07:39,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:07:39,485 INFO L495 AbstractCegarLoop]: Abstraction has 787 states and 1020 transitions. [2022-11-02 21:07:39,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 21:07:39,486 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 1020 transitions. [2022-11-02 21:07:39,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-02 21:07:39,487 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:07:39,487 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] [2022-11-02 21:07:39,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 21:07:39,487 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:07:39,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:39,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1595512707, now seen corresponding path program 1 times [2022-11-02 21:07:39,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:39,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260212448] [2022-11-02 21:07:39,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:39,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:39,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:39,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 21:07:39,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:39,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 21:07:39,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:39,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-02 21:07:39,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:39,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-02 21:07:39,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:39,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-02 21:07:39,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:39,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:07:39,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:39,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260212448] [2022-11-02 21:07:39,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260212448] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:07:39,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:07:39,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 21:07:39,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577680614] [2022-11-02 21:07:39,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:07:39,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 21:07:39,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:39,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 21:07:39,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:07:39,575 INFO L87 Difference]: Start difference. First operand 787 states and 1020 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-11-02 21:07:39,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:07:39,989 INFO L93 Difference]: Finished difference Result 2374 states and 3066 transitions. [2022-11-02 21:07:39,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 21:07:39,990 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 56 [2022-11-02 21:07:39,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:07:40,000 INFO L225 Difference]: With dead ends: 2374 [2022-11-02 21:07:40,000 INFO L226 Difference]: Without dead ends: 1601 [2022-11-02 21:07:40,004 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-02 21:07:40,004 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 264 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:07:40,005 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 276 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 21:07:40,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1601 states. [2022-11-02 21:07:40,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1601 to 1471. [2022-11-02 21:07:40,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1471 states, 1193 states have (on average 1.2514668901927912) internal successors, (1493), 1213 states have internal predecessors, (1493), 163 states have call successors, (163), 100 states have call predecessors, (163), 114 states have return successors, (217), 161 states have call predecessors, (217), 163 states have call successors, (217) [2022-11-02 21:07:40,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1471 states to 1471 states and 1873 transitions. [2022-11-02 21:07:40,182 INFO L78 Accepts]: Start accepts. Automaton has 1471 states and 1873 transitions. Word has length 56 [2022-11-02 21:07:40,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:07:40,182 INFO L495 AbstractCegarLoop]: Abstraction has 1471 states and 1873 transitions. [2022-11-02 21:07:40,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-11-02 21:07:40,183 INFO L276 IsEmpty]: Start isEmpty. Operand 1471 states and 1873 transitions. [2022-11-02 21:07:40,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-11-02 21:07:40,185 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:07:40,185 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:07:40,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 21:07:40,185 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:07:40,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:40,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1907953452, now seen corresponding path program 1 times [2022-11-02 21:07:40,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:40,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382817727] [2022-11-02 21:07:40,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:40,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:40,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:40,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 21:07:40,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:40,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 21:07:40,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:40,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-02 21:07:40,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:40,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-02 21:07:40,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:40,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-02 21:07:40,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:40,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-02 21:07:40,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:40,301 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-02 21:07:40,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:40,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382817727] [2022-11-02 21:07:40,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382817727] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:07:40,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:07:40,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:07:40,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230946373] [2022-11-02 21:07:40,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:07:40,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:07:40,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:40,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:07:40,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:07:40,304 INFO L87 Difference]: Start difference. First operand 1471 states and 1873 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-02 21:07:41,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:07:41,137 INFO L93 Difference]: Finished difference Result 4511 states and 5775 transitions. [2022-11-02 21:07:41,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-02 21:07:41,138 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 73 [2022-11-02 21:07:41,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:07:41,149 INFO L225 Difference]: With dead ends: 4511 [2022-11-02 21:07:41,149 INFO L226 Difference]: Without dead ends: 2340 [2022-11-02 21:07:41,154 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2022-11-02 21:07:41,155 INFO L413 NwaCegarLoop]: 194 mSDtfsCounter, 500 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 516 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 21:07:41,155 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [516 Valid, 529 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 21:07:41,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2340 states. [2022-11-02 21:07:41,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2340 to 2209. [2022-11-02 21:07:41,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2209 states, 1786 states have (on average 1.232922732362822) internal successors, (2202), 1825 states have internal predecessors, (2202), 241 states have call successors, (241), 150 states have call predecessors, (241), 181 states have return successors, (375), 237 states have call predecessors, (375), 241 states have call successors, (375) [2022-11-02 21:07:41,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2209 states to 2209 states and 2818 transitions. [2022-11-02 21:07:41,386 INFO L78 Accepts]: Start accepts. Automaton has 2209 states and 2818 transitions. Word has length 73 [2022-11-02 21:07:41,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:07:41,387 INFO L495 AbstractCegarLoop]: Abstraction has 2209 states and 2818 transitions. [2022-11-02 21:07:41,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-02 21:07:41,387 INFO L276 IsEmpty]: Start isEmpty. Operand 2209 states and 2818 transitions. [2022-11-02 21:07:41,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-11-02 21:07:41,390 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:07:41,390 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:07:41,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 21:07:41,390 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:07:41,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:41,391 INFO L85 PathProgramCache]: Analyzing trace with hash 175805213, now seen corresponding path program 1 times [2022-11-02 21:07:41,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:41,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477990921] [2022-11-02 21:07:41,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:41,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:41,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 21:07:41,405 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 21:07:41,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 21:07:41,444 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 21:07:41,445 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-02 21:07:41,446 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-02 21:07:41,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 21:07:41,451 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:07:41,455 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-02 21:07:41,516 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 09:07:41 BoogieIcfgContainer [2022-11-02 21:07:41,516 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-02 21:07:41,517 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 21:07:41,517 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 21:07:41,517 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 21:07:41,518 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:07:33" (3/4) ... [2022-11-02 21:07:41,519 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-02 21:07:41,613 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c6f43a4-3ea8-4c77-b692-b36297a46b39/bin/uautomizer-Dbtcem3rbc/witness.graphml [2022-11-02 21:07:41,613 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 21:07:41,614 INFO L158 Benchmark]: Toolchain (without parser) took 9652.37ms. Allocated memory was 115.3MB in the beginning and 211.8MB in the end (delta: 96.5MB). Free memory was 80.1MB in the beginning and 175.1MB in the end (delta: -95.0MB). Peak memory consumption was 114.9MB. Max. memory is 16.1GB. [2022-11-02 21:07:41,614 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 115.3MB. Free memory was 88.8MB in the beginning and 88.7MB in the end (delta: 24.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 21:07:41,614 INFO L158 Benchmark]: CACSL2BoogieTranslator took 434.19ms. Allocated memory is still 115.3MB. Free memory was 79.8MB in the beginning and 88.4MB in the end (delta: -8.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-02 21:07:41,615 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.12ms. Allocated memory is still 115.3MB. Free memory was 88.4MB in the beginning and 86.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 21:07:41,615 INFO L158 Benchmark]: Boogie Preprocessor took 25.88ms. Allocated memory is still 115.3MB. Free memory was 86.3MB in the beginning and 84.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 21:07:41,615 INFO L158 Benchmark]: RCFGBuilder took 625.92ms. Allocated memory is still 115.3MB. Free memory was 84.8MB in the beginning and 68.0MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-02 21:07:41,616 INFO L158 Benchmark]: TraceAbstraction took 8415.73ms. Allocated memory was 115.3MB in the beginning and 211.8MB in the end (delta: 96.5MB). Free memory was 67.4MB in the beginning and 64.4MB in the end (delta: 3.0MB). Peak memory consumption was 102.3MB. Max. memory is 16.1GB. [2022-11-02 21:07:41,616 INFO L158 Benchmark]: Witness Printer took 96.50ms. Allocated memory is still 211.8MB. Free memory was 64.4MB in the beginning and 175.1MB in the end (delta: -110.7MB). Peak memory consumption was 2.6MB. Max. memory is 16.1GB. [2022-11-02 21:07:41,618 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.30ms. Allocated memory is still 115.3MB. Free memory was 88.8MB in the beginning and 88.7MB in the end (delta: 24.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 434.19ms. Allocated memory is still 115.3MB. Free memory was 79.8MB in the beginning and 88.4MB in the end (delta: -8.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.12ms. Allocated memory is still 115.3MB. Free memory was 88.4MB in the beginning and 86.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.88ms. Allocated memory is still 115.3MB. Free memory was 86.3MB in the beginning and 84.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 625.92ms. Allocated memory is still 115.3MB. Free memory was 84.8MB in the beginning and 68.0MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 8415.73ms. Allocated memory was 115.3MB in the beginning and 211.8MB in the end (delta: 96.5MB). Free memory was 67.4MB in the beginning and 64.4MB in the end (delta: 3.0MB). Peak memory consumption was 102.3MB. Max. memory is 16.1GB. * Witness Printer took 96.50ms. Allocated memory is still 211.8MB. Free memory was 64.4MB in the beginning and 175.1MB in the end (delta: -110.7MB). Peak memory consumption was 2.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 21]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L25] int m_pc = 0; [L26] int t1_pc = 0; [L27] int m_st ; [L28] int t1_st ; [L29] int m_i ; [L30] int t1_i ; [L31] int M_E = 2; [L32] int T1_E = 2; [L33] int E_1 = 2; VAL [E_1=2, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0] [L449] int __retres1 ; [L453] CALL init_model() [L364] m_i = 1 [L365] t1_i = 1 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L453] RET init_model() [L454] CALL start_simulation() [L390] int kernel_st ; [L391] int tmp ; [L392] int tmp___0 ; [L396] kernel_st = 0 VAL [E_1=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L397] FCALL update_channels() VAL [E_1=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L398] CALL init_threads() [L161] COND TRUE m_i == 1 [L162] m_st = 0 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L166] COND TRUE t1_i == 1 [L167] t1_st = 0 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L398] RET init_threads() [L399] CALL fire_delta_events() VAL [\old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L250] COND FALSE !(M_E == 0) VAL [\old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L255] COND FALSE !(T1_E == 0) VAL [\old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L260] COND FALSE !(E_1 == 0) VAL [\old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L399] RET fire_delta_events() VAL [E_1=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L400] CALL activate_threads() VAL [\old(m_st)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L293] int tmp ; [L294] int tmp___0 ; [L298] CALL, EXPR is_master_triggered() [L112] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L115] COND FALSE !(m_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L125] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, __retres1=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L127] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \result=0, __retres1=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L298] RET, EXPR is_master_triggered() [L298] tmp = is_master_triggered() [L300] COND FALSE !(\read(tmp)) VAL [\old(m_st)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0] [L306] CALL, EXPR is_transmit1_triggered() [L131] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L134] COND FALSE !(t1_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L144] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, __retres1=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L146] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \result=0, __retres1=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L306] RET, EXPR is_transmit1_triggered() [L306] tmp___0 = is_transmit1_triggered() [L308] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0, tmp___0=0] [L400] RET activate_threads() VAL [E_1=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L401] CALL reset_delta_events() VAL [\old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L273] COND FALSE !(M_E == 1) VAL [\old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L278] COND FALSE !(T1_E == 1) VAL [\old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L283] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L401] RET reset_delta_events() VAL [E_1=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L404] COND TRUE 1 VAL [E_1=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L407] kernel_st = 1 [L408] CALL eval() [L197] int tmp ; VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L201] COND TRUE 1 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L204] CALL, EXPR exists_runnable_thread() VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L176] int __retres1 ; VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L179] COND TRUE m_st == 0 [L180] __retres1 = 1 VAL [__retres1=1, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L192] return (__retres1); VAL [\result=1, __retres1=1, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L204] RET, EXPR exists_runnable_thread() VAL [E_1=2, exists_runnable_thread()=1, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L204] tmp = exists_runnable_thread() [L206] COND TRUE \read(tmp) VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1] [L211] COND TRUE m_st == 0 [L212] int tmp_ndt_1; [L213] tmp_ndt_1 = __VERIFIER_nondet_int() [L214] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, tmp_ndt_1=0] [L225] COND TRUE t1_st == 0 [L226] int tmp_ndt_2; [L227] tmp_ndt_2 = __VERIFIER_nondet_int() [L228] COND TRUE \read(tmp_ndt_2) [L230] t1_st = 1 [L231] CALL transmit1() [L82] COND TRUE t1_pc == 0 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1] [L93] COND TRUE 1 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1] [L95] t1_pc = 1 [L96] t1_st = 2 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L231] RET transmit1() [L201] COND TRUE 1 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1] [L204] CALL, EXPR exists_runnable_thread() VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L176] int __retres1 ; VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L179] COND TRUE m_st == 0 [L180] __retres1 = 1 VAL [__retres1=1, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L192] return (__retres1); VAL [\result=1, __retres1=1, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L204] RET, EXPR exists_runnable_thread() VAL [E_1=2, exists_runnable_thread()=1, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1] [L204] tmp = exists_runnable_thread() [L206] COND TRUE \read(tmp) VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1] [L211] COND TRUE m_st == 0 [L212] int tmp_ndt_1; [L213] tmp_ndt_1 = __VERIFIER_nondet_int() [L214] COND TRUE \read(tmp_ndt_1) [L216] m_st = 1 [L217] CALL master() [L41] COND TRUE m_pc == 0 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L52] COND TRUE 1 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L55] E_1 = 1 [L56] CALL immediate_notify() [L322] CALL activate_threads() VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L293] int tmp ; [L294] int tmp___0 ; [L298] CALL, EXPR is_master_triggered() [L112] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L115] COND FALSE !(m_pc == 1) VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L125] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, __retres1=0, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L127] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \result=0, __retres1=0, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L298] RET, EXPR is_master_triggered() [L298] tmp = is_master_triggered() [L300] COND FALSE !(\read(tmp)) VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=0] [L306] CALL, EXPR is_transmit1_triggered() [L131] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L134] COND TRUE t1_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L135] COND TRUE E_1 == 1 [L136] __retres1 = 1 VAL [\old(m_st)=1, \old(t1_st)=2, __retres1=1, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L146] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \result=1, __retres1=1, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L306] RET, EXPR is_transmit1_triggered() [L306] tmp___0 = is_transmit1_triggered() [L308] COND TRUE \read(tmp___0) [L309] t1_st = 0 VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp=0, tmp___0=1] [L322] RET activate_threads() VAL [E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0] [L56] RET immediate_notify() [L57] E_1 = 2 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0] [L60] COND TRUE 1 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0] [L62] m_pc = 1 [L63] m_st = 2 VAL [E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0] [L217] RET master() [L225] COND TRUE t1_st == 0 [L226] int tmp_ndt_2; [L227] tmp_ndt_2 = __VERIFIER_nondet_int() [L228] COND TRUE \read(tmp_ndt_2) [L230] t1_st = 1 [L231] CALL transmit1() [L82] COND FALSE !(t1_pc == 0) VAL [E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1] [L85] COND TRUE t1_pc == 1 VAL [E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1] [L101] CALL error() [L21] reach_error() VAL [E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 100 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.3s, OverallIterations: 11, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2914 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2825 mSDsluCounter, 4230 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2766 mSDsCounter, 631 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3115 IncrementalHoareTripleChecker+Invalid, 3746 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 631 mSolverCounterUnsat, 1464 mSDtfsCounter, 3115 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 250 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2209occurred in iteration=10, InterpolantAutomatonStates: 110, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 10 MinimizatonAttempts, 646 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 664 NumberOfCodeBlocks, 664 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 559 ConstructedInterpolants, 0 QuantifiedInterpolants, 1169 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 14/14 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-02 21:07:41,674 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c6f43a4-3ea8-4c77-b692-b36297a46b39/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE