./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/transmitter.02.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43c81be-e000-483f-be41-b0ad0e2f882f/bin/uautomizer-DrprNOufMa/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43c81be-e000-483f-be41-b0ad0e2f882f/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_a43c81be-e000-483f-be41-b0ad0e2f882f/bin/uautomizer-DrprNOufMa/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43c81be-e000-483f-be41-b0ad0e2f882f/bin/uautomizer-DrprNOufMa/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/transmitter.02.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43c81be-e000-483f-be41-b0ad0e2f882f/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_a43c81be-e000-483f-be41-b0ad0e2f882f/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 2cbfaf31aa56f767af01fea9a12ccb47d60ab19076d72b85e8ca46d6ff778e4c --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-12-06 17:21:29,508 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-06 17:21:29,509 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-06 17:21:29,539 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-06 17:21:29,540 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-06 17:21:29,541 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-06 17:21:29,543 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-06 17:21:29,545 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-06 17:21:29,547 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-06 17:21:29,548 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-06 17:21:29,549 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-06 17:21:29,550 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-06 17:21:29,551 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-06 17:21:29,552 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-06 17:21:29,553 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-06 17:21:29,555 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-06 17:21:29,555 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-06 17:21:29,556 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-06 17:21:29,558 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-06 17:21:29,561 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-06 17:21:29,562 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-06 17:21:29,564 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-06 17:21:29,565 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-06 17:21:29,566 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-06 17:21:29,569 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-06 17:21:29,570 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-06 17:21:29,570 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-06 17:21:29,571 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-06 17:21:29,572 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-06 17:21:29,573 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-06 17:21:29,573 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-06 17:21:29,574 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-06 17:21:29,575 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-06 17:21:29,575 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-06 17:21:29,576 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-06 17:21:29,577 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-06 17:21:29,577 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-06 17:21:29,578 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-06 17:21:29,578 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-06 17:21:29,579 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-06 17:21:29,579 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-06 17:21:29,580 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43c81be-e000-483f-be41-b0ad0e2f882f/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-06 17:21:29,601 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-06 17:21:29,602 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-06 17:21:29,602 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-06 17:21:29,602 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-06 17:21:29,603 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-06 17:21:29,603 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-06 17:21:29,604 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-06 17:21:29,604 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-06 17:21:29,604 INFO L138 SettingsManager]: * Use SBE=true [2021-12-06 17:21:29,604 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-06 17:21:29,605 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-06 17:21:29,605 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-06 17:21:29,605 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-06 17:21:29,605 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-06 17:21:29,605 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-06 17:21:29,605 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-06 17:21:29,606 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-06 17:21:29,606 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-06 17:21:29,606 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-06 17:21:29,606 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-06 17:21:29,606 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-06 17:21:29,607 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-06 17:21:29,607 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-06 17:21:29,607 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-06 17:21:29,607 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 17:21:29,607 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-06 17:21:29,608 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-06 17:21:29,608 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-06 17:21:29,608 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-06 17:21:29,608 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-06 17:21:29,608 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-06 17:21:29,608 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-06 17:21:29,609 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-06 17:21:29,609 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-06 17:21:29,609 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_a43c81be-e000-483f-be41-b0ad0e2f882f/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_a43c81be-e000-483f-be41-b0ad0e2f882f/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 -> 2cbfaf31aa56f767af01fea9a12ccb47d60ab19076d72b85e8ca46d6ff778e4c [2021-12-06 17:21:29,797 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-06 17:21:29,814 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-06 17:21:29,815 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-06 17:21:29,816 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-06 17:21:29,817 INFO L275 PluginConnector]: CDTParser initialized [2021-12-06 17:21:29,818 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43c81be-e000-483f-be41-b0ad0e2f882f/bin/uautomizer-DrprNOufMa/../../sv-benchmarks/c/systemc/transmitter.02.cil.c [2021-12-06 17:21:29,857 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43c81be-e000-483f-be41-b0ad0e2f882f/bin/uautomizer-DrprNOufMa/data/b885374e8/3d51e62d4fdc4469ad86731167e1e7cb/FLAG8d55df2cd [2021-12-06 17:21:30,223 INFO L306 CDTParser]: Found 1 translation units. [2021-12-06 17:21:30,223 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43c81be-e000-483f-be41-b0ad0e2f882f/sv-benchmarks/c/systemc/transmitter.02.cil.c [2021-12-06 17:21:30,230 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43c81be-e000-483f-be41-b0ad0e2f882f/bin/uautomizer-DrprNOufMa/data/b885374e8/3d51e62d4fdc4469ad86731167e1e7cb/FLAG8d55df2cd [2021-12-06 17:21:30,239 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43c81be-e000-483f-be41-b0ad0e2f882f/bin/uautomizer-DrprNOufMa/data/b885374e8/3d51e62d4fdc4469ad86731167e1e7cb [2021-12-06 17:21:30,241 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-06 17:21:30,242 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-06 17:21:30,244 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-06 17:21:30,244 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-06 17:21:30,246 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-06 17:21:30,247 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:21:30" (1/1) ... [2021-12-06 17:21:30,248 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68e1f1f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:21:30, skipping insertion in model container [2021-12-06 17:21:30,248 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:21:30" (1/1) ... [2021-12-06 17:21:30,253 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-06 17:21:30,273 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-06 17:21:30,385 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_a43c81be-e000-483f-be41-b0ad0e2f882f/sv-benchmarks/c/systemc/transmitter.02.cil.c[706,719] [2021-12-06 17:21:30,419 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 17:21:30,426 INFO L203 MainTranslator]: Completed pre-run [2021-12-06 17:21:30,434 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_a43c81be-e000-483f-be41-b0ad0e2f882f/sv-benchmarks/c/systemc/transmitter.02.cil.c[706,719] [2021-12-06 17:21:30,452 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 17:21:30,463 INFO L208 MainTranslator]: Completed translation [2021-12-06 17:21:30,464 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:21:30 WrapperNode [2021-12-06 17:21:30,464 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-06 17:21:30,465 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-06 17:21:30,465 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-06 17:21:30,465 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-06 17:21:30,470 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:21:30" (1/1) ... [2021-12-06 17:21:30,477 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:21:30" (1/1) ... [2021-12-06 17:21:30,503 INFO L137 Inliner]: procedures = 32, calls = 36, calls flagged for inlining = 16, calls inlined = 16, statements flattened = 264 [2021-12-06 17:21:30,504 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-06 17:21:30,505 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-06 17:21:30,505 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-06 17:21:30,505 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-06 17:21:30,511 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:21:30" (1/1) ... [2021-12-06 17:21:30,511 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:21:30" (1/1) ... [2021-12-06 17:21:30,514 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:21:30" (1/1) ... [2021-12-06 17:21:30,514 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:21:30" (1/1) ... [2021-12-06 17:21:30,521 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:21:30" (1/1) ... [2021-12-06 17:21:30,528 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:21:30" (1/1) ... [2021-12-06 17:21:30,531 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:21:30" (1/1) ... [2021-12-06 17:21:30,535 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-06 17:21:30,536 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-06 17:21:30,536 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-06 17:21:30,536 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-06 17:21:30,537 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:21:30" (1/1) ... [2021-12-06 17:21:30,544 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 17:21:30,554 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43c81be-e000-483f-be41-b0ad0e2f882f/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:21:30,565 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43c81be-e000-483f-be41-b0ad0e2f882f/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-06 17:21:30,567 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43c81be-e000-483f-be41-b0ad0e2f882f/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-06 17:21:30,604 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-06 17:21:30,604 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2021-12-06 17:21:30,604 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2021-12-06 17:21:30,604 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2021-12-06 17:21:30,605 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2021-12-06 17:21:30,605 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2021-12-06 17:21:30,605 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2021-12-06 17:21:30,605 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2021-12-06 17:21:30,605 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2021-12-06 17:21:30,605 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2021-12-06 17:21:30,605 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2021-12-06 17:21:30,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-06 17:21:30,606 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2021-12-06 17:21:30,606 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2021-12-06 17:21:30,606 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-06 17:21:30,606 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-06 17:21:30,670 INFO L236 CfgBuilder]: Building ICFG [2021-12-06 17:21:30,671 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-06 17:21:30,872 INFO L277 CfgBuilder]: Performing block encoding [2021-12-06 17:21:30,879 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-06 17:21:30,879 INFO L301 CfgBuilder]: Removed 6 assume(true) statements. [2021-12-06 17:21:30,881 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:21:30 BoogieIcfgContainer [2021-12-06 17:21:30,881 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-06 17:21:30,882 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-06 17:21:30,882 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-06 17:21:30,885 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-06 17:21:30,885 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 05:21:30" (1/3) ... [2021-12-06 17:21:30,885 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@713aff71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:21:30, skipping insertion in model container [2021-12-06 17:21:30,885 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:21:30" (2/3) ... [2021-12-06 17:21:30,886 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@713aff71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:21:30, skipping insertion in model container [2021-12-06 17:21:30,886 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:21:30" (3/3) ... [2021-12-06 17:21:30,887 INFO L111 eAbstractionObserver]: Analyzing ICFG transmitter.02.cil.c [2021-12-06 17:21:30,891 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-06 17:21:30,891 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-06 17:21:30,925 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-06 17:21:30,930 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-06 17:21:30,930 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-06 17:21:30,945 INFO L276 IsEmpty]: Start isEmpty. Operand has 128 states, 105 states have (on average 1.561904761904762) internal successors, (164), 107 states have internal predecessors, (164), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2021-12-06 17:21:30,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-12-06 17:21:30,951 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:21:30,952 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:21:30,952 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:21:30,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:21:30,956 INFO L85 PathProgramCache]: Analyzing trace with hash 2055872345, now seen corresponding path program 1 times [2021-12-06 17:21:30,963 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:21:30,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090118029] [2021-12-06 17:21:30,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:21:30,964 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:21:31,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:31,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 17:21:31,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:31,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 17:21:31,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:31,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-06 17:21:31,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:31,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-06 17:21:31,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:31,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-06 17:21:31,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:31,160 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-06 17:21:31,160 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:21:31,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090118029] [2021-12-06 17:21:31,161 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090118029] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:21:31,161 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:21:31,161 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 17:21:31,162 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936428384] [2021-12-06 17:21:31,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:21:31,166 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 17:21:31,166 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:21:31,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 17:21:31,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 17:21:31,189 INFO L87 Difference]: Start difference. First operand has 128 states, 105 states have (on average 1.561904761904762) internal successors, (164), 107 states have internal predecessors, (164), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 17:21:31,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:21:31,514 INFO L93 Difference]: Finished difference Result 277 states and 425 transitions. [2021-12-06 17:21:31,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-06 17:21:31,517 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 67 [2021-12-06 17:21:31,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:21:31,529 INFO L225 Difference]: With dead ends: 277 [2021-12-06 17:21:31,529 INFO L226 Difference]: Without dead ends: 153 [2021-12-06 17:21:31,533 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-06 17:21:31,537 INFO L933 BasicCegarLoop]: 190 mSDtfsCounter, 268 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 17:21:31,538 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [281 Valid, 334 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 17:21:31,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2021-12-06 17:21:31,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 123. [2021-12-06 17:21:31,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 101 states have (on average 1.4356435643564356) internal successors, (145), 102 states have internal predecessors, (145), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2021-12-06 17:21:31,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 175 transitions. [2021-12-06 17:21:31,582 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 175 transitions. Word has length 67 [2021-12-06 17:21:31,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:21:31,583 INFO L470 AbstractCegarLoop]: Abstraction has 123 states and 175 transitions. [2021-12-06 17:21:31,583 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 17:21:31,583 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 175 transitions. [2021-12-06 17:21:31,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-12-06 17:21:31,586 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:21:31,586 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:21:31,586 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-06 17:21:31,586 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:21:31,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:21:31,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1622143259, now seen corresponding path program 1 times [2021-12-06 17:21:31,587 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:21:31,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923766138] [2021-12-06 17:21:31,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:21:31,588 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:21:31,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:31,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 17:21:31,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:31,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 17:21:31,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:31,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-06 17:21:31,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:31,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-06 17:21:31,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:31,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-06 17:21:31,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:31,711 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-06 17:21:31,712 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:21:31,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923766138] [2021-12-06 17:21:31,712 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923766138] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:21:31,712 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:21:31,712 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 17:21:31,713 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892073487] [2021-12-06 17:21:31,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:21:31,714 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 17:21:31,714 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:21:31,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 17:21:31,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-06 17:21:31,715 INFO L87 Difference]: Start difference. First operand 123 states and 175 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 17:21:32,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:21:32,105 INFO L93 Difference]: Finished difference Result 406 states and 597 transitions. [2021-12-06 17:21:32,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-06 17:21:32,105 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 67 [2021-12-06 17:21:32,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:21:32,108 INFO L225 Difference]: With dead ends: 406 [2021-12-06 17:21:32,109 INFO L226 Difference]: Without dead ends: 293 [2021-12-06 17:21:32,110 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-12-06 17:21:32,112 INFO L933 BasicCegarLoop]: 196 mSDtfsCounter, 377 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 17:21:32,112 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [385 Valid, 530 Invalid, 550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-06 17:21:32,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2021-12-06 17:21:32,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 233. [2021-12-06 17:21:32,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 194 states have (on average 1.443298969072165) internal successors, (280), 196 states have internal predecessors, (280), 25 states have call successors, (25), 12 states have call predecessors, (25), 13 states have return successors, (28), 25 states have call predecessors, (28), 25 states have call successors, (28) [2021-12-06 17:21:32,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 333 transitions. [2021-12-06 17:21:32,140 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 333 transitions. Word has length 67 [2021-12-06 17:21:32,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:21:32,140 INFO L470 AbstractCegarLoop]: Abstraction has 233 states and 333 transitions. [2021-12-06 17:21:32,140 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), 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-06 17:21:32,140 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 333 transitions. [2021-12-06 17:21:32,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-12-06 17:21:32,142 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:21:32,142 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:21:32,142 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-06 17:21:32,142 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:21:32,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:21:32,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1762963514, now seen corresponding path program 1 times [2021-12-06 17:21:32,143 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:21:32,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363694804] [2021-12-06 17:21:32,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:21:32,143 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:21:32,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:32,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 17:21:32,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:32,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 17:21:32,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:32,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-06 17:21:32,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:32,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-06 17:21:32,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:32,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-06 17:21:32,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:32,226 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-06 17:21:32,226 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:21:32,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363694804] [2021-12-06 17:21:32,226 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363694804] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:21:32,226 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:21:32,226 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 17:21:32,227 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186215582] [2021-12-06 17:21:32,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:21:32,227 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 17:21:32,227 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:21:32,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 17:21:32,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-06 17:21:32,228 INFO L87 Difference]: Start difference. First operand 233 states and 333 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 17:21:32,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:21:32,460 INFO L93 Difference]: Finished difference Result 516 states and 750 transitions. [2021-12-06 17:21:32,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 17:21:32,461 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 67 [2021-12-06 17:21:32,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:21:32,463 INFO L225 Difference]: With dead ends: 516 [2021-12-06 17:21:32,463 INFO L226 Difference]: Without dead ends: 293 [2021-12-06 17:21:32,464 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-06 17:21:32,465 INFO L933 BasicCegarLoop]: 163 mSDtfsCounter, 279 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 17:21:32,466 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [288 Valid, 448 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 17:21:32,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2021-12-06 17:21:32,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 233. [2021-12-06 17:21:32,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 194 states have (on average 1.4329896907216495) internal successors, (278), 196 states have internal predecessors, (278), 25 states have call successors, (25), 12 states have call predecessors, (25), 13 states have return successors, (28), 25 states have call predecessors, (28), 25 states have call successors, (28) [2021-12-06 17:21:32,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 331 transitions. [2021-12-06 17:21:32,499 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 331 transitions. Word has length 67 [2021-12-06 17:21:32,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:21:32,499 INFO L470 AbstractCegarLoop]: Abstraction has 233 states and 331 transitions. [2021-12-06 17:21:32,499 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 17:21:32,499 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 331 transitions. [2021-12-06 17:21:32,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-12-06 17:21:32,501 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:21:32,501 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:21:32,501 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-06 17:21:32,501 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:21:32,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:21:32,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1655984776, now seen corresponding path program 1 times [2021-12-06 17:21:32,502 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:21:32,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549954968] [2021-12-06 17:21:32,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:21:32,502 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:21:32,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:32,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 17:21:32,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:32,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 17:21:32,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:32,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-06 17:21:32,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:32,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-06 17:21:32,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:32,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-06 17:21:32,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:32,582 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-06 17:21:32,582 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:21:32,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549954968] [2021-12-06 17:21:32,583 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549954968] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:21:32,583 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:21:32,583 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 17:21:32,583 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127518028] [2021-12-06 17:21:32,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:21:32,584 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 17:21:32,584 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:21:32,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 17:21:32,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-06 17:21:32,585 INFO L87 Difference]: Start difference. First operand 233 states and 331 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 17:21:33,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:21:33,141 INFO L93 Difference]: Finished difference Result 689 states and 986 transitions. [2021-12-06 17:21:33,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-06 17:21:33,142 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 67 [2021-12-06 17:21:33,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:21:33,145 INFO L225 Difference]: With dead ends: 689 [2021-12-06 17:21:33,145 INFO L226 Difference]: Without dead ends: 466 [2021-12-06 17:21:33,146 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2021-12-06 17:21:33,147 INFO L933 BasicCegarLoop]: 309 mSDtfsCounter, 384 mSDsluCounter, 621 mSDsCounter, 0 mSdLazyCounter, 889 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 930 SdHoareTripleChecker+Invalid, 949 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-06 17:21:33,147 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [392 Valid, 930 Invalid, 949 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 889 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-06 17:21:33,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2021-12-06 17:21:33,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 337. [2021-12-06 17:21:33,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 281 states have (on average 1.4234875444839858) internal successors, (400), 284 states have internal predecessors, (400), 35 states have call successors, (35), 18 states have call predecessors, (35), 20 states have return successors, (40), 36 states have call predecessors, (40), 35 states have call successors, (40) [2021-12-06 17:21:33,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 475 transitions. [2021-12-06 17:21:33,170 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 475 transitions. Word has length 67 [2021-12-06 17:21:33,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:21:33,171 INFO L470 AbstractCegarLoop]: Abstraction has 337 states and 475 transitions. [2021-12-06 17:21:33,171 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 17:21:33,171 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 475 transitions. [2021-12-06 17:21:33,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-12-06 17:21:33,172 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:21:33,172 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:21:33,172 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-06 17:21:33,173 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:21:33,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:21:33,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1212084102, now seen corresponding path program 1 times [2021-12-06 17:21:33,173 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:21:33,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682538161] [2021-12-06 17:21:33,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:21:33,173 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:21:33,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:33,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 17:21:33,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:33,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 17:21:33,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:33,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-06 17:21:33,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:33,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-06 17:21:33,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:33,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-06 17:21:33,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:33,233 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-06 17:21:33,233 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:21:33,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682538161] [2021-12-06 17:21:33,233 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682538161] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:21:33,234 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:21:33,234 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 17:21:33,234 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512771566] [2021-12-06 17:21:33,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:21:33,234 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 17:21:33,234 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:21:33,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 17:21:33,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-06 17:21:33,235 INFO L87 Difference]: Start difference. First operand 337 states and 475 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 17:21:33,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:21:33,804 INFO L93 Difference]: Finished difference Result 1074 states and 1524 transitions. [2021-12-06 17:21:33,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-06 17:21:33,805 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 67 [2021-12-06 17:21:33,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:21:33,811 INFO L225 Difference]: With dead ends: 1074 [2021-12-06 17:21:33,812 INFO L226 Difference]: Without dead ends: 747 [2021-12-06 17:21:33,814 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2021-12-06 17:21:33,815 INFO L933 BasicCegarLoop]: 284 mSDtfsCounter, 396 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 845 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 893 SdHoareTripleChecker+Invalid, 910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-06 17:21:33,815 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [406 Valid, 893 Invalid, 910 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 845 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-06 17:21:33,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2021-12-06 17:21:33,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 544. [2021-12-06 17:21:33,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 456 states have (on average 1.4232456140350878) internal successors, (649), 461 states have internal predecessors, (649), 53 states have call successors, (53), 30 states have call predecessors, (53), 34 states have return successors, (66), 56 states have call predecessors, (66), 53 states have call successors, (66) [2021-12-06 17:21:33,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 768 transitions. [2021-12-06 17:21:33,874 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 768 transitions. Word has length 67 [2021-12-06 17:21:33,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:21:33,874 INFO L470 AbstractCegarLoop]: Abstraction has 544 states and 768 transitions. [2021-12-06 17:21:33,874 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 17:21:33,874 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 768 transitions. [2021-12-06 17:21:33,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-12-06 17:21:33,877 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:21:33,877 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:21:33,877 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-06 17:21:33,877 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:21:33,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:21:33,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1054297084, now seen corresponding path program 1 times [2021-12-06 17:21:33,878 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:21:33,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117065261] [2021-12-06 17:21:33,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:21:33,879 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:21:33,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:33,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 17:21:33,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:33,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 17:21:33,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:33,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-06 17:21:33,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:33,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-06 17:21:33,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:33,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-06 17:21:33,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:33,966 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-06 17:21:33,966 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:21:33,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117065261] [2021-12-06 17:21:33,967 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117065261] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:21:33,967 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:21:33,967 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 17:21:33,967 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850771397] [2021-12-06 17:21:33,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:21:33,968 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 17:21:33,968 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:21:33,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 17:21:33,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-06 17:21:33,969 INFO L87 Difference]: Start difference. First operand 544 states and 768 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 17:21:34,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:21:34,358 INFO L93 Difference]: Finished difference Result 1203 states and 1727 transitions. [2021-12-06 17:21:34,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-06 17:21:34,358 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 67 [2021-12-06 17:21:34,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:21:34,362 INFO L225 Difference]: With dead ends: 1203 [2021-12-06 17:21:34,363 INFO L226 Difference]: Without dead ends: 670 [2021-12-06 17:21:34,364 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-06 17:21:34,365 INFO L933 BasicCegarLoop]: 167 mSDtfsCounter, 254 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 17:21:34,366 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [254 Valid, 664 Invalid, 481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-06 17:21:34,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2021-12-06 17:21:34,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 547. [2021-12-06 17:21:34,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 459 states have (on average 1.411764705882353) internal successors, (648), 464 states have internal predecessors, (648), 53 states have call successors, (53), 30 states have call predecessors, (53), 34 states have return successors, (66), 56 states have call predecessors, (66), 53 states have call successors, (66) [2021-12-06 17:21:34,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 767 transitions. [2021-12-06 17:21:34,400 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 767 transitions. Word has length 67 [2021-12-06 17:21:34,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:21:34,400 INFO L470 AbstractCegarLoop]: Abstraction has 547 states and 767 transitions. [2021-12-06 17:21:34,401 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 17:21:34,401 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 767 transitions. [2021-12-06 17:21:34,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-12-06 17:21:34,402 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:21:34,402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:21:34,402 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-06 17:21:34,402 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:21:34,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:21:34,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1302443578, now seen corresponding path program 1 times [2021-12-06 17:21:34,403 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:21:34,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614461848] [2021-12-06 17:21:34,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:21:34,403 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:21:34,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:34,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 17:21:34,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:34,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 17:21:34,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:34,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-06 17:21:34,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:34,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-06 17:21:34,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:34,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-06 17:21:34,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:34,478 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-06 17:21:34,478 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:21:34,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614461848] [2021-12-06 17:21:34,479 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614461848] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:21:34,479 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:21:34,479 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 17:21:34,479 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15225710] [2021-12-06 17:21:34,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:21:34,479 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 17:21:34,479 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:21:34,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 17:21:34,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-06 17:21:34,480 INFO L87 Difference]: Start difference. First operand 547 states and 767 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 17:21:34,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:21:34,824 INFO L93 Difference]: Finished difference Result 1269 states and 1814 transitions. [2021-12-06 17:21:34,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-06 17:21:34,825 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 67 [2021-12-06 17:21:34,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:21:34,829 INFO L225 Difference]: With dead ends: 1269 [2021-12-06 17:21:34,829 INFO L226 Difference]: Without dead ends: 733 [2021-12-06 17:21:34,830 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2021-12-06 17:21:34,831 INFO L933 BasicCegarLoop]: 156 mSDtfsCounter, 254 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 17:21:34,832 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [254 Valid, 642 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 17:21:34,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2021-12-06 17:21:34,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 562. [2021-12-06 17:21:34,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 474 states have (on average 1.3987341772151898) internal successors, (663), 479 states have internal predecessors, (663), 53 states have call successors, (53), 30 states have call predecessors, (53), 34 states have return successors, (66), 56 states have call predecessors, (66), 53 states have call successors, (66) [2021-12-06 17:21:34,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 782 transitions. [2021-12-06 17:21:34,872 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 782 transitions. Word has length 67 [2021-12-06 17:21:34,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:21:34,872 INFO L470 AbstractCegarLoop]: Abstraction has 562 states and 782 transitions. [2021-12-06 17:21:34,872 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 17:21:34,872 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 782 transitions. [2021-12-06 17:21:34,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-12-06 17:21:34,873 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:21:34,873 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:21:34,873 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-06 17:21:34,873 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:21:34,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:21:34,874 INFO L85 PathProgramCache]: Analyzing trace with hash 908076792, now seen corresponding path program 1 times [2021-12-06 17:21:34,874 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:21:34,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703302440] [2021-12-06 17:21:34,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:21:34,874 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:21:34,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:34,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 17:21:34,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:34,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 17:21:34,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:34,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-06 17:21:34,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:34,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-06 17:21:34,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:34,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-06 17:21:34,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:34,959 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-06 17:21:34,959 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:21:34,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703302440] [2021-12-06 17:21:34,959 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703302440] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:21:34,959 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:21:34,960 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 17:21:34,960 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152337981] [2021-12-06 17:21:34,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:21:34,960 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 17:21:34,960 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:21:34,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 17:21:34,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-06 17:21:34,961 INFO L87 Difference]: Start difference. First operand 562 states and 782 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 17:21:35,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:21:35,802 INFO L93 Difference]: Finished difference Result 2996 states and 4324 transitions. [2021-12-06 17:21:35,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-06 17:21:35,803 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 67 [2021-12-06 17:21:35,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:21:35,815 INFO L225 Difference]: With dead ends: 2996 [2021-12-06 17:21:35,815 INFO L226 Difference]: Without dead ends: 2445 [2021-12-06 17:21:35,817 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2021-12-06 17:21:35,818 INFO L933 BasicCegarLoop]: 346 mSDtfsCounter, 1008 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 799 mSolverCounterSat, 207 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1031 SdHoareTripleChecker+Valid, 903 SdHoareTripleChecker+Invalid, 1006 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 207 IncrementalHoareTripleChecker+Valid, 799 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-06 17:21:35,818 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1031 Valid, 903 Invalid, 1006 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [207 Valid, 799 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-06 17:21:35,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2445 states. [2021-12-06 17:21:35,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2445 to 1559. [2021-12-06 17:21:35,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1559 states, 1314 states have (on average 1.3987823439878235) internal successors, (1838), 1332 states have internal predecessors, (1838), 144 states have call successors, (144), 88 states have call predecessors, (144), 100 states have return successors, (189), 142 states have call predecessors, (189), 144 states have call successors, (189) [2021-12-06 17:21:35,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1559 states to 1559 states and 2171 transitions. [2021-12-06 17:21:35,907 INFO L78 Accepts]: Start accepts. Automaton has 1559 states and 2171 transitions. Word has length 67 [2021-12-06 17:21:35,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:21:35,907 INFO L470 AbstractCegarLoop]: Abstraction has 1559 states and 2171 transitions. [2021-12-06 17:21:35,907 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 17:21:35,907 INFO L276 IsEmpty]: Start isEmpty. Operand 1559 states and 2171 transitions. [2021-12-06 17:21:35,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-12-06 17:21:35,910 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:21:35,910 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:21:35,910 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-06 17:21:35,910 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:21:35,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:21:35,914 INFO L85 PathProgramCache]: Analyzing trace with hash 918077039, now seen corresponding path program 1 times [2021-12-06 17:21:35,914 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:21:35,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226509860] [2021-12-06 17:21:35,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:21:35,914 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:21:35,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:35,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 17:21:35,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:35,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 17:21:35,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:35,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-06 17:21:35,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:35,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-06 17:21:35,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:35,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-06 17:21:35,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:35,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-06 17:21:35,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:35,982 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-06 17:21:35,982 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:21:35,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226509860] [2021-12-06 17:21:35,982 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226509860] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:21:35,982 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:21:35,983 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 17:21:35,983 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905601711] [2021-12-06 17:21:35,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:21:35,983 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 17:21:35,983 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:21:35,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 17:21:35,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-06 17:21:35,984 INFO L87 Difference]: Start difference. First operand 1559 states and 2171 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 17:21:36,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:21:36,329 INFO L93 Difference]: Finished difference Result 3474 states and 4944 transitions. [2021-12-06 17:21:36,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-06 17:21:36,330 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 84 [2021-12-06 17:21:36,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:21:36,339 INFO L225 Difference]: With dead ends: 3474 [2021-12-06 17:21:36,339 INFO L226 Difference]: Without dead ends: 1926 [2021-12-06 17:21:36,342 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2021-12-06 17:21:36,343 INFO L933 BasicCegarLoop]: 156 mSDtfsCounter, 171 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 17:21:36,343 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [171 Valid, 648 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 17:21:36,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1926 states. [2021-12-06 17:21:36,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1926 to 1589. [2021-12-06 17:21:36,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1589 states, 1344 states have (on average 1.3861607142857142) internal successors, (1863), 1362 states have internal predecessors, (1863), 144 states have call successors, (144), 88 states have call predecessors, (144), 100 states have return successors, (189), 142 states have call predecessors, (189), 144 states have call successors, (189) [2021-12-06 17:21:36,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1589 states to 1589 states and 2196 transitions. [2021-12-06 17:21:36,432 INFO L78 Accepts]: Start accepts. Automaton has 1589 states and 2196 transitions. Word has length 84 [2021-12-06 17:21:36,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:21:36,432 INFO L470 AbstractCegarLoop]: Abstraction has 1589 states and 2196 transitions. [2021-12-06 17:21:36,433 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 17:21:36,433 INFO L276 IsEmpty]: Start isEmpty. Operand 1589 states and 2196 transitions. [2021-12-06 17:21:36,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-12-06 17:21:36,434 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:21:36,434 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:21:36,434 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-06 17:21:36,435 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:21:36,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:21:36,435 INFO L85 PathProgramCache]: Analyzing trace with hash 564988657, now seen corresponding path program 1 times [2021-12-06 17:21:36,435 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:21:36,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138191881] [2021-12-06 17:21:36,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:21:36,435 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:21:36,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:36,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 17:21:36,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:36,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 17:21:36,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:36,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-06 17:21:36,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:36,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-06 17:21:36,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:36,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-06 17:21:36,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:36,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-06 17:21:36,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:36,491 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-06 17:21:36,491 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:21:36,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138191881] [2021-12-06 17:21:36,491 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138191881] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:21:36,491 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:21:36,492 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 17:21:36,492 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798715227] [2021-12-06 17:21:36,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:21:36,492 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 17:21:36,492 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:21:36,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 17:21:36,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-06 17:21:36,493 INFO L87 Difference]: Start difference. First operand 1589 states and 2196 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 17:21:36,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:21:36,793 INFO L93 Difference]: Finished difference Result 3422 states and 4752 transitions. [2021-12-06 17:21:36,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-06 17:21:36,793 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 84 [2021-12-06 17:21:36,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:21:36,801 INFO L225 Difference]: With dead ends: 3422 [2021-12-06 17:21:36,801 INFO L226 Difference]: Without dead ends: 1845 [2021-12-06 17:21:36,805 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 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-06 17:21:36,806 INFO L933 BasicCegarLoop]: 132 mSDtfsCounter, 326 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 17:21:36,806 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [336 Valid, 415 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 17:21:36,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1845 states. [2021-12-06 17:21:36,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1845 to 1577. [2021-12-06 17:21:36,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1577 states, 1332 states have (on average 1.3626126126126126) internal successors, (1815), 1350 states have internal predecessors, (1815), 144 states have call successors, (144), 88 states have call predecessors, (144), 100 states have return successors, (189), 142 states have call predecessors, (189), 144 states have call successors, (189) [2021-12-06 17:21:36,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 2148 transitions. [2021-12-06 17:21:36,917 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 2148 transitions. Word has length 84 [2021-12-06 17:21:36,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:21:36,917 INFO L470 AbstractCegarLoop]: Abstraction has 1577 states and 2148 transitions. [2021-12-06 17:21:36,917 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 17:21:36,917 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 2148 transitions. [2021-12-06 17:21:36,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-12-06 17:21:36,919 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:21:36,919 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:21:36,919 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-06 17:21:36,919 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:21:36,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:21:36,919 INFO L85 PathProgramCache]: Analyzing trace with hash 813135151, now seen corresponding path program 1 times [2021-12-06 17:21:36,919 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:21:36,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581799317] [2021-12-06 17:21:36,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:21:36,920 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:21:36,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:36,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 17:21:36,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:36,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 17:21:36,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:36,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-06 17:21:36,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:36,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-06 17:21:36,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:36,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-06 17:21:36,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:36,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-06 17:21:36,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:36,979 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-06 17:21:36,980 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:21:36,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581799317] [2021-12-06 17:21:36,980 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581799317] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:21:36,980 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:21:36,980 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-06 17:21:36,980 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999403750] [2021-12-06 17:21:36,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:21:36,980 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-06 17:21:36,980 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:21:36,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-06 17:21:36,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-06 17:21:36,981 INFO L87 Difference]: Start difference. First operand 1577 states and 2148 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 17:21:37,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:21:37,500 INFO L93 Difference]: Finished difference Result 2572 states and 3512 transitions. [2021-12-06 17:21:37,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-06 17:21:37,501 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 84 [2021-12-06 17:21:37,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:21:37,508 INFO L225 Difference]: With dead ends: 2572 [2021-12-06 17:21:37,508 INFO L226 Difference]: Without dead ends: 1597 [2021-12-06 17:21:37,510 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2021-12-06 17:21:37,511 INFO L933 BasicCegarLoop]: 193 mSDtfsCounter, 485 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 730 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 495 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 730 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 17:21:37,511 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [495 Valid, 693 Invalid, 821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 730 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-06 17:21:37,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1597 states. [2021-12-06 17:21:37,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1597 to 1258. [2021-12-06 17:21:37,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1258 states, 1061 states have (on average 1.349670122525919) internal successors, (1432), 1072 states have internal predecessors, (1432), 119 states have call successors, (119), 71 states have call predecessors, (119), 77 states have return successors, (140), 116 states have call predecessors, (140), 119 states have call successors, (140) [2021-12-06 17:21:37,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1258 states to 1258 states and 1691 transitions. [2021-12-06 17:21:37,579 INFO L78 Accepts]: Start accepts. Automaton has 1258 states and 1691 transitions. Word has length 84 [2021-12-06 17:21:37,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:21:37,580 INFO L470 AbstractCegarLoop]: Abstraction has 1258 states and 1691 transitions. [2021-12-06 17:21:37,580 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 17:21:37,580 INFO L276 IsEmpty]: Start isEmpty. Operand 1258 states and 1691 transitions. [2021-12-06 17:21:37,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-12-06 17:21:37,581 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:21:37,581 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:21:37,581 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-06 17:21:37,581 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:21:37,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:21:37,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1236781873, now seen corresponding path program 1 times [2021-12-06 17:21:37,582 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:21:37,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269523766] [2021-12-06 17:21:37,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:21:37,582 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:21:37,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:37,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 17:21:37,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:37,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 17:21:37,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:37,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-06 17:21:37,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:37,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-06 17:21:37,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:37,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-06 17:21:37,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:37,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-06 17:21:37,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:37,643 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-06 17:21:37,644 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:21:37,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269523766] [2021-12-06 17:21:37,644 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269523766] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:21:37,644 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:21:37,644 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-06 17:21:37,644 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306106249] [2021-12-06 17:21:37,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:21:37,644 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-06 17:21:37,644 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:21:37,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-06 17:21:37,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-06 17:21:37,645 INFO L87 Difference]: Start difference. First operand 1258 states and 1691 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 17:21:38,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:21:38,179 INFO L93 Difference]: Finished difference Result 2777 states and 3732 transitions. [2021-12-06 17:21:38,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-06 17:21:38,179 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 84 [2021-12-06 17:21:38,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:21:38,189 INFO L225 Difference]: With dead ends: 2777 [2021-12-06 17:21:38,189 INFO L226 Difference]: Without dead ends: 1622 [2021-12-06 17:21:38,192 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2021-12-06 17:21:38,192 INFO L933 BasicCegarLoop]: 207 mSDtfsCounter, 610 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 633 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 618 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 17:21:38,193 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [618 Valid, 621 Invalid, 759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 633 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-06 17:21:38,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1622 states. [2021-12-06 17:21:38,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1622 to 1246. [2021-12-06 17:21:38,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1246 states, 1052 states have (on average 1.3450570342205324) internal successors, (1415), 1060 states have internal predecessors, (1415), 119 states have call successors, (119), 71 states have call predecessors, (119), 74 states have return successors, (133), 115 states have call predecessors, (133), 119 states have call successors, (133) [2021-12-06 17:21:38,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1246 states to 1246 states and 1667 transitions. [2021-12-06 17:21:38,270 INFO L78 Accepts]: Start accepts. Automaton has 1246 states and 1667 transitions. Word has length 84 [2021-12-06 17:21:38,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:21:38,271 INFO L470 AbstractCegarLoop]: Abstraction has 1246 states and 1667 transitions. [2021-12-06 17:21:38,271 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 17:21:38,271 INFO L276 IsEmpty]: Start isEmpty. Operand 1246 states and 1667 transitions. [2021-12-06 17:21:38,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-12-06 17:21:38,272 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:21:38,272 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:21:38,272 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-06 17:21:38,272 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:21:38,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:21:38,273 INFO L85 PathProgramCache]: Analyzing trace with hash -608585293, now seen corresponding path program 1 times [2021-12-06 17:21:38,273 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:21:38,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843792952] [2021-12-06 17:21:38,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:21:38,273 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:21:38,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:38,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 17:21:38,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:38,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 17:21:38,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:38,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-06 17:21:38,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:38,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-06 17:21:38,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:38,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-06 17:21:38,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:38,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-06 17:21:38,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:38,324 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-06 17:21:38,324 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:21:38,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843792952] [2021-12-06 17:21:38,324 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843792952] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 17:21:38,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1372696697] [2021-12-06 17:21:38,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:21:38,325 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:21:38,325 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43c81be-e000-483f-be41-b0ad0e2f882f/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:21:38,326 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43c81be-e000-483f-be41-b0ad0e2f882f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 17:21:38,329 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43c81be-e000-483f-be41-b0ad0e2f882f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-06 17:21:38,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:38,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-06 17:21:38,384 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:21:38,481 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:21:38,481 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:21:38,481 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1372696697] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:21:38,481 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 17:21:38,481 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2021-12-06 17:21:38,482 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866065897] [2021-12-06 17:21:38,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:21:38,482 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 17:21:38,482 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:21:38,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 17:21:38,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-06 17:21:38,482 INFO L87 Difference]: Start difference. First operand 1246 states and 1667 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2021-12-06 17:21:38,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:21:38,617 INFO L93 Difference]: Finished difference Result 2883 states and 3926 transitions. [2021-12-06 17:21:38,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 17:21:38,617 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 84 [2021-12-06 17:21:38,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:21:38,627 INFO L225 Difference]: With dead ends: 2883 [2021-12-06 17:21:38,627 INFO L226 Difference]: Without dead ends: 2039 [2021-12-06 17:21:38,629 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-06 17:21:38,630 INFO L933 BasicCegarLoop]: 307 mSDtfsCounter, 129 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 17:21:38,630 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [129 Valid, 474 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 17:21:38,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2039 states. [2021-12-06 17:21:38,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2039 to 2039. [2021-12-06 17:21:38,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2039 states, 1721 states have (on average 1.335270191748983) internal successors, (2298), 1731 states have internal predecessors, (2298), 194 states have call successors, (194), 118 states have call predecessors, (194), 123 states have return successors, (258), 190 states have call predecessors, (258), 194 states have call successors, (258) [2021-12-06 17:21:38,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2039 states to 2039 states and 2750 transitions. [2021-12-06 17:21:38,742 INFO L78 Accepts]: Start accepts. Automaton has 2039 states and 2750 transitions. Word has length 84 [2021-12-06 17:21:38,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:21:38,742 INFO L470 AbstractCegarLoop]: Abstraction has 2039 states and 2750 transitions. [2021-12-06 17:21:38,742 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2021-12-06 17:21:38,742 INFO L276 IsEmpty]: Start isEmpty. Operand 2039 states and 2750 transitions. [2021-12-06 17:21:38,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-12-06 17:21:38,743 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:21:38,743 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:21:38,765 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43c81be-e000-483f-be41-b0ad0e2f882f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-06 17:21:38,944 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43c81be-e000-483f-be41-b0ad0e2f882f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:21:38,945 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:21:38,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:21:38,946 INFO L85 PathProgramCache]: Analyzing trace with hash -55730782, now seen corresponding path program 1 times [2021-12-06 17:21:38,946 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:21:38,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665120898] [2021-12-06 17:21:38,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:21:38,947 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:21:38,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:39,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 17:21:39,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:39,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 17:21:39,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:39,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-06 17:21:39,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:39,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-06 17:21:39,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:39,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-06 17:21:39,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:39,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-06 17:21:39,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:39,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 17:21:39,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:39,150 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-12-06 17:21:39,151 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:21:39,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665120898] [2021-12-06 17:21:39,151 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665120898] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:21:39,151 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:21:39,151 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 17:21:39,151 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746172531] [2021-12-06 17:21:39,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:21:39,152 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 17:21:39,152 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:21:39,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 17:21:39,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-06 17:21:39,153 INFO L87 Difference]: Start difference. First operand 2039 states and 2750 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-06 17:21:39,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:21:39,673 INFO L93 Difference]: Finished difference Result 6620 states and 9061 transitions. [2021-12-06 17:21:39,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-06 17:21:39,674 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 99 [2021-12-06 17:21:39,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:21:39,694 INFO L225 Difference]: With dead ends: 6620 [2021-12-06 17:21:39,694 INFO L226 Difference]: Without dead ends: 4593 [2021-12-06 17:21:39,698 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2021-12-06 17:21:39,699 INFO L933 BasicCegarLoop]: 209 mSDtfsCounter, 611 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 619 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 17:21:39,699 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [619 Valid, 501 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 17:21:39,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4593 states. [2021-12-06 17:21:39,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4593 to 4197. [2021-12-06 17:21:39,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4197 states, 3533 states have (on average 1.3102179450891593) internal successors, (4629), 3587 states have internal predecessors, (4629), 366 states have call successors, (366), 230 states have call predecessors, (366), 297 states have return successors, (707), 381 states have call predecessors, (707), 366 states have call successors, (707) [2021-12-06 17:21:39,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4197 states to 4197 states and 5702 transitions. [2021-12-06 17:21:39,952 INFO L78 Accepts]: Start accepts. Automaton has 4197 states and 5702 transitions. Word has length 99 [2021-12-06 17:21:39,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:21:39,952 INFO L470 AbstractCegarLoop]: Abstraction has 4197 states and 5702 transitions. [2021-12-06 17:21:39,953 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-06 17:21:39,953 INFO L276 IsEmpty]: Start isEmpty. Operand 4197 states and 5702 transitions. [2021-12-06 17:21:39,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-12-06 17:21:39,954 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:21:39,954 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:21:39,955 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-06 17:21:39,955 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:21:39,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:21:39,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1996312796, now seen corresponding path program 1 times [2021-12-06 17:21:39,955 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:21:39,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045604721] [2021-12-06 17:21:39,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:21:39,955 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:21:39,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:39,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 17:21:39,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:39,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 17:21:39,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:39,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-06 17:21:39,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:39,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-06 17:21:39,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:39,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-06 17:21:39,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:39,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-06 17:21:39,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:40,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 17:21:40,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:40,013 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-12-06 17:21:40,013 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:21:40,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045604721] [2021-12-06 17:21:40,013 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045604721] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:21:40,013 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:21:40,013 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 17:21:40,013 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172366863] [2021-12-06 17:21:40,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:21:40,014 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 17:21:40,014 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:21:40,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 17:21:40,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 17:21:40,015 INFO L87 Difference]: Start difference. First operand 4197 states and 5702 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-06 17:21:40,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:21:40,357 INFO L93 Difference]: Finished difference Result 8948 states and 12144 transitions. [2021-12-06 17:21:40,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-06 17:21:40,357 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 99 [2021-12-06 17:21:40,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:21:40,378 INFO L225 Difference]: With dead ends: 8948 [2021-12-06 17:21:40,378 INFO L226 Difference]: Without dead ends: 4762 [2021-12-06 17:21:40,386 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-06 17:21:40,387 INFO L933 BasicCegarLoop]: 141 mSDtfsCounter, 323 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 17:21:40,387 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [344 Valid, 267 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 17:21:40,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4762 states. [2021-12-06 17:21:40,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4762 to 4192. [2021-12-06 17:21:40,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4192 states, 3531 states have (on average 1.3101104502973662) internal successors, (4626), 3584 states have internal predecessors, (4626), 363 states have call successors, (363), 230 states have call predecessors, (363), 297 states have return successors, (703), 378 states have call predecessors, (703), 363 states have call successors, (703) [2021-12-06 17:21:40,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4192 states to 4192 states and 5692 transitions. [2021-12-06 17:21:40,663 INFO L78 Accepts]: Start accepts. Automaton has 4192 states and 5692 transitions. Word has length 99 [2021-12-06 17:21:40,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:21:40,663 INFO L470 AbstractCegarLoop]: Abstraction has 4192 states and 5692 transitions. [2021-12-06 17:21:40,664 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-06 17:21:40,664 INFO L276 IsEmpty]: Start isEmpty. Operand 4192 states and 5692 transitions. [2021-12-06 17:21:40,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-12-06 17:21:40,665 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:21:40,665 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:21:40,665 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-06 17:21:40,665 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:21:40,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:21:40,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1243137275, now seen corresponding path program 1 times [2021-12-06 17:21:40,666 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:21:40,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342926301] [2021-12-06 17:21:40,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:21:40,666 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:21:40,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:40,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 17:21:40,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:40,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 17:21:40,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:40,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-06 17:21:40,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:40,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-06 17:21:40,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:40,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-06 17:21:40,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:40,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-06 17:21:40,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:40,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 17:21:40,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:40,718 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-12-06 17:21:40,718 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:21:40,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342926301] [2021-12-06 17:21:40,718 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342926301] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:21:40,718 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:21:40,718 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 17:21:40,718 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898418217] [2021-12-06 17:21:40,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:21:40,719 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 17:21:40,719 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:21:40,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 17:21:40,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 17:21:40,719 INFO L87 Difference]: Start difference. First operand 4192 states and 5692 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-06 17:21:41,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:21:41,201 INFO L93 Difference]: Finished difference Result 9970 states and 13687 transitions. [2021-12-06 17:21:41,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-06 17:21:41,201 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 100 [2021-12-06 17:21:41,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:21:41,234 INFO L225 Difference]: With dead ends: 9970 [2021-12-06 17:21:41,235 INFO L226 Difference]: Without dead ends: 6565 [2021-12-06 17:21:41,241 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 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-06 17:21:41,242 INFO L933 BasicCegarLoop]: 153 mSDtfsCounter, 417 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 17:21:41,242 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [429 Valid, 370 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 17:21:41,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6565 states. [2021-12-06 17:21:41,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6565 to 5725. [2021-12-06 17:21:41,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5725 states, 4816 states have (on average 1.3054401993355482) internal successors, (6287), 4881 states have internal predecessors, (6287), 504 states have call successors, (504), 321 states have call predecessors, (504), 404 states have return successors, (923), 523 states have call predecessors, (923), 504 states have call successors, (923) [2021-12-06 17:21:41,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5725 states to 5725 states and 7714 transitions. [2021-12-06 17:21:41,563 INFO L78 Accepts]: Start accepts. Automaton has 5725 states and 7714 transitions. Word has length 100 [2021-12-06 17:21:41,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:21:41,564 INFO L470 AbstractCegarLoop]: Abstraction has 5725 states and 7714 transitions. [2021-12-06 17:21:41,564 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-06 17:21:41,564 INFO L276 IsEmpty]: Start isEmpty. Operand 5725 states and 7714 transitions. [2021-12-06 17:21:41,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2021-12-06 17:21:41,567 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:21:41,567 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, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:21:41,567 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-06 17:21:41,567 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:21:41,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:21:41,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1869458483, now seen corresponding path program 1 times [2021-12-06 17:21:41,567 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:21:41,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832347463] [2021-12-06 17:21:41,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:21:41,568 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:21:41,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:41,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 17:21:41,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:41,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 17:21:41,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:41,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-06 17:21:41,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:41,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-06 17:21:41,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:41,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-06 17:21:41,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:41,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-12-06 17:21:41,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:41,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-12-06 17:21:41,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:41,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 17:21:41,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:41,619 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-06 17:21:41,619 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:21:41,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832347463] [2021-12-06 17:21:41,619 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832347463] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 17:21:41,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2144001712] [2021-12-06 17:21:41,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:21:41,619 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:21:41,619 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43c81be-e000-483f-be41-b0ad0e2f882f/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:21:41,620 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43c81be-e000-483f-be41-b0ad0e2f882f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 17:21:41,621 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43c81be-e000-483f-be41-b0ad0e2f882f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-06 17:21:41,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:41,672 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-06 17:21:41,675 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:21:41,774 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-06 17:21:41,774 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:21:41,774 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2144001712] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:21:41,774 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 17:21:41,774 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2021-12-06 17:21:41,775 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113084403] [2021-12-06 17:21:41,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:21:41,775 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 17:21:41,775 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:21:41,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 17:21:41,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-06 17:21:41,775 INFO L87 Difference]: Start difference. First operand 5725 states and 7714 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-06 17:21:42,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:21:42,101 INFO L93 Difference]: Finished difference Result 13443 states and 18129 transitions. [2021-12-06 17:21:42,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 17:21:42,102 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 117 [2021-12-06 17:21:42,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:21:42,125 INFO L225 Difference]: With dead ends: 13443 [2021-12-06 17:21:42,125 INFO L226 Difference]: Without dead ends: 7715 [2021-12-06 17:21:42,136 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-06 17:21:42,137 INFO L933 BasicCegarLoop]: 221 mSDtfsCounter, 86 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 17:21:42,137 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [86 Valid, 368 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 17:21:42,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7715 states. [2021-12-06 17:21:42,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7715 to 7649. [2021-12-06 17:21:42,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7649 states, 6430 states have (on average 1.3021772939346812) internal successors, (8373), 6510 states have internal predecessors, (8373), 682 states have call successors, (682), 438 states have call predecessors, (682), 536 states have return successors, (1154), 701 states have call predecessors, (1154), 682 states have call successors, (1154) [2021-12-06 17:21:42,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7649 states to 7649 states and 10209 transitions. [2021-12-06 17:21:42,557 INFO L78 Accepts]: Start accepts. Automaton has 7649 states and 10209 transitions. Word has length 117 [2021-12-06 17:21:42,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:21:42,558 INFO L470 AbstractCegarLoop]: Abstraction has 7649 states and 10209 transitions. [2021-12-06 17:21:42,558 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-06 17:21:42,558 INFO L276 IsEmpty]: Start isEmpty. Operand 7649 states and 10209 transitions. [2021-12-06 17:21:42,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2021-12-06 17:21:42,561 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:21:42,561 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, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:21:42,581 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43c81be-e000-483f-be41-b0ad0e2f882f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-12-06 17:21:42,762 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43c81be-e000-483f-be41-b0ad0e2f882f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-12-06 17:21:42,762 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:21:42,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:21:42,763 INFO L85 PathProgramCache]: Analyzing trace with hash 964798723, now seen corresponding path program 1 times [2021-12-06 17:21:42,763 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:21:42,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778357247] [2021-12-06 17:21:42,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:21:42,763 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:21:42,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:42,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 17:21:42,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:42,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 17:21:42,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:42,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-06 17:21:42,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:42,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-06 17:21:42,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:42,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-06 17:21:42,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:42,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-12-06 17:21:42,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:42,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-06 17:21:42,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:42,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 17:21:42,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:42,825 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-06 17:21:42,825 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:21:42,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778357247] [2021-12-06 17:21:42,826 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778357247] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 17:21:42,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [761018535] [2021-12-06 17:21:42,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:21:42,826 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:21:42,826 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43c81be-e000-483f-be41-b0ad0e2f882f/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:21:42,827 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43c81be-e000-483f-be41-b0ad0e2f882f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 17:21:42,827 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43c81be-e000-483f-be41-b0ad0e2f882f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-06 17:21:42,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:42,882 INFO L263 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-06 17:21:42,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:21:43,002 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-06 17:21:43,002 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:21:43,002 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [761018535] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:21:43,002 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 17:21:43,002 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2021-12-06 17:21:43,003 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611583391] [2021-12-06 17:21:43,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:21:43,003 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 17:21:43,003 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:21:43,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 17:21:43,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-06 17:21:43,004 INFO L87 Difference]: Start difference. First operand 7649 states and 10209 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-06 17:21:43,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:21:43,485 INFO L93 Difference]: Finished difference Result 16201 states and 22003 transitions. [2021-12-06 17:21:43,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 17:21:43,486 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 118 [2021-12-06 17:21:43,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:21:43,512 INFO L225 Difference]: With dead ends: 16201 [2021-12-06 17:21:43,512 INFO L226 Difference]: Without dead ends: 9348 [2021-12-06 17:21:43,528 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-06 17:21:43,529 INFO L933 BasicCegarLoop]: 175 mSDtfsCounter, 121 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 17:21:43,529 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [121 Valid, 221 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 17:21:43,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9348 states. [2021-12-06 17:21:44,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9348 to 9241. [2021-12-06 17:21:44,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9241 states, 7848 states have (on average 1.2719164118246686) internal successors, (9982), 7944 states have internal predecessors, (9982), 758 states have call successors, (758), 529 states have call predecessors, (758), 634 states have return successors, (1380), 768 states have call predecessors, (1380), 758 states have call successors, (1380) [2021-12-06 17:21:44,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9241 states to 9241 states and 12120 transitions. [2021-12-06 17:21:44,048 INFO L78 Accepts]: Start accepts. Automaton has 9241 states and 12120 transitions. Word has length 118 [2021-12-06 17:21:44,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:21:44,049 INFO L470 AbstractCegarLoop]: Abstraction has 9241 states and 12120 transitions. [2021-12-06 17:21:44,049 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-06 17:21:44,049 INFO L276 IsEmpty]: Start isEmpty. Operand 9241 states and 12120 transitions. [2021-12-06 17:21:44,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-12-06 17:21:44,051 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:21:44,051 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:21:44,071 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43c81be-e000-483f-be41-b0ad0e2f882f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-12-06 17:21:44,251 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43c81be-e000-483f-be41-b0ad0e2f882f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-12-06 17:21:44,252 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:21:44,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:21:44,252 INFO L85 PathProgramCache]: Analyzing trace with hash -36607372, now seen corresponding path program 1 times [2021-12-06 17:21:44,252 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:21:44,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941882269] [2021-12-06 17:21:44,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:21:44,252 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:21:44,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:44,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 17:21:44,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:44,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 17:21:44,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:44,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-06 17:21:44,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:44,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-06 17:21:44,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:44,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-06 17:21:44,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:44,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-06 17:21:44,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:44,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-12-06 17:21:44,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:44,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 17:21:44,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:44,301 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-06 17:21:44,302 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:21:44,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941882269] [2021-12-06 17:21:44,302 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941882269] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 17:21:44,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [359309426] [2021-12-06 17:21:44,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:21:44,302 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:21:44,302 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43c81be-e000-483f-be41-b0ad0e2f882f/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:21:44,303 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43c81be-e000-483f-be41-b0ad0e2f882f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 17:21:44,303 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43c81be-e000-483f-be41-b0ad0e2f882f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-06 17:21:44,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:44,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-06 17:21:44,347 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:21:44,446 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:21:44,446 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:21:44,446 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [359309426] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:21:44,446 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 17:21:44,447 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2021-12-06 17:21:44,447 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300541249] [2021-12-06 17:21:44,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:21:44,447 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 17:21:44,447 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:21:44,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 17:21:44,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-06 17:21:44,448 INFO L87 Difference]: Start difference. First operand 9241 states and 12120 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2021-12-06 17:21:45,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:21:45,047 INFO L93 Difference]: Finished difference Result 16957 states and 22181 transitions. [2021-12-06 17:21:45,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 17:21:45,048 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 121 [2021-12-06 17:21:45,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:21:45,072 INFO L225 Difference]: With dead ends: 16957 [2021-12-06 17:21:45,072 INFO L226 Difference]: Without dead ends: 9930 [2021-12-06 17:21:45,085 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-06 17:21:45,086 INFO L933 BasicCegarLoop]: 278 mSDtfsCounter, 121 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 17:21:45,086 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [121 Valid, 440 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 17:21:45,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9930 states. [2021-12-06 17:21:45,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9930 to 9843. [2021-12-06 17:21:45,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9843 states, 8423 states have (on average 1.2614270449958447) internal successors, (10625), 8525 states have internal predecessors, (10625), 758 states have call successors, (758), 550 states have call predecessors, (758), 661 states have return successors, (1272), 768 states have call predecessors, (1272), 758 states have call successors, (1272) [2021-12-06 17:21:45,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9843 states to 9843 states and 12655 transitions. [2021-12-06 17:21:45,625 INFO L78 Accepts]: Start accepts. Automaton has 9843 states and 12655 transitions. Word has length 121 [2021-12-06 17:21:45,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:21:45,625 INFO L470 AbstractCegarLoop]: Abstraction has 9843 states and 12655 transitions. [2021-12-06 17:21:45,626 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2021-12-06 17:21:45,626 INFO L276 IsEmpty]: Start isEmpty. Operand 9843 states and 12655 transitions. [2021-12-06 17:21:45,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2021-12-06 17:21:45,629 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:21:45,629 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:21:45,648 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43c81be-e000-483f-be41-b0ad0e2f882f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-12-06 17:21:45,829 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43c81be-e000-483f-be41-b0ad0e2f882f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:21:45,830 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:21:45,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:21:45,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1792814822, now seen corresponding path program 1 times [2021-12-06 17:21:45,830 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:21:45,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005590956] [2021-12-06 17:21:45,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:21:45,830 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:21:45,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:45,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 17:21:45,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:45,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 17:21:45,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:45,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-06 17:21:45,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:45,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-06 17:21:45,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:45,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-06 17:21:45,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:45,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-06 17:21:45,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:45,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-06 17:21:45,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:45,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 17:21:45,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:45,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2021-12-06 17:21:45,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:45,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 17:21:45,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:45,906 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 5 proven. 39 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-12-06 17:21:45,907 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:21:45,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005590956] [2021-12-06 17:21:45,907 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005590956] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 17:21:45,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1684632539] [2021-12-06 17:21:45,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:21:45,907 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:21:45,907 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43c81be-e000-483f-be41-b0ad0e2f882f/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:21:45,908 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43c81be-e000-483f-be41-b0ad0e2f882f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 17:21:45,909 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43c81be-e000-483f-be41-b0ad0e2f882f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-06 17:21:45,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:45,963 INFO L263 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-06 17:21:45,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:21:46,093 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-12-06 17:21:46,093 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:21:46,093 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1684632539] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:21:46,093 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 17:21:46,093 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2021-12-06 17:21:46,093 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879231278] [2021-12-06 17:21:46,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:21:46,094 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 17:21:46,094 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:21:46,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 17:21:46,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-06 17:21:46,094 INFO L87 Difference]: Start difference. First operand 9843 states and 12655 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2021-12-06 17:21:46,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:21:46,991 INFO L93 Difference]: Finished difference Result 28741 states and 37387 transitions. [2021-12-06 17:21:46,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 17:21:46,992 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 153 [2021-12-06 17:21:46,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:21:47,032 INFO L225 Difference]: With dead ends: 28741 [2021-12-06 17:21:47,033 INFO L226 Difference]: Without dead ends: 18910 [2021-12-06 17:21:47,048 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-06 17:21:47,049 INFO L933 BasicCegarLoop]: 210 mSDtfsCounter, 147 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 17:21:47,049 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [147 Valid, 364 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 17:21:47,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18910 states. [2021-12-06 17:21:48,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18910 to 18895. [2021-12-06 17:21:48,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18895 states, 16195 states have (on average 1.250077184316147) internal successors, (20245), 16388 states have internal predecessors, (20245), 1433 states have call successors, (1433), 1059 states have call predecessors, (1433), 1266 states have return successors, (2696), 1449 states have call predecessors, (2696), 1433 states have call successors, (2696) [2021-12-06 17:21:48,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18895 states to 18895 states and 24374 transitions. [2021-12-06 17:21:48,205 INFO L78 Accepts]: Start accepts. Automaton has 18895 states and 24374 transitions. Word has length 153 [2021-12-06 17:21:48,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:21:48,205 INFO L470 AbstractCegarLoop]: Abstraction has 18895 states and 24374 transitions. [2021-12-06 17:21:48,205 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2021-12-06 17:21:48,205 INFO L276 IsEmpty]: Start isEmpty. Operand 18895 states and 24374 transitions. [2021-12-06 17:21:48,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2021-12-06 17:21:48,210 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:21:48,210 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:21:48,230 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43c81be-e000-483f-be41-b0ad0e2f882f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2021-12-06 17:21:48,411 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43c81be-e000-483f-be41-b0ad0e2f882f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:21:48,411 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:21:48,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:21:48,411 INFO L85 PathProgramCache]: Analyzing trace with hash -970215938, now seen corresponding path program 1 times [2021-12-06 17:21:48,412 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:21:48,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254259748] [2021-12-06 17:21:48,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:21:48,412 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:21:48,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:48,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 17:21:48,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:48,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 17:21:48,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:48,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-06 17:21:48,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:48,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-06 17:21:48,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:48,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-06 17:21:48,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:48,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-12-06 17:21:48,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:48,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-12-06 17:21:48,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:48,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 17:21:48,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:48,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-12-06 17:21:48,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:48,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 17:21:48,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:48,469 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 21 proven. 7 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2021-12-06 17:21:48,469 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:21:48,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254259748] [2021-12-06 17:21:48,469 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254259748] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 17:21:48,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1913741599] [2021-12-06 17:21:48,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:21:48,470 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:21:48,470 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43c81be-e000-483f-be41-b0ad0e2f882f/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:21:48,470 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43c81be-e000-483f-be41-b0ad0e2f882f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 17:21:48,471 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43c81be-e000-483f-be41-b0ad0e2f882f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-06 17:21:48,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:48,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-06 17:21:48,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:21:48,647 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-06 17:21:48,648 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:21:48,648 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1913741599] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:21:48,648 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 17:21:48,648 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2021-12-06 17:21:48,648 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420249458] [2021-12-06 17:21:48,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:21:48,649 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 17:21:48,649 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:21:48,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 17:21:48,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-06 17:21:48,650 INFO L87 Difference]: Start difference. First operand 18895 states and 24374 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2021-12-06 17:21:49,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:21:49,528 INFO L93 Difference]: Finished difference Result 29234 states and 38669 transitions. [2021-12-06 17:21:49,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 17:21:49,528 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 154 [2021-12-06 17:21:49,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:21:49,572 INFO L225 Difference]: With dead ends: 29234 [2021-12-06 17:21:49,572 INFO L226 Difference]: Without dead ends: 18527 [2021-12-06 17:21:49,593 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-06 17:21:49,594 INFO L933 BasicCegarLoop]: 305 mSDtfsCounter, 118 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 17:21:49,594 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [118 Valid, 461 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 17:21:49,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18527 states. [2021-12-06 17:21:50,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18527 to 18465. [2021-12-06 17:21:50,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18465 states, 15765 states have (on average 1.238883602917856) internal successors, (19531), 15958 states have internal predecessors, (19531), 1433 states have call successors, (1433), 1059 states have call predecessors, (1433), 1266 states have return successors, (2696), 1449 states have call predecessors, (2696), 1433 states have call successors, (2696) [2021-12-06 17:21:50,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18465 states to 18465 states and 23660 transitions. [2021-12-06 17:21:50,680 INFO L78 Accepts]: Start accepts. Automaton has 18465 states and 23660 transitions. Word has length 154 [2021-12-06 17:21:50,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:21:50,680 INFO L470 AbstractCegarLoop]: Abstraction has 18465 states and 23660 transitions. [2021-12-06 17:21:50,680 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2021-12-06 17:21:50,680 INFO L276 IsEmpty]: Start isEmpty. Operand 18465 states and 23660 transitions. [2021-12-06 17:21:50,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2021-12-06 17:21:50,689 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:21:50,689 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:21:50,709 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43c81be-e000-483f-be41-b0ad0e2f882f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-06 17:21:50,890 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43c81be-e000-483f-be41-b0ad0e2f882f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2021-12-06 17:21:50,891 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:21:50,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:21:50,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1358937995, now seen corresponding path program 1 times [2021-12-06 17:21:50,892 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:21:50,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776256152] [2021-12-06 17:21:50,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:21:50,893 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:21:50,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:50,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 17:21:50,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:50,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 17:21:50,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:50,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-06 17:21:50,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:50,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-06 17:21:50,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:50,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-06 17:21:50,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:50,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-12-06 17:21:50,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:50,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-12-06 17:21:50,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:50,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 17:21:50,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:50,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-12-06 17:21:50,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:50,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 17:21:50,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:50,986 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2021-12-06 17:21:50,986 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:21:50,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776256152] [2021-12-06 17:21:50,986 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776256152] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:21:50,986 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:21:50,986 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 17:21:50,986 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808797693] [2021-12-06 17:21:50,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:21:50,987 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 17:21:50,987 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:21:50,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 17:21:50,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-06 17:21:50,987 INFO L87 Difference]: Start difference. First operand 18465 states and 23660 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 4 states have internal predecessors, (111), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2021-12-06 17:21:52,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:21:52,245 INFO L93 Difference]: Finished difference Result 33725 states and 43529 transitions. [2021-12-06 17:21:52,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-06 17:21:52,245 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 4 states have internal predecessors, (111), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 155 [2021-12-06 17:21:52,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:21:52,276 INFO L225 Difference]: With dead ends: 33725 [2021-12-06 17:21:52,276 INFO L226 Difference]: Without dead ends: 17956 [2021-12-06 17:21:52,294 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 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-06 17:21:52,295 INFO L933 BasicCegarLoop]: 244 mSDtfsCounter, 561 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 596 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 17:21:52,295 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [596 Valid, 587 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 17:21:52,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17956 states. [2021-12-06 17:21:53,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17956 to 16098. [2021-12-06 17:21:53,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16098 states, 13792 states have (on average 1.2261455916473318) internal successors, (16911), 13972 states have internal predecessors, (16911), 1207 states have call successors, (1207), 894 states have call predecessors, (1207), 1098 states have return successors, (2059), 1233 states have call predecessors, (2059), 1207 states have call successors, (2059) [2021-12-06 17:21:53,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16098 states to 16098 states and 20177 transitions. [2021-12-06 17:21:53,200 INFO L78 Accepts]: Start accepts. Automaton has 16098 states and 20177 transitions. Word has length 155 [2021-12-06 17:21:53,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:21:53,200 INFO L470 AbstractCegarLoop]: Abstraction has 16098 states and 20177 transitions. [2021-12-06 17:21:53,200 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 4 states have internal predecessors, (111), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2021-12-06 17:21:53,201 INFO L276 IsEmpty]: Start isEmpty. Operand 16098 states and 20177 transitions. [2021-12-06 17:21:53,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2021-12-06 17:21:53,204 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:21:53,205 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:21:53,205 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-12-06 17:21:53,205 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:21:53,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:21:53,205 INFO L85 PathProgramCache]: Analyzing trace with hash 217702764, now seen corresponding path program 1 times [2021-12-06 17:21:53,205 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:21:53,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926716788] [2021-12-06 17:21:53,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:21:53,205 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:21:53,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:53,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 17:21:53,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:53,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 17:21:53,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:53,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-06 17:21:53,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:53,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-06 17:21:53,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:53,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-06 17:21:53,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:53,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-12-06 17:21:53,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:53,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-12-06 17:21:53,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:53,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 17:21:53,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:53,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-12-06 17:21:53,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:53,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 17:21:53,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:53,265 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 37 proven. 13 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-12-06 17:21:53,266 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:21:53,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926716788] [2021-12-06 17:21:53,266 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926716788] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 17:21:53,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [725885411] [2021-12-06 17:21:53,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:21:53,266 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:21:53,266 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43c81be-e000-483f-be41-b0ad0e2f882f/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:21:53,267 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43c81be-e000-483f-be41-b0ad0e2f882f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 17:21:53,268 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43c81be-e000-483f-be41-b0ad0e2f882f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-06 17:21:53,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:53,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-06 17:21:53,330 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:21:53,434 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-06 17:21:53,434 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:21:53,434 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [725885411] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:21:53,434 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 17:21:53,434 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2021-12-06 17:21:53,434 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868988005] [2021-12-06 17:21:53,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:21:53,434 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 17:21:53,434 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:21:53,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 17:21:53,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-06 17:21:53,435 INFO L87 Difference]: Start difference. First operand 16098 states and 20177 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2021-12-06 17:21:54,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:21:54,257 INFO L93 Difference]: Finished difference Result 28643 states and 36407 transitions. [2021-12-06 17:21:54,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 17:21:54,258 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 156 [2021-12-06 17:21:54,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:21:54,284 INFO L225 Difference]: With dead ends: 28643 [2021-12-06 17:21:54,284 INFO L226 Difference]: Without dead ends: 16151 [2021-12-06 17:21:54,297 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-06 17:21:54,298 INFO L933 BasicCegarLoop]: 253 mSDtfsCounter, 90 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 17:21:54,298 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [90 Valid, 402 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 17:21:54,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16151 states. [2021-12-06 17:21:55,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16151 to 16082. [2021-12-06 17:21:55,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16082 states, 13776 states have (on average 1.2047038327526132) internal successors, (16596), 13956 states have internal predecessors, (16596), 1207 states have call successors, (1207), 894 states have call predecessors, (1207), 1098 states have return successors, (2059), 1233 states have call predecessors, (2059), 1207 states have call successors, (2059) [2021-12-06 17:21:55,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16082 states to 16082 states and 19862 transitions. [2021-12-06 17:21:55,149 INFO L78 Accepts]: Start accepts. Automaton has 16082 states and 19862 transitions. Word has length 156 [2021-12-06 17:21:55,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:21:55,149 INFO L470 AbstractCegarLoop]: Abstraction has 16082 states and 19862 transitions. [2021-12-06 17:21:55,150 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2021-12-06 17:21:55,150 INFO L276 IsEmpty]: Start isEmpty. Operand 16082 states and 19862 transitions. [2021-12-06 17:21:55,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2021-12-06 17:21:55,154 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:21:55,154 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:21:55,174 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43c81be-e000-483f-be41-b0ad0e2f882f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-06 17:21:55,355 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43c81be-e000-483f-be41-b0ad0e2f882f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:21:55,356 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:21:55,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:21:55,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1852604969, now seen corresponding path program 2 times [2021-12-06 17:21:55,358 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:21:55,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783938559] [2021-12-06 17:21:55,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:21:55,359 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:21:55,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:55,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 17:21:55,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:55,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 17:21:55,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:55,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-06 17:21:55,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:55,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-06 17:21:55,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:55,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-06 17:21:55,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:55,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-12-06 17:21:55,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:55,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-12-06 17:21:55,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:55,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 17:21:55,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:55,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-12-06 17:21:55,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:55,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 17:21:55,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:21:55,439 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2021-12-06 17:21:55,439 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:21:55,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783938559] [2021-12-06 17:21:55,439 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783938559] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:21:55,439 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:21:55,440 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-06 17:21:55,440 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231019270] [2021-12-06 17:21:55,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:21:55,440 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-06 17:21:55,440 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:21:55,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-06 17:21:55,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-06 17:21:55,441 INFO L87 Difference]: Start difference. First operand 16082 states and 19862 transitions. Second operand has 8 states, 8 states have (on average 13.25) internal successors, (106), 6 states have internal predecessors, (106), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2021-12-06 17:21:57,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:21:57,380 INFO L93 Difference]: Finished difference Result 40643 states and 51929 transitions. [2021-12-06 17:21:57,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-06 17:21:57,381 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.25) internal successors, (106), 6 states have internal predecessors, (106), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 156 [2021-12-06 17:21:57,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:21:57,433 INFO L225 Difference]: With dead ends: 40643 [2021-12-06 17:21:57,434 INFO L226 Difference]: Without dead ends: 24579 [2021-12-06 17:21:57,464 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=150, Invalid=500, Unknown=0, NotChecked=0, Total=650 [2021-12-06 17:21:57,465 INFO L933 BasicCegarLoop]: 165 mSDtfsCounter, 912 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 670 mSolverCounterSat, 242 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 924 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 912 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 242 IncrementalHoareTripleChecker+Valid, 670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-06 17:21:57,465 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [924 Valid, 508 Invalid, 912 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [242 Valid, 670 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-06 17:21:57,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24579 states. [2021-12-06 17:21:58,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24579 to 23029. [2021-12-06 17:21:58,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23029 states, 19688 states have (on average 1.1473994311255586) internal successors, (22590), 20035 states have internal predecessors, (22590), 1643 states have call successors, (1643), 1326 states have call predecessors, (1643), 1697 states have return successors, (3030), 1669 states have call predecessors, (3030), 1643 states have call successors, (3030) [2021-12-06 17:21:58,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23029 states to 23029 states and 27263 transitions. [2021-12-06 17:21:58,744 INFO L78 Accepts]: Start accepts. Automaton has 23029 states and 27263 transitions. Word has length 156 [2021-12-06 17:21:58,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:21:58,744 INFO L470 AbstractCegarLoop]: Abstraction has 23029 states and 27263 transitions. [2021-12-06 17:21:58,744 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.25) internal successors, (106), 6 states have internal predecessors, (106), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2021-12-06 17:21:58,744 INFO L276 IsEmpty]: Start isEmpty. Operand 23029 states and 27263 transitions. [2021-12-06 17:21:58,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2021-12-06 17:21:58,750 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:21:58,750 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:21:58,750 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-12-06 17:21:58,750 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:21:58,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:21:58,751 INFO L85 PathProgramCache]: Analyzing trace with hash -217774742, now seen corresponding path program 1 times [2021-12-06 17:21:58,751 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:21:58,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892141656] [2021-12-06 17:21:58,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:21:58,751 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:21:58,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 17:21:58,761 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-06 17:21:58,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 17:21:58,803 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-06 17:21:58,804 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-06 17:21:58,804 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-06 17:21:58,806 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-12-06 17:21:58,808 INFO L732 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:21:58,811 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-06 17:21:58,902 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 05:21:58 BoogieIcfgContainer [2021-12-06 17:21:58,902 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-06 17:21:58,902 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-06 17:21:58,902 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-06 17:21:58,903 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-06 17:21:58,903 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:21:30" (3/4) ... [2021-12-06 17:21:58,904 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-06 17:21:58,982 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43c81be-e000-483f-be41-b0ad0e2f882f/bin/uautomizer-DrprNOufMa/witness.graphml [2021-12-06 17:21:58,982 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-06 17:21:58,983 INFO L158 Benchmark]: Toolchain (without parser) took 28740.30ms. Allocated memory was 98.6MB in the beginning and 2.1GB in the end (delta: 2.0GB). Free memory was 63.6MB in the beginning and 701.0MB in the end (delta: -637.4MB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2021-12-06 17:21:58,983 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 98.6MB. Free memory is still 79.9MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-06 17:21:58,983 INFO L158 Benchmark]: CACSL2BoogieTranslator took 220.47ms. Allocated memory is still 98.6MB. Free memory was 63.4MB in the beginning and 73.9MB in the end (delta: -10.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-12-06 17:21:58,983 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.36ms. Allocated memory is still 98.6MB. Free memory was 73.9MB in the beginning and 71.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-06 17:21:58,984 INFO L158 Benchmark]: Boogie Preprocessor took 30.21ms. Allocated memory is still 98.6MB. Free memory was 71.8MB in the beginning and 69.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-06 17:21:58,984 INFO L158 Benchmark]: RCFGBuilder took 345.29ms. Allocated memory is still 98.6MB. Free memory was 69.8MB in the beginning and 53.3MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2021-12-06 17:21:58,984 INFO L158 Benchmark]: TraceAbstraction took 28019.88ms. Allocated memory was 98.6MB in the beginning and 2.1GB in the end (delta: 2.0GB). Free memory was 52.9MB in the beginning and 716.7MB in the end (delta: -663.8MB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2021-12-06 17:21:58,985 INFO L158 Benchmark]: Witness Printer took 79.83ms. Allocated memory is still 2.1GB. Free memory was 716.7MB in the beginning and 701.0MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-12-06 17:21:58,986 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 98.6MB. Free memory is still 79.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 220.47ms. Allocated memory is still 98.6MB. Free memory was 63.4MB in the beginning and 73.9MB in the end (delta: -10.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.36ms. Allocated memory is still 98.6MB. Free memory was 73.9MB in the beginning and 71.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.21ms. Allocated memory is still 98.6MB. Free memory was 71.8MB in the beginning and 69.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 345.29ms. Allocated memory is still 98.6MB. Free memory was 69.8MB in the beginning and 53.3MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 28019.88ms. Allocated memory was 98.6MB in the beginning and 2.1GB in the end (delta: 2.0GB). Free memory was 52.9MB in the beginning and 716.7MB in the end (delta: -663.8MB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. * Witness Printer took 79.83ms. Allocated memory is still 2.1GB. Free memory was 716.7MB in the beginning and 701.0MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 21]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L25] int m_pc = 0; [L26] int t1_pc = 0; [L27] int t2_pc = 0; [L28] int m_st ; [L29] int t1_st ; [L30] int t2_st ; [L31] int m_i ; [L32] int t1_i ; [L33] int t2_i ; [L34] int M_E = 2; [L35] int T1_E = 2; [L36] int T2_E = 2; [L37] int E_1 = 2; [L38] int E_2 = 2; VAL [E_1=2, E_2=2, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0] [L573] int __retres1 ; [L577] CALL init_model() [L487] m_i = 1 [L488] t1_i = 1 [L489] t2_i = 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L577] RET init_model() [L578] CALL start_simulation() [L514] int kernel_st ; [L515] int tmp ; [L516] int tmp___0 ; [L520] kernel_st = 0 VAL [E_1=2, E_2=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L521] FCALL update_channels() VAL [E_1=2, E_2=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L522] CALL init_threads() [L221] COND TRUE m_i == 1 [L222] m_st = 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L226] COND TRUE t1_i == 1 [L227] t1_st = 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L231] COND TRUE t2_i == 1 [L232] t2_st = 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L522] RET init_threads() [L523] CALL fire_delta_events() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L334] COND FALSE !(M_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L339] COND FALSE !(T1_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L344] COND FALSE !(T2_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L349] COND FALSE !(E_1 == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L354] COND FALSE !(E_2 == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L523] RET fire_delta_events() VAL [E_1=2, E_2=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L524] CALL activate_threads() VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L397] int tmp ; [L398] int tmp___0 ; [L399] int tmp___1 ; [L403] CALL, EXPR is_master_triggered() [L153] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L156] COND FALSE !(m_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L166] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L168] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \result=0, __retres1=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L403] RET, EXPR is_master_triggered() [L403] tmp = is_master_triggered() [L405] COND FALSE !(\read(tmp)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0] [L411] CALL, EXPR is_transmit1_triggered() [L172] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L175] COND FALSE !(t1_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L185] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L187] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \result=0, __retres1=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L411] RET, EXPR is_transmit1_triggered() [L411] tmp___0 = is_transmit1_triggered() [L413] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=0] [L419] CALL, EXPR is_transmit2_triggered() [L191] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L194] COND FALSE !(t2_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L204] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L206] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \result=0, __retres1=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L419] RET, EXPR is_transmit2_triggered() [L419] tmp___1 = is_transmit2_triggered() [L421] COND FALSE !(\read(tmp___1)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=0, tmp___1=0] [L524] RET activate_threads() VAL [E_1=2, E_2=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L525] CALL reset_delta_events() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L367] COND FALSE !(M_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L372] COND FALSE !(T1_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L377] COND FALSE !(T2_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L382] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L387] COND FALSE !(E_2 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L525] RET reset_delta_events() VAL [E_1=2, E_2=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L528] COND TRUE 1 VAL [E_1=2, E_2=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L531] kernel_st = 1 [L532] CALL eval() [L267] int tmp ; VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L271] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L274] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L241] int __retres1 ; VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L244] COND TRUE m_st == 0 [L245] __retres1 = 1 VAL [__retres1=1, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L262] return (__retres1); VAL [\result=1, __retres1=1, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L274] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, exists_runnable_thread()=1, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L274] tmp = exists_runnable_thread() [L276] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1] [L281] COND TRUE m_st == 0 [L282] int tmp_ndt_1; [L283] tmp_ndt_1 = __VERIFIER_nondet_int() [L284] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0] [L295] COND TRUE t1_st == 0 [L296] int tmp_ndt_2; [L297] tmp_ndt_2 = __VERIFIER_nondet_int() [L298] COND TRUE \read(tmp_ndt_2) [L300] t1_st = 1 [L301] CALL transmit1() [L88] COND TRUE t1_pc == 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L99] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L101] t1_pc = 1 [L102] t1_st = 2 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L301] RET transmit1() [L309] COND TRUE t2_st == 0 [L310] int tmp_ndt_3; [L311] tmp_ndt_3 = __VERIFIER_nondet_int() [L312] COND TRUE \read(tmp_ndt_3) [L314] t2_st = 1 [L315] CALL transmit2() [L123] COND TRUE t2_pc == 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1] [L134] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1] [L136] t2_pc = 1 [L137] t2_st = 2 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L315] RET transmit2() [L271] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1] [L274] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L241] int __retres1 ; VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L244] COND TRUE m_st == 0 [L245] __retres1 = 1 VAL [__retres1=1, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L262] return (__retres1); VAL [\result=1, __retres1=1, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L274] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, exists_runnable_thread()=1, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1] [L274] tmp = exists_runnable_thread() [L276] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1] [L281] COND TRUE m_st == 0 [L282] int tmp_ndt_1; [L283] tmp_ndt_1 = __VERIFIER_nondet_int() [L284] COND TRUE \read(tmp_ndt_1) [L286] m_st = 1 [L287] CALL master() [L47] COND TRUE m_pc == 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L58] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L61] E_1 = 1 VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L62] CALL immediate_notify() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L435] CALL activate_threads() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L397] int tmp ; [L398] int tmp___0 ; [L399] int tmp___1 ; [L403] CALL, EXPR is_master_triggered() [L153] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L156] COND FALSE !(m_pc == 1) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L166] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, __retres1=0, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L168] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \result=0, __retres1=0, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L403] RET, EXPR is_master_triggered() [L403] tmp = is_master_triggered() [L405] COND FALSE !(\read(tmp)) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0] [L411] CALL, EXPR is_transmit1_triggered() [L172] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L175] COND TRUE t1_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L176] COND TRUE E_1 == 1 [L177] __retres1 = 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, __retres1=1, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L187] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \result=1, __retres1=1, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L411] RET, EXPR is_transmit1_triggered() [L411] tmp___0 = is_transmit1_triggered() [L413] COND TRUE \read(tmp___0) [L414] t1_st = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=1] [L419] CALL, EXPR is_transmit2_triggered() [L191] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L194] COND TRUE t2_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L195] COND FALSE !(E_2 == 1) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L204] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, __retres1=0, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L206] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \result=0, __retres1=0, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L419] RET, EXPR is_transmit2_triggered() [L419] tmp___1 = is_transmit2_triggered() [L421] COND FALSE !(\read(tmp___1)) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=1, tmp___1=0] [L435] RET activate_threads() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L62] RET immediate_notify() VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L63] E_1 = 2 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L66] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L68] m_pc = 1 [L69] m_st = 2 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L287] RET master() [L295] COND TRUE t1_st == 0 [L296] int tmp_ndt_2; [L297] tmp_ndt_2 = __VERIFIER_nondet_int() [L298] COND TRUE \read(tmp_ndt_2) [L300] t1_st = 1 [L301] CALL transmit1() [L88] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L91] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L107] E_2 = 1 VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L108] CALL immediate_notify() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L435] CALL activate_threads() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L397] int tmp ; [L398] int tmp___0 ; [L399] int tmp___1 ; [L403] CALL, EXPR is_master_triggered() [L153] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L156] COND TRUE m_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L157] COND FALSE !(M_E == 1) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L166] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, __retres1=0, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L168] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \result=0, __retres1=0, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L403] RET, EXPR is_master_triggered() [L403] tmp = is_master_triggered() [L405] COND FALSE !(\read(tmp)) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0] [L411] CALL, EXPR is_transmit1_triggered() [L172] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L175] COND TRUE t1_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L176] COND FALSE !(E_1 == 1) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L185] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, __retres1=0, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L187] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \result=0, __retres1=0, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L411] RET, EXPR is_transmit1_triggered() [L411] tmp___0 = is_transmit1_triggered() [L413] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=0] [L419] CALL, EXPR is_transmit2_triggered() [L191] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L194] COND TRUE t2_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L195] COND TRUE E_2 == 1 [L196] __retres1 = 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, __retres1=1, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L206] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \result=1, __retres1=1, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L419] RET, EXPR is_transmit2_triggered() [L419] tmp___1 = is_transmit2_triggered() [L421] COND TRUE \read(tmp___1) [L422] t2_st = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, tmp=0, tmp___0=0, tmp___1=1] [L435] RET activate_threads() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0] [L108] RET immediate_notify() VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0] [L109] E_2 = 2 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0] [L99] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0] [L101] t1_pc = 1 [L102] t1_st = 2 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=0] [L301] RET transmit1() [L309] COND TRUE t2_st == 0 [L310] int tmp_ndt_3; [L311] tmp_ndt_3 = __VERIFIER_nondet_int() [L312] COND TRUE \read(tmp_ndt_3) [L314] t2_st = 1 [L315] CALL transmit2() [L123] COND FALSE !(t2_pc == 0) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1] [L126] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1] [L142] CALL error() [L21] reach_error() VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 128 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 27.9s, OverallIterations: 25, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 14.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8635 SdHoareTripleChecker+Valid, 4.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8448 mSDsluCounter, 12684 SdHoareTripleChecker+Invalid, 4.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7524 mSDsCounter, 1514 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8316 IncrementalHoareTripleChecker+Invalid, 9830 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1514 mSolverCounterUnsat, 5160 mSDtfsCounter, 8316 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1550 GetRequests, 1301 SyntacticMatches, 0 SemanticMatches, 249 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 621 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23029occurred in iteration=24, InterpolantAutomatonStates: 230, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 8.4s AutomataMinimizationTime, 24 MinimizatonAttempts, 8602 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 3444 NumberOfCodeBlocks, 3444 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 3256 ConstructedInterpolants, 0 QuantifiedInterpolants, 6648 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2763 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 31 InterpolantComputations, 24 PerfectInterpolantSequences, 865/990 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-12-06 17:21:59,028 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a43c81be-e000-483f-be41-b0ad0e2f882f/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE