./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 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_760d5694-77b1-4381-85a2-e38c83341e02/bin/uautomizer-DrprNOufMa/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_760d5694-77b1-4381-85a2-e38c83341e02/bin/uautomizer-DrprNOufMa/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_760d5694-77b1-4381-85a2-e38c83341e02/bin/uautomizer-DrprNOufMa/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_760d5694-77b1-4381-85a2-e38c83341e02/bin/uautomizer-DrprNOufMa/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/transmitter.01.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_760d5694-77b1-4381-85a2-e38c83341e02/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_760d5694-77b1-4381-85a2-e38c83341e02/bin/uautomizer-DrprNOufMa --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 --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-12-07 00:46:43,605 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-07 00:46:43,607 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-07 00:46:43,629 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-07 00:46:43,629 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-07 00:46:43,630 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-07 00:46:43,631 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-07 00:46:43,633 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-07 00:46:43,635 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-07 00:46:43,635 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-07 00:46:43,636 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-07 00:46:43,637 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-07 00:46:43,638 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-07 00:46:43,638 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-07 00:46:43,639 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-07 00:46:43,641 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-07 00:46:43,641 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-07 00:46:43,642 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-07 00:46:43,644 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-07 00:46:43,645 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-07 00:46:43,647 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-07 00:46:43,648 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-07 00:46:43,649 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-07 00:46:43,650 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-07 00:46:43,652 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-07 00:46:43,652 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-07 00:46:43,653 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-07 00:46:43,653 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-07 00:46:43,654 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-07 00:46:43,655 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-07 00:46:43,655 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-07 00:46:43,656 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-07 00:46:43,656 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-07 00:46:43,657 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-07 00:46:43,658 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-07 00:46:43,658 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-07 00:46:43,659 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-07 00:46:43,659 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-07 00:46:43,659 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-07 00:46:43,660 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-07 00:46:43,660 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-07 00:46:43,661 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_760d5694-77b1-4381-85a2-e38c83341e02/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-07 00:46:43,685 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-07 00:46:43,685 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-07 00:46:43,686 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-07 00:46:43,686 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-07 00:46:43,687 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-07 00:46:43,687 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-07 00:46:43,687 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-07 00:46:43,688 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-07 00:46:43,688 INFO L138 SettingsManager]: * Use SBE=true [2021-12-07 00:46:43,688 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-07 00:46:43,688 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-07 00:46:43,688 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-07 00:46:43,689 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-07 00:46:43,689 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-07 00:46:43,689 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-07 00:46:43,689 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-07 00:46:43,689 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-07 00:46:43,689 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-07 00:46:43,690 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-07 00:46:43,690 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-07 00:46:43,690 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-07 00:46:43,690 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-07 00:46:43,690 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-07 00:46:43,690 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-07 00:46:43,691 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-07 00:46:43,691 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-07 00:46:43,691 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-07 00:46:43,691 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-07 00:46:43,691 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-07 00:46:43,692 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-07 00:46:43,692 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-07 00:46:43,692 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-07 00:46:43,692 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-07 00:46:43,692 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-07 00:46:43,692 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_760d5694-77b1-4381-85a2-e38c83341e02/bin/uautomizer-DrprNOufMa/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_760d5694-77b1-4381-85a2-e38c83341e02/bin/uautomizer-DrprNOufMa 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 [2021-12-07 00:46:43,863 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-07 00:46:43,878 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-07 00:46:43,880 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-07 00:46:43,881 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-07 00:46:43,882 INFO L275 PluginConnector]: CDTParser initialized [2021-12-07 00:46:43,882 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_760d5694-77b1-4381-85a2-e38c83341e02/bin/uautomizer-DrprNOufMa/../../sv-benchmarks/c/systemc/transmitter.01.cil.c [2021-12-07 00:46:43,935 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_760d5694-77b1-4381-85a2-e38c83341e02/bin/uautomizer-DrprNOufMa/data/7491fb741/adb083606bdb4cb5b56fcaff4ad1d663/FLAGc6893bc82 [2021-12-07 00:46:44,303 INFO L306 CDTParser]: Found 1 translation units. [2021-12-07 00:46:44,304 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_760d5694-77b1-4381-85a2-e38c83341e02/sv-benchmarks/c/systemc/transmitter.01.cil.c [2021-12-07 00:46:44,310 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_760d5694-77b1-4381-85a2-e38c83341e02/bin/uautomizer-DrprNOufMa/data/7491fb741/adb083606bdb4cb5b56fcaff4ad1d663/FLAGc6893bc82 [2021-12-07 00:46:44,320 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_760d5694-77b1-4381-85a2-e38c83341e02/bin/uautomizer-DrprNOufMa/data/7491fb741/adb083606bdb4cb5b56fcaff4ad1d663 [2021-12-07 00:46:44,322 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-07 00:46:44,323 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-07 00:46:44,324 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-07 00:46:44,324 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-07 00:46:44,327 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-07 00:46:44,327 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:46:44" (1/1) ... [2021-12-07 00:46:44,328 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@393126a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:46:44, skipping insertion in model container [2021-12-07 00:46:44,328 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:46:44" (1/1) ... [2021-12-07 00:46:44,333 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-07 00:46:44,351 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-07 00:46:44,445 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_760d5694-77b1-4381-85a2-e38c83341e02/sv-benchmarks/c/systemc/transmitter.01.cil.c[706,719] [2021-12-07 00:46:44,477 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-07 00:46:44,484 INFO L203 MainTranslator]: Completed pre-run [2021-12-07 00:46:44,492 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_760d5694-77b1-4381-85a2-e38c83341e02/sv-benchmarks/c/systemc/transmitter.01.cil.c[706,719] [2021-12-07 00:46:44,508 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-07 00:46:44,519 INFO L208 MainTranslator]: Completed translation [2021-12-07 00:46:44,519 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:46:44 WrapperNode [2021-12-07 00:46:44,520 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-07 00:46:44,520 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-07 00:46:44,520 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-07 00:46:44,521 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-07 00:46:44,526 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:46:44" (1/1) ... [2021-12-07 00:46:44,532 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:46:44" (1/1) ... [2021-12-07 00:46:44,550 INFO L137 Inliner]: procedures = 30, calls = 33, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 209 [2021-12-07 00:46:44,550 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-07 00:46:44,551 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-07 00:46:44,551 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-07 00:46:44,551 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-07 00:46:44,557 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:46:44" (1/1) ... [2021-12-07 00:46:44,557 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:46:44" (1/1) ... [2021-12-07 00:46:44,559 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:46:44" (1/1) ... [2021-12-07 00:46:44,560 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:46:44" (1/1) ... [2021-12-07 00:46:44,564 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:46:44" (1/1) ... [2021-12-07 00:46:44,568 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:46:44" (1/1) ... [2021-12-07 00:46:44,570 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:46:44" (1/1) ... [2021-12-07 00:46:44,572 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-07 00:46:44,573 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-07 00:46:44,573 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-07 00:46:44,573 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-07 00:46:44,574 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:46:44" (1/1) ... [2021-12-07 00:46:44,582 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-07 00:46:44,593 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_760d5694-77b1-4381-85a2-e38c83341e02/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:46:44,603 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_760d5694-77b1-4381-85a2-e38c83341e02/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-07 00:46:44,605 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_760d5694-77b1-4381-85a2-e38c83341e02/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-07 00:46:44,633 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-07 00:46:44,633 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2021-12-07 00:46:44,633 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2021-12-07 00:46:44,633 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2021-12-07 00:46:44,633 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2021-12-07 00:46:44,634 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2021-12-07 00:46:44,634 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2021-12-07 00:46:44,634 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2021-12-07 00:46:44,634 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2021-12-07 00:46:44,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-07 00:46:44,634 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2021-12-07 00:46:44,634 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2021-12-07 00:46:44,634 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-07 00:46:44,635 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-07 00:46:44,684 INFO L236 CfgBuilder]: Building ICFG [2021-12-07 00:46:44,685 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-07 00:46:44,844 INFO L277 CfgBuilder]: Performing block encoding [2021-12-07 00:46:44,850 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-07 00:46:44,850 INFO L301 CfgBuilder]: Removed 5 assume(true) statements. [2021-12-07 00:46:44,852 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:46:44 BoogieIcfgContainer [2021-12-07 00:46:44,852 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-07 00:46:44,853 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-07 00:46:44,853 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-07 00:46:44,855 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-07 00:46:44,856 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 12:46:44" (1/3) ... [2021-12-07 00:46:44,856 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a04c63f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:46:44, skipping insertion in model container [2021-12-07 00:46:44,856 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:46:44" (2/3) ... [2021-12-07 00:46:44,856 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a04c63f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:46:44, skipping insertion in model container [2021-12-07 00:46:44,857 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:46:44" (3/3) ... [2021-12-07 00:46:44,857 INFO L111 eAbstractionObserver]: Analyzing ICFG transmitter.01.cil.c [2021-12-07 00:46:44,861 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-07 00:46:44,861 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-07 00:46:44,904 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-07 00:46:44,909 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-07 00:46:44,909 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-07 00:46:44,929 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) [2021-12-07 00:46:44,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-12-07 00:46:44,937 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 00:46:44,938 INFO L514 BasicCegarLoop]: 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] [2021-12-07 00:46:44,939 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 00:46:44,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:46:44,944 INFO L85 PathProgramCache]: Analyzing trace with hash -20293138, now seen corresponding path program 1 times [2021-12-07 00:46:44,953 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:46:44,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362725463] [2021-12-07 00:46:44,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:46:44,955 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:46:45,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:46:45,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-07 00:46:45,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:46:45,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-07 00:46:45,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:46:45,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-07 00:46:45,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:46:45,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-12-07 00:46:45,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:46:45,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-07 00:46:45,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:46:45,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:46:45,173 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:46:45,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362725463] [2021-12-07 00:46:45,173 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362725463] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:46:45,173 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:46:45,174 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-07 00:46:45,175 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305054406] [2021-12-07 00:46:45,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:46:45,178 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-07 00:46:45,179 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:46:45,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-07 00:46:45,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-07 00:46:45,211 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) [2021-12-07 00:46:45,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:46:45,489 INFO L93 Difference]: Finished difference Result 210 states and 318 transitions. [2021-12-07 00:46:45,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-07 00:46:45,491 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 [2021-12-07 00:46:45,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 00:46:45,499 INFO L225 Difference]: With dead ends: 210 [2021-12-07 00:46:45,499 INFO L226 Difference]: Without dead ends: 115 [2021-12-07 00:46:45,502 INFO L932 BasicCegarLoop]: 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 [2021-12-07 00:46:45,505 INFO L933 BasicCegarLoop]: 119 mSDtfsCounter, 197 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-07 00:46:45,506 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [205 Valid, 359 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-07 00:46:45,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2021-12-07 00:46:45,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 95. [2021-12-07 00:46:45,542 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) [2021-12-07 00:46:45,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 131 transitions. [2021-12-07 00:46:45,545 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 131 transitions. Word has length 55 [2021-12-07 00:46:45,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 00:46:45,546 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 131 transitions. [2021-12-07 00:46:45,546 INFO L471 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) [2021-12-07 00:46:45,546 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 131 transitions. [2021-12-07 00:46:45,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-12-07 00:46:45,548 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 00:46:45,548 INFO L514 BasicCegarLoop]: 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] [2021-12-07 00:46:45,549 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-07 00:46:45,549 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 00:46:45,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:46:45,549 INFO L85 PathProgramCache]: Analyzing trace with hash -917686416, now seen corresponding path program 1 times [2021-12-07 00:46:45,550 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:46:45,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076959025] [2021-12-07 00:46:45,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:46:45,550 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:46:45,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:46:45,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-07 00:46:45,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:46:45,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-07 00:46:45,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:46:45,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-07 00:46:45,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:46:45,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-12-07 00:46:45,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:46:45,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-07 00:46:45,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:46:45,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:46:45,647 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:46:45,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076959025] [2021-12-07 00:46:45,648 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076959025] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:46:45,648 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:46:45,648 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-07 00:46:45,648 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042048760] [2021-12-07 00:46:45,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:46:45,650 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-07 00:46:45,650 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:46:45,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-07 00:46:45,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-07 00:46:45,651 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) [2021-12-07 00:46:45,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:46:45,844 INFO L93 Difference]: Finished difference Result 200 states and 282 transitions. [2021-12-07 00:46:45,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-07 00:46:45,849 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 [2021-12-07 00:46:45,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 00:46:45,851 INFO L225 Difference]: With dead ends: 200 [2021-12-07 00:46:45,852 INFO L226 Difference]: Without dead ends: 114 [2021-12-07 00:46:45,853 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2021-12-07 00:46:45,855 INFO L933 BasicCegarLoop]: 109 mSDtfsCounter, 191 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-07 00:46:45,855 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [199 Valid, 329 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-07 00:46:45,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2021-12-07 00:46:45,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 95. [2021-12-07 00:46:45,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 76 states have (on average 1.368421052631579) internal successors, (104), 77 states have internal predecessors, (104), 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) [2021-12-07 00:46:45,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 130 transitions. [2021-12-07 00:46:45,873 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 130 transitions. Word has length 55 [2021-12-07 00:46:45,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 00:46:45,873 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 130 transitions. [2021-12-07 00:46:45,873 INFO L471 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) [2021-12-07 00:46:45,874 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 130 transitions. [2021-12-07 00:46:45,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-12-07 00:46:45,876 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 00:46:45,876 INFO L514 BasicCegarLoop]: 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] [2021-12-07 00:46:45,876 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-07 00:46:45,876 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 00:46:45,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:46:45,877 INFO L85 PathProgramCache]: Analyzing trace with hash -669539922, now seen corresponding path program 1 times [2021-12-07 00:46:45,877 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:46:45,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526807054] [2021-12-07 00:46:45,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:46:45,878 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:46:45,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:46:45,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-07 00:46:45,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:46:45,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-07 00:46:45,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:46:45,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-07 00:46:45,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:46:45,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-12-07 00:46:45,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:46:45,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-07 00:46:45,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:46:45,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:46:45,948 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:46:45,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526807054] [2021-12-07 00:46:45,948 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526807054] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:46:45,948 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:46:45,948 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-07 00:46:45,948 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806421532] [2021-12-07 00:46:45,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:46:45,949 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-07 00:46:45,949 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:46:45,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-07 00:46:45,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-07 00:46:45,949 INFO L87 Difference]: Start difference. First operand 95 states and 130 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) [2021-12-07 00:46:46,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:46:46,178 INFO L93 Difference]: Finished difference Result 295 states and 408 transitions. [2021-12-07 00:46:46,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-07 00:46:46,178 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 [2021-12-07 00:46:46,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 00:46:46,180 INFO L225 Difference]: With dead ends: 295 [2021-12-07 00:46:46,180 INFO L226 Difference]: Without dead ends: 210 [2021-12-07 00:46:46,182 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2021-12-07 00:46:46,183 INFO L933 BasicCegarLoop]: 232 mSDtfsCounter, 342 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-07 00:46:46,183 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [364 Valid, 523 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-07 00:46:46,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2021-12-07 00:46:46,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 170. [2021-12-07 00:46:46,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 137 states have (on average 1.3576642335766422) internal successors, (186), 139 states have internal predecessors, (186), 22 states have call successors, (22), 10 states have call predecessors, (22), 10 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2021-12-07 00:46:46,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 230 transitions. [2021-12-07 00:46:46,206 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 230 transitions. Word has length 55 [2021-12-07 00:46:46,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 00:46:46,206 INFO L470 AbstractCegarLoop]: Abstraction has 170 states and 230 transitions. [2021-12-07 00:46:46,207 INFO L471 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) [2021-12-07 00:46:46,207 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 230 transitions. [2021-12-07 00:46:46,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-12-07 00:46:46,208 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 00:46:46,208 INFO L514 BasicCegarLoop]: 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] [2021-12-07 00:46:46,208 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-07 00:46:46,209 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 00:46:46,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:46:46,209 INFO L85 PathProgramCache]: Analyzing trace with hash 455720047, now seen corresponding path program 1 times [2021-12-07 00:46:46,209 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:46:46,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154289501] [2021-12-07 00:46:46,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:46:46,210 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:46:46,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:46:46,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-07 00:46:46,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:46:46,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-07 00:46:46,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:46:46,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-07 00:46:46,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:46:46,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-12-07 00:46:46,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:46:46,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-07 00:46:46,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:46:46,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:46:46,292 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:46:46,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154289501] [2021-12-07 00:46:46,292 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154289501] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:46:46,293 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:46:46,293 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-07 00:46:46,293 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002176708] [2021-12-07 00:46:46,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:46:46,293 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-07 00:46:46,293 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:46:46,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-07 00:46:46,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-07 00:46:46,294 INFO L87 Difference]: Start difference. First operand 170 states and 230 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) [2021-12-07 00:46:46,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:46:46,521 INFO L93 Difference]: Finished difference Result 373 states and 519 transitions. [2021-12-07 00:46:46,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-07 00:46:46,521 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 [2021-12-07 00:46:46,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 00:46:46,523 INFO L225 Difference]: With dead ends: 373 [2021-12-07 00:46:46,523 INFO L226 Difference]: Without dead ends: 213 [2021-12-07 00:46:46,524 INFO L932 BasicCegarLoop]: 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 [2021-12-07 00:46:46,526 INFO L933 BasicCegarLoop]: 122 mSDtfsCounter, 154 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-07 00:46:46,526 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [154 Valid, 519 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-07 00:46:46,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2021-12-07 00:46:46,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 173. [2021-12-07 00:46:46,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 140 states have (on average 1.3428571428571427) internal successors, (188), 142 states have internal predecessors, (188), 22 states have call successors, (22), 10 states have call predecessors, (22), 10 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2021-12-07 00:46:46,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 232 transitions. [2021-12-07 00:46:46,549 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 232 transitions. Word has length 55 [2021-12-07 00:46:46,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 00:46:46,550 INFO L470 AbstractCegarLoop]: Abstraction has 173 states and 232 transitions. [2021-12-07 00:46:46,550 INFO L471 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) [2021-12-07 00:46:46,550 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 232 transitions. [2021-12-07 00:46:46,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-12-07 00:46:46,551 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 00:46:46,551 INFO L514 BasicCegarLoop]: 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] [2021-12-07 00:46:46,552 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-07 00:46:46,552 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 00:46:46,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:46:46,552 INFO L85 PathProgramCache]: Analyzing trace with hash 383333489, now seen corresponding path program 1 times [2021-12-07 00:46:46,552 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:46:46,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242131030] [2021-12-07 00:46:46,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:46:46,553 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:46:46,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:46:46,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-07 00:46:46,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:46:46,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-07 00:46:46,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:46:46,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-07 00:46:46,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:46:46,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-12-07 00:46:46,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:46:46,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-07 00:46:46,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:46:46,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:46:46,624 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:46:46,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242131030] [2021-12-07 00:46:46,624 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242131030] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:46:46,625 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:46:46,625 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-07 00:46:46,625 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223834429] [2021-12-07 00:46:46,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:46:46,625 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-07 00:46:46,625 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:46:46,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-07 00:46:46,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-07 00:46:46,626 INFO L87 Difference]: Start difference. First operand 173 states and 232 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) [2021-12-07 00:46:46,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:46:46,816 INFO L93 Difference]: Finished difference Result 380 states and 526 transitions. [2021-12-07 00:46:46,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-07 00:46:46,817 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 [2021-12-07 00:46:46,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 00:46:46,818 INFO L225 Difference]: With dead ends: 380 [2021-12-07 00:46:46,819 INFO L226 Difference]: Without dead ends: 217 [2021-12-07 00:46:46,819 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2021-12-07 00:46:46,820 INFO L933 BasicCegarLoop]: 116 mSDtfsCounter, 118 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-07 00:46:46,821 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [118 Valid, 494 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-07 00:46:46,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2021-12-07 00:46:46,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 179. [2021-12-07 00:46:46,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 146 states have (on average 1.3287671232876712) internal successors, (194), 148 states have internal predecessors, (194), 22 states have call successors, (22), 10 states have call predecessors, (22), 10 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2021-12-07 00:46:46,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 238 transitions. [2021-12-07 00:46:46,841 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 238 transitions. Word has length 55 [2021-12-07 00:46:46,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 00:46:46,841 INFO L470 AbstractCegarLoop]: Abstraction has 179 states and 238 transitions. [2021-12-07 00:46:46,841 INFO L471 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) [2021-12-07 00:46:46,841 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 238 transitions. [2021-12-07 00:46:46,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-12-07 00:46:46,842 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 00:46:46,842 INFO L514 BasicCegarLoop]: 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] [2021-12-07 00:46:46,842 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-07 00:46:46,842 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 00:46:46,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:46:46,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1988405773, now seen corresponding path program 1 times [2021-12-07 00:46:46,843 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:46:46,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559371588] [2021-12-07 00:46:46,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:46:46,843 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:46:46,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:46:46,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-07 00:46:46,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:46:46,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-07 00:46:46,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:46:46,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-07 00:46:46,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:46:46,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-12-07 00:46:46,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:46:46,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-07 00:46:46,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:46:46,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:46:46,897 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:46:46,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559371588] [2021-12-07 00:46:46,897 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559371588] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:46:46,898 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:46:46,898 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-07 00:46:46,898 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443648497] [2021-12-07 00:46:46,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:46:46,898 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-07 00:46:46,898 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:46:46,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-07 00:46:46,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-07 00:46:46,899 INFO L87 Difference]: Start difference. First operand 179 states and 238 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) [2021-12-07 00:46:47,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:46:47,142 INFO L93 Difference]: Finished difference Result 566 states and 762 transitions. [2021-12-07 00:46:47,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-07 00:46:47,143 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 [2021-12-07 00:46:47,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 00:46:47,145 INFO L225 Difference]: With dead ends: 566 [2021-12-07 00:46:47,145 INFO L226 Difference]: Without dead ends: 396 [2021-12-07 00:46:47,146 INFO L932 BasicCegarLoop]: 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 [2021-12-07 00:46:47,147 INFO L933 BasicCegarLoop]: 151 mSDtfsCounter, 363 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-07 00:46:47,148 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [371 Valid, 421 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-07 00:46:47,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2021-12-07 00:46:47,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 341. [2021-12-07 00:46:47,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 280 states have (on average 1.3214285714285714) internal successors, (370), 285 states have internal predecessors, (370), 38 states have call successors, (38), 20 states have call predecessors, (38), 22 states have return successors, (40), 36 states have call predecessors, (40), 38 states have call successors, (40) [2021-12-07 00:46:47,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 448 transitions. [2021-12-07 00:46:47,178 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 448 transitions. Word has length 55 [2021-12-07 00:46:47,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 00:46:47,178 INFO L470 AbstractCegarLoop]: Abstraction has 341 states and 448 transitions. [2021-12-07 00:46:47,178 INFO L471 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) [2021-12-07 00:46:47,178 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 448 transitions. [2021-12-07 00:46:47,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-12-07 00:46:47,179 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 00:46:47,180 INFO L514 BasicCegarLoop]: 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] [2021-12-07 00:46:47,180 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-07 00:46:47,180 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 00:46:47,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:46:47,180 INFO L85 PathProgramCache]: Analyzing trace with hash 501123189, now seen corresponding path program 1 times [2021-12-07 00:46:47,181 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:46:47,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215792523] [2021-12-07 00:46:47,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:46:47,181 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:46:47,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:46:47,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-07 00:46:47,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:46:47,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-07 00:46:47,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:46:47,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-07 00:46:47,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:46:47,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-12-07 00:46:47,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:46:47,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-07 00:46:47,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:46:47,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:46:47,246 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:46:47,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215792523] [2021-12-07 00:46:47,246 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215792523] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:46:47,246 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:46:47,246 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-07 00:46:47,246 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565704425] [2021-12-07 00:46:47,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:46:47,247 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-07 00:46:47,247 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:46:47,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-07 00:46:47,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-07 00:46:47,248 INFO L87 Difference]: Start difference. First operand 341 states and 448 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) [2021-12-07 00:46:47,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:46:47,399 INFO L93 Difference]: Finished difference Result 705 states and 931 transitions. [2021-12-07 00:46:47,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-07 00:46:47,399 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 [2021-12-07 00:46:47,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 00:46:47,402 INFO L225 Difference]: With dead ends: 705 [2021-12-07 00:46:47,402 INFO L226 Difference]: Without dead ends: 375 [2021-12-07 00:46:47,404 INFO L932 BasicCegarLoop]: 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 [2021-12-07 00:46:47,405 INFO L933 BasicCegarLoop]: 97 mSDtfsCounter, 260 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-07 00:46:47,405 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [270 Valid, 266 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-07 00:46:47,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2021-12-07 00:46:47,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 341. [2021-12-07 00:46:47,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 280 states have (on average 1.2857142857142858) internal successors, (360), 285 states have internal predecessors, (360), 38 states have call successors, (38), 20 states have call predecessors, (38), 22 states have return successors, (40), 36 states have call predecessors, (40), 38 states have call successors, (40) [2021-12-07 00:46:47,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 438 transitions. [2021-12-07 00:46:47,437 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 438 transitions. Word has length 55 [2021-12-07 00:46:47,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 00:46:47,437 INFO L470 AbstractCegarLoop]: Abstraction has 341 states and 438 transitions. [2021-12-07 00:46:47,437 INFO L471 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) [2021-12-07 00:46:47,438 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 438 transitions. [2021-12-07 00:46:47,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-12-07 00:46:47,438 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 00:46:47,439 INFO L514 BasicCegarLoop]: 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] [2021-12-07 00:46:47,439 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-07 00:46:47,439 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 00:46:47,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:46:47,439 INFO L85 PathProgramCache]: Analyzing trace with hash 719977907, now seen corresponding path program 1 times [2021-12-07 00:46:47,439 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:46:47,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132726297] [2021-12-07 00:46:47,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:46:47,440 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:46:47,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:46:47,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-07 00:46:47,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:46:47,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-07 00:46:47,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:46:47,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-07 00:46:47,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:46:47,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-12-07 00:46:47,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:46:47,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-07 00:46:47,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:46:47,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:46:47,502 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:46:47,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132726297] [2021-12-07 00:46:47,502 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132726297] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:46:47,503 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:46:47,503 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-07 00:46:47,503 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031559056] [2021-12-07 00:46:47,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:46:47,503 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-07 00:46:47,503 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:46:47,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-07 00:46:47,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-07 00:46:47,504 INFO L87 Difference]: Start difference. First operand 341 states and 438 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) [2021-12-07 00:46:47,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:46:47,731 INFO L93 Difference]: Finished difference Result 1035 states and 1345 transitions. [2021-12-07 00:46:47,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-07 00:46:47,731 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 [2021-12-07 00:46:47,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 00:46:47,737 INFO L225 Difference]: With dead ends: 1035 [2021-12-07 00:46:47,737 INFO L226 Difference]: Without dead ends: 705 [2021-12-07 00:46:47,738 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-12-07 00:46:47,739 INFO L933 BasicCegarLoop]: 120 mSDtfsCounter, 319 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-07 00:46:47,740 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [327 Valid, 296 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-07 00:46:47,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2021-12-07 00:46:47,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 651. [2021-12-07 00:46:47,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 651 states, 534 states have (on average 1.2696629213483146) internal successors, (678), 543 states have internal predecessors, (678), 71 states have call successors, (71), 40 states have call predecessors, (71), 45 states have return successors, (90), 69 states have call predecessors, (90), 71 states have call successors, (90) [2021-12-07 00:46:47,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 839 transitions. [2021-12-07 00:46:47,796 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 839 transitions. Word has length 55 [2021-12-07 00:46:47,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 00:46:47,797 INFO L470 AbstractCegarLoop]: Abstraction has 651 states and 839 transitions. [2021-12-07 00:46:47,797 INFO L471 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) [2021-12-07 00:46:47,797 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 839 transitions. [2021-12-07 00:46:47,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-12-07 00:46:47,798 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 00:46:47,798 INFO L514 BasicCegarLoop]: 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] [2021-12-07 00:46:47,798 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-07 00:46:47,799 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 00:46:47,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:46:47,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1595512707, now seen corresponding path program 1 times [2021-12-07 00:46:47,799 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:46:47,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213149805] [2021-12-07 00:46:47,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:46:47,800 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:46:47,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:46:47,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-07 00:46:47,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:46:47,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-07 00:46:47,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:46:47,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-07 00:46:47,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:46:47,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-12-07 00:46:47,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:46:47,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-07 00:46:47,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:46:47,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:46:47,849 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:46:47,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213149805] [2021-12-07 00:46:47,849 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213149805] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:46:47,850 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:46:47,850 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-07 00:46:47,850 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068852935] [2021-12-07 00:46:47,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:46:47,850 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-07 00:46:47,850 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:46:47,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-07 00:46:47,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-07 00:46:47,851 INFO L87 Difference]: Start difference. First operand 651 states and 839 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) [2021-12-07 00:46:48,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:46:48,053 INFO L93 Difference]: Finished difference Result 1966 states and 2523 transitions. [2021-12-07 00:46:48,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-07 00:46:48,053 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 [2021-12-07 00:46:48,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 00:46:48,060 INFO L225 Difference]: With dead ends: 1966 [2021-12-07 00:46:48,060 INFO L226 Difference]: Without dead ends: 1329 [2021-12-07 00:46:48,062 INFO L932 BasicCegarLoop]: 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 [2021-12-07 00:46:48,063 INFO L933 BasicCegarLoop]: 151 mSDtfsCounter, 248 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-07 00:46:48,063 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [260 Valid, 360 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-07 00:46:48,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1329 states. [2021-12-07 00:46:48,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1329 to 1215. [2021-12-07 00:46:48,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1215 states, 989 states have (on average 1.2446916076845298) internal successors, (1231), 1005 states have internal predecessors, (1231), 135 states have call successors, (135), 80 states have call predecessors, (135), 90 states have return successors, (173), 131 states have call predecessors, (173), 135 states have call successors, (173) [2021-12-07 00:46:48,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1215 states to 1215 states and 1539 transitions. [2021-12-07 00:46:48,142 INFO L78 Accepts]: Start accepts. Automaton has 1215 states and 1539 transitions. Word has length 56 [2021-12-07 00:46:48,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 00:46:48,143 INFO L470 AbstractCegarLoop]: Abstraction has 1215 states and 1539 transitions. [2021-12-07 00:46:48,143 INFO L471 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) [2021-12-07 00:46:48,143 INFO L276 IsEmpty]: Start isEmpty. Operand 1215 states and 1539 transitions. [2021-12-07 00:46:48,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-12-07 00:46:48,144 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 00:46:48,144 INFO L514 BasicCegarLoop]: 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] [2021-12-07 00:46:48,144 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-07 00:46:48,144 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 00:46:48,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:46:48,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1907953452, now seen corresponding path program 1 times [2021-12-07 00:46:48,145 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:46:48,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402601796] [2021-12-07 00:46:48,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:46:48,145 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:46:48,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:46:48,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-07 00:46:48,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:46:48,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-07 00:46:48,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:46:48,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-07 00:46:48,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:46:48,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-12-07 00:46:48,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:46:48,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-07 00:46:48,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:46:48,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-12-07 00:46:48,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:46:48,192 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-07 00:46:48,192 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:46:48,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402601796] [2021-12-07 00:46:48,192 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402601796] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:46:48,192 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:46:48,192 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-07 00:46:48,192 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403988191] [2021-12-07 00:46:48,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:46:48,193 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-07 00:46:48,193 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:46:48,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-07 00:46:48,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-07 00:46:48,193 INFO L87 Difference]: Start difference. First operand 1215 states and 1539 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) [2021-12-07 00:46:48,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:46:48,619 INFO L93 Difference]: Finished difference Result 3739 states and 4753 transitions. [2021-12-07 00:46:48,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-07 00:46:48,620 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 [2021-12-07 00:46:48,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 00:46:48,630 INFO L225 Difference]: With dead ends: 3739 [2021-12-07 00:46:48,630 INFO L226 Difference]: Without dead ends: 1944 [2021-12-07 00:46:48,634 INFO L932 BasicCegarLoop]: 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 [2021-12-07 00:46:48,635 INFO L933 BasicCegarLoop]: 185 mSDtfsCounter, 478 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 495 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-07 00:46:48,635 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [495 Valid, 537 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 398 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-07 00:46:48,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1944 states. [2021-12-07 00:46:48,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1944 to 1825. [2021-12-07 00:46:48,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1825 states, 1482 states have (on average 1.2267206477732793) internal successors, (1818), 1513 states have internal predecessors, (1818), 199 states have call successors, (199), 120 states have call predecessors, (199), 143 states have return successors, (303), 193 states have call predecessors, (303), 199 states have call successors, (303) [2021-12-07 00:46:48,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1825 states to 1825 states and 2320 transitions. [2021-12-07 00:46:48,752 INFO L78 Accepts]: Start accepts. Automaton has 1825 states and 2320 transitions. Word has length 73 [2021-12-07 00:46:48,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 00:46:48,752 INFO L470 AbstractCegarLoop]: Abstraction has 1825 states and 2320 transitions. [2021-12-07 00:46:48,752 INFO L471 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) [2021-12-07 00:46:48,752 INFO L276 IsEmpty]: Start isEmpty. Operand 1825 states and 2320 transitions. [2021-12-07 00:46:48,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-12-07 00:46:48,755 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 00:46:48,755 INFO L514 BasicCegarLoop]: 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] [2021-12-07 00:46:48,755 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-07 00:46:48,755 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 00:46:48,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:46:48,756 INFO L85 PathProgramCache]: Analyzing trace with hash 175805213, now seen corresponding path program 1 times [2021-12-07 00:46:48,756 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:46:48,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667145710] [2021-12-07 00:46:48,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:46:48,756 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:46:48,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-07 00:46:48,770 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-07 00:46:48,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-07 00:46:48,815 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-07 00:46:48,816 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-07 00:46:48,817 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-07 00:46:48,818 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-07 00:46:48,822 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:46:48,825 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-07 00:46:48,897 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 12:46:48 BoogieIcfgContainer [2021-12-07 00:46:48,897 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-07 00:46:48,898 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-07 00:46:48,898 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-07 00:46:48,898 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-07 00:46:48,898 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:46:44" (3/4) ... [2021-12-07 00:46:48,900 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-07 00:46:48,969 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_760d5694-77b1-4381-85a2-e38c83341e02/bin/uautomizer-DrprNOufMa/witness.graphml [2021-12-07 00:46:48,969 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-07 00:46:48,969 INFO L158 Benchmark]: Toolchain (without parser) took 4646.18ms. Allocated memory was 111.1MB in the beginning and 134.2MB in the end (delta: 23.1MB). Free memory was 77.5MB in the beginning and 63.9MB in the end (delta: 13.6MB). Peak memory consumption was 39.1MB. Max. memory is 16.1GB. [2021-12-07 00:46:48,969 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 71.3MB. Free memory is still 46.8MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-07 00:46:48,970 INFO L158 Benchmark]: CACSL2BoogieTranslator took 195.49ms. Allocated memory is still 111.1MB. Free memory was 77.3MB in the beginning and 65.1MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-12-07 00:46:48,970 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.37ms. Allocated memory is still 111.1MB. Free memory was 65.1MB in the beginning and 63.2MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-07 00:46:48,970 INFO L158 Benchmark]: Boogie Preprocessor took 21.02ms. Allocated memory is still 111.1MB. Free memory was 63.2MB in the beginning and 61.8MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-07 00:46:48,970 INFO L158 Benchmark]: RCFGBuilder took 279.33ms. Allocated memory is still 111.1MB. Free memory was 61.6MB in the beginning and 47.4MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-12-07 00:46:48,971 INFO L158 Benchmark]: TraceAbstraction took 4043.96ms. Allocated memory was 111.1MB in the beginning and 134.2MB in the end (delta: 23.1MB). Free memory was 46.8MB in the beginning and 72.3MB in the end (delta: -25.5MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-07 00:46:48,971 INFO L158 Benchmark]: Witness Printer took 71.30ms. Allocated memory is still 134.2MB. Free memory was 72.3MB in the beginning and 63.9MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-07 00:46:48,972 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.14ms. Allocated memory is still 71.3MB. Free memory is still 46.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 195.49ms. Allocated memory is still 111.1MB. Free memory was 77.3MB in the beginning and 65.1MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.37ms. Allocated memory is still 111.1MB. Free memory was 65.1MB in the beginning and 63.2MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 21.02ms. Allocated memory is still 111.1MB. Free memory was 63.2MB in the beginning and 61.8MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 279.33ms. Allocated memory is still 111.1MB. Free memory was 61.6MB in the beginning and 47.4MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 4043.96ms. Allocated memory was 111.1MB in the beginning and 134.2MB in the end (delta: 23.1MB). Free memory was 46.8MB in the beginning and 72.3MB in the end (delta: -25.5MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 71.30ms. Allocated memory is still 134.2MB. Free memory was 72.3MB in the beginning and 63.9MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. 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: 3.9s, OverallIterations: 11, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2763 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2670 mSDsluCounter, 4104 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2702 mSDsCounter, 595 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2609 IncrementalHoareTripleChecker+Invalid, 3204 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 595 mSolverCounterUnsat, 1402 mSDtfsCounter, 2609 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 240 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1825occurred in iteration=10, InterpolantAutomatonStates: 102, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 10 MinimizatonAttempts, 533 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 664 NumberOfCodeBlocks, 664 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 559 ConstructedInterpolants, 0 QuantifiedInterpolants, 1165 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! [2021-12-07 00:46:49,010 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_760d5694-77b1-4381-85a2-e38c83341e02/bin/uautomizer-DrprNOufMa/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