/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-SP.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe031_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7a177ad [2020-11-09 17:13:00,624 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-09 17:13:00,627 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-09 17:13:00,684 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-09 17:13:00,685 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-09 17:13:00,690 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-09 17:13:00,693 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-09 17:13:00,702 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-09 17:13:00,707 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-09 17:13:00,713 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-09 17:13:00,715 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-09 17:13:00,717 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-09 17:13:00,717 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-09 17:13:00,720 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-09 17:13:00,723 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-09 17:13:00,725 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-09 17:13:00,726 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-09 17:13:00,730 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-09 17:13:00,738 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-09 17:13:00,747 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-09 17:13:00,749 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-09 17:13:00,752 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-09 17:13:00,754 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-09 17:13:00,757 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-09 17:13:00,766 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-09 17:13:00,767 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-09 17:13:00,767 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-09 17:13:00,769 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-09 17:13:00,770 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-09 17:13:00,771 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-09 17:13:00,772 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-09 17:13:00,773 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-09 17:13:00,775 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-09 17:13:00,776 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-09 17:13:00,778 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-09 17:13:00,778 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-09 17:13:00,779 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-09 17:13:00,779 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-09 17:13:00,780 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-09 17:13:00,781 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-09 17:13:00,782 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-09 17:13:00,783 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-SP.epf [2020-11-09 17:13:00,856 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-09 17:13:00,856 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-09 17:13:00,861 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-09 17:13:00,862 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-09 17:13:00,862 INFO L138 SettingsManager]: * Use SBE=true [2020-11-09 17:13:00,862 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-09 17:13:00,863 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-09 17:13:00,863 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-09 17:13:00,863 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-09 17:13:00,864 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-09 17:13:00,865 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-09 17:13:00,865 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-09 17:13:00,866 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-09 17:13:00,866 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-09 17:13:00,866 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-09 17:13:00,866 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-09 17:13:00,867 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-09 17:13:00,867 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-09 17:13:00,867 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-09 17:13:00,867 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-09 17:13:00,868 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-09 17:13:00,868 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-09 17:13:00,868 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-09 17:13:00,869 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-11-09 17:13:00,869 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-09 17:13:00,869 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-09 17:13:00,869 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-09 17:13:00,870 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-11-09 17:13:00,870 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-11-09 17:13:00,870 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-09 17:13:00,870 INFO L138 SettingsManager]: * Interpolant automaton=MCR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-11-09 17:13:01,346 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-09 17:13:01,398 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-09 17:13:01,402 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-09 17:13:01,403 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-09 17:13:01,404 INFO L275 PluginConnector]: CDTParser initialized [2020-11-09 17:13:01,405 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe031_pso.opt.i [2020-11-09 17:13:01,503 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d847a07e/77081f882bff4a6a829d21d907c91e12/FLAG6dfa421f5 [2020-11-09 17:13:02,288 INFO L306 CDTParser]: Found 1 translation units. [2020-11-09 17:13:02,289 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe031_pso.opt.i [2020-11-09 17:13:02,315 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d847a07e/77081f882bff4a6a829d21d907c91e12/FLAG6dfa421f5 [2020-11-09 17:13:02,463 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d847a07e/77081f882bff4a6a829d21d907c91e12 [2020-11-09 17:13:02,466 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-09 17:13:02,473 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-11-09 17:13:02,478 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-09 17:13:02,478 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-09 17:13:02,483 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-09 17:13:02,484 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 05:13:02" (1/1) ... [2020-11-09 17:13:02,489 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b3332d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:13:02, skipping insertion in model container [2020-11-09 17:13:02,490 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 05:13:02" (1/1) ... [2020-11-09 17:13:02,499 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-09 17:13:02,581 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-09 17:13:03,216 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-09 17:13:03,230 INFO L203 MainTranslator]: Completed pre-run [2020-11-09 17:13:03,294 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-09 17:13:03,465 INFO L208 MainTranslator]: Completed translation [2020-11-09 17:13:03,466 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:13:03 WrapperNode [2020-11-09 17:13:03,466 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-09 17:13:03,468 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-09 17:13:03,468 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-09 17:13:03,468 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-09 17:13:03,480 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:13:03" (1/1) ... [2020-11-09 17:13:03,526 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:13:03" (1/1) ... [2020-11-09 17:13:03,596 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-09 17:13:03,600 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-09 17:13:03,601 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-09 17:13:03,601 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-09 17:13:03,614 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:13:03" (1/1) ... [2020-11-09 17:13:03,614 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:13:03" (1/1) ... [2020-11-09 17:13:03,633 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:13:03" (1/1) ... [2020-11-09 17:13:03,635 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:13:03" (1/1) ... [2020-11-09 17:13:03,656 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:13:03" (1/1) ... [2020-11-09 17:13:03,665 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:13:03" (1/1) ... [2020-11-09 17:13:03,671 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:13:03" (1/1) ... [2020-11-09 17:13:03,677 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-09 17:13:03,678 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-09 17:13:03,678 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-09 17:13:03,678 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-09 17:13:03,679 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:13:03" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-09 17:13:03,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-09 17:13:03,789 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-11-09 17:13:03,790 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-09 17:13:03,790 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-09 17:13:03,791 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-11-09 17:13:03,792 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-11-09 17:13:03,793 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-11-09 17:13:03,793 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-11-09 17:13:03,794 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-11-09 17:13:03,794 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-11-09 17:13:03,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-09 17:13:03,794 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-11-09 17:13:03,794 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-09 17:13:03,795 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-09 17:13:03,797 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-11-09 17:13:06,341 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-09 17:13:06,341 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-11-09 17:13:06,344 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 05:13:06 BoogieIcfgContainer [2020-11-09 17:13:06,344 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-09 17:13:06,346 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-09 17:13:06,346 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-09 17:13:06,350 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-09 17:13:06,351 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 05:13:02" (1/3) ... [2020-11-09 17:13:06,352 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ad8235 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 05:13:06, skipping insertion in model container [2020-11-09 17:13:06,352 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:13:03" (2/3) ... [2020-11-09 17:13:06,352 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ad8235 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 05:13:06, skipping insertion in model container [2020-11-09 17:13:06,352 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 05:13:06" (3/3) ... [2020-11-09 17:13:06,354 INFO L111 eAbstractionObserver]: Analyzing ICFG safe031_pso.opt.i [2020-11-09 17:13:06,373 WARN L168 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-09 17:13:06,373 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-09 17:13:06,378 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-11-09 17:13:06,379 INFO L351 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-09 17:13:06,423 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:13:06,424 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:13:06,424 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:13:06,424 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:13:06,424 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:13:06,424 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:13:06,424 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:13:06,425 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:13:06,425 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:13:06,425 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:13:06,425 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:13:06,426 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:13:06,426 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:13:06,426 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:13:06,426 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:13:06,427 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:13:06,427 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:13:06,427 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:13:06,427 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:13:06,427 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:13:06,427 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:13:06,428 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:13:06,428 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:13:06,428 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:13:06,428 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:13:06,428 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:13:06,428 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:13:06,429 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:13:06,429 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:13:06,429 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:13:06,430 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:13:06,430 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:13:06,430 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:13:06,430 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:13:06,431 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:13:06,431 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:13:06,431 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:13:06,431 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:13:06,432 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:13:06,432 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:13:06,432 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:13:06,433 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:13:06,433 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:13:06,433 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:13:06,433 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:13:06,433 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:13:06,433 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:13:06,434 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:13:06,434 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:13:06,434 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:13:06,434 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:13:06,434 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:13:06,434 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:13:06,435 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:13:06,435 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:13:06,435 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:13:06,435 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:13:06,435 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:13:06,436 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:13:06,436 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:13:06,436 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:13:06,436 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:13:06,436 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:13:06,436 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:13:06,437 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:13:06,437 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:13:06,437 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:13:06,437 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:13:06,438 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:13:06,438 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:13:06,438 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:13:06,438 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:13:06,438 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:13:06,439 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:13:06,439 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:13:06,439 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:13:06,439 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:13:06,439 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:13:06,440 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:13:06,440 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:13:06,440 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:13:06,441 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:13:06,441 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:13:06,441 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:13:06,444 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:13:06,444 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:13:06,444 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:13:06,445 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:13:06,445 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:13:06,445 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:13:06,445 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:13:06,445 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:13:06,445 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:13:06,446 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:13:06,446 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:13:06,446 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:13:06,446 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:13:06,446 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:13:06,449 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:13:06,449 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:13:06,449 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:13:06,450 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:13:06,452 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:13:06,453 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:13:06,453 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:13:06,453 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:13:06,453 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:13:06,454 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:13:06,454 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:13:06,454 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:13:06,454 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:13:06,454 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:13:06,456 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-11-09 17:13:06,470 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-11-09 17:13:06,496 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-09 17:13:06,496 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-09 17:13:06,496 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-11-09 17:13:06,496 INFO L380 AbstractCegarLoop]: Backedges is MCR [2020-11-09 17:13:06,497 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-09 17:13:06,497 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-09 17:13:06,497 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-09 17:13:06,497 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-09 17:13:06,511 INFO L128 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-11-09 17:13:06,512 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 107 places, 100 transitions, 215 flow [2020-11-09 17:13:06,516 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 107 places, 100 transitions, 215 flow [2020-11-09 17:13:06,518 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 107 places, 100 transitions, 215 flow [2020-11-09 17:13:06,572 INFO L129 PetriNetUnfolder]: 3/97 cut-off events. [2020-11-09 17:13:06,572 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-11-09 17:13:06,577 INFO L84 FinitePrefix]: Finished finitePrefix Result has 107 conditions, 97 events. 3/97 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 72 event pairs, 0 based on Foata normal form. 0/92 useless extension candidates. Maximal degree in co-relation 64. Up to 2 conditions per place. [2020-11-09 17:13:06,581 INFO L116 LiptonReduction]: Number of co-enabled transitions 1746 [2020-11-09 17:13:07,814 WARN L194 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2020-11-09 17:13:07,940 WARN L194 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2020-11-09 17:13:08,138 WARN L194 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2020-11-09 17:13:09,371 WARN L194 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-11-09 17:13:09,509 WARN L194 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-11-09 17:13:10,110 WARN L194 SmtUtils]: Spent 599.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 88 [2020-11-09 17:13:10,124 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 3, 2, 1] term [2020-11-09 17:13:10,124 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 17:13:10,619 WARN L194 SmtUtils]: Spent 485.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 89 [2020-11-09 17:13:12,600 WARN L194 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 226 DAG size of output: 186 [2020-11-09 17:13:12,616 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 2, 1] term [2020-11-09 17:13:12,616 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 17:13:12,619 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-09 17:13:12,622 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 17:13:13,622 WARN L194 SmtUtils]: Spent 964.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 122 [2020-11-09 17:13:16,288 WARN L194 SmtUtils]: Spent 2.66 s on a formula simplification. DAG size of input: 310 DAG size of output: 265 [2020-11-09 17:13:16,295 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 1] term [2020-11-09 17:13:16,295 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 17:13:16,298 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 1] term [2020-11-09 17:13:16,298 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 17:13:16,300 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 17:13:16,300 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 17:13:16,319 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 1] term [2020-11-09 17:13:16,322 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 17:13:16,337 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 1] term [2020-11-09 17:13:16,337 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 17:13:16,351 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 1] term [2020-11-09 17:13:16,352 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 17:13:16,369 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 1] term [2020-11-09 17:13:16,370 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 17:13:16,372 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 17:13:16,372 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 17:13:16,376 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 3, 2, 1] term [2020-11-09 17:13:16,376 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 17:13:16,384 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 17:13:16,386 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 17:13:16,388 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 17:13:16,390 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 17:13:16,391 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 17:13:16,392 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-11-09 17:13:16,401 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 17:13:16,407 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 17:13:16,413 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 1] term [2020-11-09 17:13:16,413 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 17:13:16,418 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 1] term [2020-11-09 17:13:16,418 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 17:13:16,420 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 17:13:16,420 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 17:13:16,425 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 1] term [2020-11-09 17:13:16,426 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 17:13:16,434 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 1] term [2020-11-09 17:13:16,434 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 17:13:16,435 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 17:13:16,436 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 17:13:20,668 WARN L194 SmtUtils]: Spent 4.22 s on a formula simplification. DAG size of input: 360 DAG size of output: 263 [2020-11-09 17:13:22,676 WARN L194 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 125 DAG size of output: 107 [2020-11-09 17:13:23,006 WARN L194 SmtUtils]: Spent 326.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2020-11-09 17:13:25,373 WARN L194 SmtUtils]: Spent 2.37 s on a formula simplification. DAG size of input: 253 DAG size of output: 232 [2020-11-09 17:13:26,563 WARN L194 SmtUtils]: Spent 1.18 s on a formula simplification that was a NOOP. DAG size: 228 [2020-11-09 17:13:27,349 WARN L194 SmtUtils]: Spent 771.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 107 [2020-11-09 17:13:27,757 WARN L194 SmtUtils]: Spent 404.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2020-11-09 17:13:31,210 WARN L194 SmtUtils]: Spent 3.45 s on a formula simplification. DAG size of input: 253 DAG size of output: 231 [2020-11-09 17:13:32,276 WARN L194 SmtUtils]: Spent 1.06 s on a formula simplification that was a NOOP. DAG size: 227 [2020-11-09 17:13:32,382 WARN L194 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2020-11-09 17:13:32,501 WARN L194 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2020-11-09 17:13:32,614 WARN L194 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2020-11-09 17:13:32,726 WARN L194 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2020-11-09 17:13:33,599 WARN L194 SmtUtils]: Spent 861.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 130 [2020-11-09 17:13:34,055 WARN L194 SmtUtils]: Spent 453.00 ms on a formula simplification that was a NOOP. DAG size: 127 [2020-11-09 17:13:37,419 WARN L194 SmtUtils]: Spent 3.36 s on a formula simplification. DAG size of input: 267 DAG size of output: 256 [2020-11-09 17:13:39,130 WARN L194 SmtUtils]: Spent 1.71 s on a formula simplification that was a NOOP. DAG size: 252 [2020-11-09 17:13:39,578 WARN L194 SmtUtils]: Spent 403.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 88 [2020-11-09 17:13:39,774 WARN L194 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2020-11-09 17:13:40,175 WARN L194 SmtUtils]: Spent 398.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 88 [2020-11-09 17:13:40,370 WARN L194 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2020-11-09 17:13:40,993 WARN L194 SmtUtils]: Spent 597.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112 [2020-11-09 17:13:41,254 WARN L194 SmtUtils]: Spent 258.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2020-11-09 17:13:41,842 WARN L194 SmtUtils]: Spent 586.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112 [2020-11-09 17:13:42,131 WARN L194 SmtUtils]: Spent 286.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2020-11-09 17:13:42,138 INFO L131 LiptonReduction]: Checked pairs total: 4701 [2020-11-09 17:13:42,138 INFO L133 LiptonReduction]: Total number of compositions: 92 [2020-11-09 17:13:42,147 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 35 places, 25 transitions, 65 flow [2020-11-09 17:13:42,212 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 650 states. [2020-11-09 17:13:42,215 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states. [2020-11-09 17:13:42,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-11-09 17:13:42,221 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 17:13:42,222 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-11-09 17:13:42,223 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 17:13:42,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 17:13:42,237 INFO L82 PathProgramCache]: Analyzing trace with hash 117480453, now seen corresponding path program 1 times [2020-11-09 17:13:42,262 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 17:13:42,262 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221788601] [2020-11-09 17:13:42,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 17:13:42,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 17:13:42,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 17:13:42,528 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221788601] [2020-11-09 17:13:42,529 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 17:13:42,529 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-09 17:13:42,530 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1004059808] [2020-11-09 17:13:42,531 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 17:13:42,535 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 17:13:42,550 INFO L252 McrAutomatonBuilder]: Finished intersection with 8 states and 7 transitions. [2020-11-09 17:13:42,551 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 17:13:42,556 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 17:13:42,557 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 17:13:42,557 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 17:13:42,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 17:13:42,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 17:13:42,576 INFO L87 Difference]: Start difference. First operand 650 states. Second operand 3 states. [2020-11-09 17:13:42,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 17:13:42,678 INFO L93 Difference]: Finished difference Result 550 states and 1693 transitions. [2020-11-09 17:13:42,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 17:13:42,681 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-11-09 17:13:42,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 17:13:42,702 INFO L225 Difference]: With dead ends: 550 [2020-11-09 17:13:42,702 INFO L226 Difference]: Without dead ends: 450 [2020-11-09 17:13:42,704 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 17:13:42,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2020-11-09 17:13:42,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 450. [2020-11-09 17:13:42,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2020-11-09 17:13:42,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 1358 transitions. [2020-11-09 17:13:42,809 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 1358 transitions. Word has length 7 [2020-11-09 17:13:42,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 17:13:42,811 INFO L481 AbstractCegarLoop]: Abstraction has 450 states and 1358 transitions. [2020-11-09 17:13:42,811 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 17:13:42,811 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 1358 transitions. [2020-11-09 17:13:42,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-11-09 17:13:42,812 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 17:13:42,812 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 17:13:42,813 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-09 17:13:42,813 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 17:13:42,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 17:13:42,814 INFO L82 PathProgramCache]: Analyzing trace with hash 1229600893, now seen corresponding path program 1 times [2020-11-09 17:13:42,816 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 17:13:42,817 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889241405] [2020-11-09 17:13:42,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 17:13:42,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 17:13:42,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 17:13:42,945 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889241405] [2020-11-09 17:13:42,945 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 17:13:42,945 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-09 17:13:42,946 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [586431078] [2020-11-09 17:13:42,946 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 17:13:42,948 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 17:13:42,950 INFO L252 McrAutomatonBuilder]: Finished intersection with 10 states and 9 transitions. [2020-11-09 17:13:42,951 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 17:13:42,952 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 17:13:42,953 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 17:13:42,953 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 17:13:42,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 17:13:42,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 17:13:42,958 INFO L87 Difference]: Start difference. First operand 450 states and 1358 transitions. Second operand 3 states. [2020-11-09 17:13:42,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 17:13:42,982 INFO L93 Difference]: Finished difference Result 440 states and 1320 transitions. [2020-11-09 17:13:42,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 17:13:42,984 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-11-09 17:13:42,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 17:13:42,990 INFO L225 Difference]: With dead ends: 440 [2020-11-09 17:13:42,990 INFO L226 Difference]: Without dead ends: 440 [2020-11-09 17:13:42,991 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 17:13:42,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2020-11-09 17:13:43,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 440. [2020-11-09 17:13:43,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2020-11-09 17:13:43,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 1320 transitions. [2020-11-09 17:13:43,019 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 1320 transitions. Word has length 9 [2020-11-09 17:13:43,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 17:13:43,019 INFO L481 AbstractCegarLoop]: Abstraction has 440 states and 1320 transitions. [2020-11-09 17:13:43,019 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 17:13:43,019 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 1320 transitions. [2020-11-09 17:13:43,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-09 17:13:43,021 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 17:13:43,021 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 17:13:43,022 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-09 17:13:43,022 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 17:13:43,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 17:13:43,023 INFO L82 PathProgramCache]: Analyzing trace with hash -537078871, now seen corresponding path program 1 times [2020-11-09 17:13:43,025 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 17:13:43,026 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662772960] [2020-11-09 17:13:43,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 17:13:43,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 17:13:43,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 17:13:43,230 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662772960] [2020-11-09 17:13:43,230 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 17:13:43,230 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-09 17:13:43,231 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2036945185] [2020-11-09 17:13:43,231 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 17:13:43,232 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 17:13:43,234 INFO L252 McrAutomatonBuilder]: Finished intersection with 17 states and 22 transitions. [2020-11-09 17:13:43,235 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 17:13:43,239 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-11-09 17:13:43,240 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:13:43,242 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 17:13:43,243 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:13:43,455 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 17:13:43,456 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-09 17:13:43,456 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 17:13:43,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-09 17:13:43,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-09 17:13:43,457 INFO L87 Difference]: Start difference. First operand 440 states and 1320 transitions. Second operand 4 states. [2020-11-09 17:13:43,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 17:13:43,532 INFO L93 Difference]: Finished difference Result 434 states and 1298 transitions. [2020-11-09 17:13:43,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 17:13:43,539 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-11-09 17:13:43,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 17:13:43,543 INFO L225 Difference]: With dead ends: 434 [2020-11-09 17:13:43,544 INFO L226 Difference]: Without dead ends: 434 [2020-11-09 17:13:43,544 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-09 17:13:43,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2020-11-09 17:13:43,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 434. [2020-11-09 17:13:43,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2020-11-09 17:13:43,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 1298 transitions. [2020-11-09 17:13:43,572 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 1298 transitions. Word has length 10 [2020-11-09 17:13:43,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 17:13:43,573 INFO L481 AbstractCegarLoop]: Abstraction has 434 states and 1298 transitions. [2020-11-09 17:13:43,573 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-09 17:13:43,573 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 1298 transitions. [2020-11-09 17:13:43,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-09 17:13:43,581 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 17:13:43,581 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 17:13:43,581 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-09 17:13:43,581 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 17:13:43,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 17:13:43,582 INFO L82 PathProgramCache]: Analyzing trace with hash 530435755, now seen corresponding path program 1 times [2020-11-09 17:13:43,584 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 17:13:43,585 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137550866] [2020-11-09 17:13:43,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 17:13:43,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 17:13:43,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 17:13:43,753 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137550866] [2020-11-09 17:13:43,753 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 17:13:43,753 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 17:13:43,754 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2006467300] [2020-11-09 17:13:43,754 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 17:13:43,756 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 17:13:43,758 INFO L252 McrAutomatonBuilder]: Finished intersection with 12 states and 11 transitions. [2020-11-09 17:13:43,758 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 17:13:43,759 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 17:13:43,759 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-09 17:13:43,759 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 17:13:43,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-09 17:13:43,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-09 17:13:43,760 INFO L87 Difference]: Start difference. First operand 434 states and 1298 transitions. Second operand 5 states. [2020-11-09 17:13:43,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 17:13:43,870 INFO L93 Difference]: Finished difference Result 599 states and 1720 transitions. [2020-11-09 17:13:43,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-09 17:13:43,875 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-11-09 17:13:43,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 17:13:43,882 INFO L225 Difference]: With dead ends: 599 [2020-11-09 17:13:43,883 INFO L226 Difference]: Without dead ends: 464 [2020-11-09 17:13:43,883 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-09 17:13:43,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2020-11-09 17:13:43,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 419. [2020-11-09 17:13:43,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2020-11-09 17:13:43,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 1201 transitions. [2020-11-09 17:13:43,902 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 1201 transitions. Word has length 11 [2020-11-09 17:13:43,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 17:13:43,903 INFO L481 AbstractCegarLoop]: Abstraction has 419 states and 1201 transitions. [2020-11-09 17:13:43,903 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-09 17:13:43,903 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 1201 transitions. [2020-11-09 17:13:43,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-09 17:13:43,904 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 17:13:43,905 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 17:13:43,905 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-09 17:13:43,905 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 17:13:43,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 17:13:43,905 INFO L82 PathProgramCache]: Analyzing trace with hash 530436747, now seen corresponding path program 1 times [2020-11-09 17:13:43,908 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 17:13:43,909 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787975098] [2020-11-09 17:13:43,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 17:13:43,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 17:13:44,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 17:13:44,084 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787975098] [2020-11-09 17:13:44,084 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 17:13:44,085 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 17:13:44,085 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1165443608] [2020-11-09 17:13:44,085 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 17:13:44,088 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 17:13:44,098 INFO L252 McrAutomatonBuilder]: Finished intersection with 19 states and 25 transitions. [2020-11-09 17:13:44,098 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 17:13:44,201 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-11-09 17:13:44,202 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:13:44,202 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 17:13:44,203 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:13:44,204 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 3, 3, 2, 3, 2, 1] term [2020-11-09 17:13:44,204 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:13:44,586 WARN L194 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-11-09 17:13:44,665 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [6939#(and (or (= ~y~0 ~y$w_buff0~0) (not (= (mod ~y$w_buff0_used~0 256) 0))) (or (not (= (mod ~y$w_buff0_used~0 256) 0)) (= ~y$r_buff0_thd0~0 0)) (or (not (= 2 ~y$w_buff0~0)) (not (= (mod ~y$w_buff0_used~0 256) 0)))), 6940#(and (= (mod ~y$r_buff0_thd0~0 256) 0) (or (= ~y~0 ~y$w_buff0~0) (not (= (mod ~y$r_buff1_thd0~0 256) 0)) (not (= (mod ~y$w_buff0_used~0 256) 0))) (or (not (= (mod ~y$w_buff0_used~0 256) 0)) (= ~y$r_buff0_thd0~0 0)) (or (= ~y~0 ~y$w_buff0~0) (not (= (mod ~y$w_buff1_used~0 256) 0)) (not (= (mod ~y$w_buff0_used~0 256) 0))) (or (not (= 2 ~y$w_buff0~0)) (not (= (mod ~y$w_buff0_used~0 256) 0))) (or (not (= (mod ~y$w_buff0_used~0 256) 0)) (= (mod ~y$w_buff1_used~0 256) 0) (= ~y$w_buff1~0 ~y$w_buff0~0) (= (mod ~y$r_buff1_thd0~0 256) 0)))] [2020-11-09 17:13:44,666 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-09 17:13:44,666 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 17:13:44,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-09 17:13:44,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-11-09 17:13:44,667 INFO L87 Difference]: Start difference. First operand 419 states and 1201 transitions. Second operand 7 states. [2020-11-09 17:13:44,876 WARN L194 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 22 [2020-11-09 17:13:45,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 17:13:45,054 INFO L93 Difference]: Finished difference Result 497 states and 1412 transitions. [2020-11-09 17:13:45,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-09 17:13:45,057 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2020-11-09 17:13:45,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 17:13:45,061 INFO L225 Difference]: With dead ends: 497 [2020-11-09 17:13:45,061 INFO L226 Difference]: Without dead ends: 497 [2020-11-09 17:13:45,062 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2020-11-09 17:13:45,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2020-11-09 17:13:45,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 407. [2020-11-09 17:13:45,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2020-11-09 17:13:45,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 1157 transitions. [2020-11-09 17:13:45,103 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 1157 transitions. Word has length 11 [2020-11-09 17:13:45,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 17:13:45,103 INFO L481 AbstractCegarLoop]: Abstraction has 407 states and 1157 transitions. [2020-11-09 17:13:45,103 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-09 17:13:45,104 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 1157 transitions. [2020-11-09 17:13:45,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-09 17:13:45,108 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 17:13:45,108 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 17:13:45,108 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-09 17:13:45,108 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 17:13:45,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 17:13:45,109 INFO L82 PathProgramCache]: Analyzing trace with hash -769299944, now seen corresponding path program 1 times [2020-11-09 17:13:45,111 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 17:13:45,111 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550103705] [2020-11-09 17:13:45,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 17:13:45,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 17:13:45,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 17:13:45,267 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550103705] [2020-11-09 17:13:45,267 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 17:13:45,268 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 17:13:45,268 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1441280432] [2020-11-09 17:13:45,268 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 17:13:45,271 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 17:13:45,277 INFO L252 McrAutomatonBuilder]: Finished intersection with 33 states and 58 transitions. [2020-11-09 17:13:45,277 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 17:13:45,285 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-11-09 17:13:45,285 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:13:45,286 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 17:13:45,286 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:13:45,515 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 17:13:45,515 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-09 17:13:45,516 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 17:13:45,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-09 17:13:45,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-09 17:13:45,517 INFO L87 Difference]: Start difference. First operand 407 states and 1157 transitions. Second operand 5 states. [2020-11-09 17:13:45,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 17:13:45,599 INFO L93 Difference]: Finished difference Result 402 states and 1138 transitions. [2020-11-09 17:13:45,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-09 17:13:45,601 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-11-09 17:13:45,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 17:13:45,605 INFO L225 Difference]: With dead ends: 402 [2020-11-09 17:13:45,605 INFO L226 Difference]: Without dead ends: 402 [2020-11-09 17:13:45,610 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 4 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-09 17:13:45,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2020-11-09 17:13:45,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 398. [2020-11-09 17:13:45,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2020-11-09 17:13:45,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 1127 transitions. [2020-11-09 17:13:45,629 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 1127 transitions. Word has length 12 [2020-11-09 17:13:45,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 17:13:45,629 INFO L481 AbstractCegarLoop]: Abstraction has 398 states and 1127 transitions. [2020-11-09 17:13:45,629 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-09 17:13:45,629 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 1127 transitions. [2020-11-09 17:13:45,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-09 17:13:45,631 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 17:13:45,631 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 17:13:45,631 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-09 17:13:45,631 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 17:13:45,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 17:13:45,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1921518076, now seen corresponding path program 1 times [2020-11-09 17:13:45,634 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 17:13:45,635 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350793153] [2020-11-09 17:13:45,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 17:13:45,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 17:13:45,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 17:13:45,836 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350793153] [2020-11-09 17:13:45,836 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 17:13:45,836 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-09 17:13:45,837 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1819242881] [2020-11-09 17:13:45,837 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 17:13:45,839 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 17:13:45,846 INFO L252 McrAutomatonBuilder]: Finished intersection with 35 states and 61 transitions. [2020-11-09 17:13:45,846 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 17:13:45,905 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-11-09 17:13:45,906 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:13:45,906 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 17:13:45,907 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:13:46,273 WARN L194 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 30 [2020-11-09 17:13:46,534 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [9465#(and (or (= ~y~0 1) (not (= 2 ~y$w_buff0~0))) (or (= ~y~0 1) (= ~y~0 ~y$w_buff0~0)) (= ~y$r_buff0_thd0~0 0)), 9466#(and (or (= ~y~0 1) (= ~y~0 ~y$w_buff0~0) (not (= (mod ~y$w_buff1_used~0 256) 0))) (or (= ~y~0 1) (not (= 2 ~y$w_buff0~0)) (not (= (mod ~y$w_buff1_used~0 256) 0))) (or (not (= 2 ~y$w_buff0~0)) (= ~y$w_buff1~0 1) (= (mod ~y$w_buff1_used~0 256) 0) (= (mod ~y$r_buff1_thd0~0 256) 0)) (or (= ~y~0 1) (not (= 2 ~y$w_buff0~0)) (not (= (mod ~y$r_buff1_thd0~0 256) 0))) (or (= ~y$w_buff1~0 1) (= (mod ~y$w_buff1_used~0 256) 0) (= ~y$w_buff1~0 ~y$w_buff0~0) (= (mod ~y$r_buff1_thd0~0 256) 0)) (= ~y$r_buff0_thd0~0 0) (or (= ~y~0 1) (= ~y~0 ~y$w_buff0~0) (not (= (mod ~y$r_buff1_thd0~0 256) 0)))), 9467#(and (or (not (= 2 ~y$w_buff0~0)) (= ~y$w_buff1~0 1) (= (mod ~y$w_buff1_used~0 256) 0) (= (mod ~y$r_buff1_thd0~0 256) 0)) (or (= ~y$w_buff1~0 1) (= (mod ~y$w_buff1_used~0 256) 0) (= ~y$w_buff1~0 ~y$w_buff0~0) (= (mod ~y$r_buff1_thd0~0 256) 0)) (= ~y$r_buff0_thd0~0 0))] [2020-11-09 17:13:46,535 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-09 17:13:46,535 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 17:13:46,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-09 17:13:46,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-11-09 17:13:46,537 INFO L87 Difference]: Start difference. First operand 398 states and 1127 transitions. Second operand 9 states. [2020-11-09 17:13:47,174 WARN L194 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 27 [2020-11-09 17:13:47,369 WARN L194 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 26 [2020-11-09 17:13:47,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 17:13:47,408 INFO L93 Difference]: Finished difference Result 478 states and 1328 transitions. [2020-11-09 17:13:47,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-09 17:13:47,410 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2020-11-09 17:13:47,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 17:13:47,414 INFO L225 Difference]: With dead ends: 478 [2020-11-09 17:13:47,414 INFO L226 Difference]: Without dead ends: 430 [2020-11-09 17:13:47,415 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 6 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2020-11-09 17:13:47,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2020-11-09 17:13:47,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 416. [2020-11-09 17:13:47,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2020-11-09 17:13:47,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 1156 transitions. [2020-11-09 17:13:47,431 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 1156 transitions. Word has length 13 [2020-11-09 17:13:47,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 17:13:47,431 INFO L481 AbstractCegarLoop]: Abstraction has 416 states and 1156 transitions. [2020-11-09 17:13:47,431 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-09 17:13:47,432 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 1156 transitions. [2020-11-09 17:13:47,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-09 17:13:47,433 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 17:13:47,433 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 17:13:47,433 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-09 17:13:47,433 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 17:13:47,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 17:13:47,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1352377110, now seen corresponding path program 1 times [2020-11-09 17:13:47,435 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 17:13:47,436 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123356066] [2020-11-09 17:13:47,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 17:13:47,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 17:13:47,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 17:13:47,572 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123356066] [2020-11-09 17:13:47,572 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 17:13:47,572 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 17:13:47,573 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1536854478] [2020-11-09 17:13:47,573 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 17:13:47,576 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 17:13:47,580 INFO L252 McrAutomatonBuilder]: Finished intersection with 23 states and 30 transitions. [2020-11-09 17:13:47,581 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 17:13:47,590 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 17:13:47,590 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-09 17:13:47,590 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 17:13:47,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-09 17:13:47,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-09 17:13:47,591 INFO L87 Difference]: Start difference. First operand 416 states and 1156 transitions. Second operand 4 states. [2020-11-09 17:13:47,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 17:13:47,652 INFO L93 Difference]: Finished difference Result 410 states and 1002 transitions. [2020-11-09 17:13:47,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-09 17:13:47,654 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-11-09 17:13:47,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 17:13:47,656 INFO L225 Difference]: With dead ends: 410 [2020-11-09 17:13:47,656 INFO L226 Difference]: Without dead ends: 298 [2020-11-09 17:13:47,657 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-09 17:13:47,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2020-11-09 17:13:47,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2020-11-09 17:13:47,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2020-11-09 17:13:47,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 708 transitions. [2020-11-09 17:13:47,667 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 708 transitions. Word has length 13 [2020-11-09 17:13:47,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 17:13:47,668 INFO L481 AbstractCegarLoop]: Abstraction has 298 states and 708 transitions. [2020-11-09 17:13:47,668 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-09 17:13:47,668 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 708 transitions. [2020-11-09 17:13:47,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-09 17:13:47,669 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 17:13:47,669 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 17:13:47,669 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-09 17:13:47,669 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 17:13:47,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 17:13:47,670 INFO L82 PathProgramCache]: Analyzing trace with hash 1882145435, now seen corresponding path program 1 times [2020-11-09 17:13:47,671 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 17:13:47,672 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786938601] [2020-11-09 17:13:47,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 17:13:47,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 17:13:47,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 17:13:47,848 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786938601] [2020-11-09 17:13:47,848 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 17:13:47,848 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-09 17:13:47,849 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1786409537] [2020-11-09 17:13:47,849 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 17:13:47,851 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 17:13:47,857 INFO L252 McrAutomatonBuilder]: Finished intersection with 25 states and 33 transitions. [2020-11-09 17:13:47,857 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 17:13:47,920 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 17:13:47,955 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 17:13:47,956 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-09 17:13:47,956 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 17:13:47,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-09 17:13:47,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-09 17:13:47,957 INFO L87 Difference]: Start difference. First operand 298 states and 708 transitions. Second operand 5 states. [2020-11-09 17:13:48,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 17:13:48,038 INFO L93 Difference]: Finished difference Result 245 states and 530 transitions. [2020-11-09 17:13:48,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-09 17:13:48,040 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-11-09 17:13:48,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 17:13:48,042 INFO L225 Difference]: With dead ends: 245 [2020-11-09 17:13:48,042 INFO L226 Difference]: Without dead ends: 186 [2020-11-09 17:13:48,042 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-09 17:13:48,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2020-11-09 17:13:48,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2020-11-09 17:13:48,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2020-11-09 17:13:48,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 390 transitions. [2020-11-09 17:13:48,048 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 390 transitions. Word has length 14 [2020-11-09 17:13:48,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 17:13:48,049 INFO L481 AbstractCegarLoop]: Abstraction has 186 states and 390 transitions. [2020-11-09 17:13:48,049 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-09 17:13:48,049 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 390 transitions. [2020-11-09 17:13:48,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 17:13:48,050 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 17:13:48,050 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 17:13:48,050 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-09 17:13:48,050 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 17:13:48,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 17:13:48,050 INFO L82 PathProgramCache]: Analyzing trace with hash 573655817, now seen corresponding path program 1 times [2020-11-09 17:13:48,052 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 17:13:48,053 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709362573] [2020-11-09 17:13:48,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 17:13:48,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 17:13:48,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 17:13:48,143 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709362573] [2020-11-09 17:13:48,143 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 17:13:48,143 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-09 17:13:48,144 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1894443672] [2020-11-09 17:13:48,144 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 17:13:48,146 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 17:13:48,154 INFO L252 McrAutomatonBuilder]: Finished intersection with 38 states and 55 transitions. [2020-11-09 17:13:48,155 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 17:13:48,204 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [12432#(<= ~__unbuffered_cnt~0 0)] [2020-11-09 17:13:48,204 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-09 17:13:48,205 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 17:13:48,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-09 17:13:48,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-09 17:13:48,206 INFO L87 Difference]: Start difference. First operand 186 states and 390 transitions. Second operand 7 states. [2020-11-09 17:13:48,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 17:13:48,291 INFO L93 Difference]: Finished difference Result 166 states and 349 transitions. [2020-11-09 17:13:48,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-09 17:13:48,293 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-11-09 17:13:48,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 17:13:48,294 INFO L225 Difference]: With dead ends: 166 [2020-11-09 17:13:48,294 INFO L226 Difference]: Without dead ends: 105 [2020-11-09 17:13:48,294 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-11-09 17:13:48,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2020-11-09 17:13:48,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 87. [2020-11-09 17:13:48,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-11-09 17:13:48,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 176 transitions. [2020-11-09 17:13:48,298 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 176 transitions. Word has length 16 [2020-11-09 17:13:48,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 17:13:48,298 INFO L481 AbstractCegarLoop]: Abstraction has 87 states and 176 transitions. [2020-11-09 17:13:48,298 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-09 17:13:48,299 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 176 transitions. [2020-11-09 17:13:48,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-11-09 17:13:48,299 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 17:13:48,299 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 17:13:48,299 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-09 17:13:48,300 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 17:13:48,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 17:13:48,300 INFO L82 PathProgramCache]: Analyzing trace with hash -2071543388, now seen corresponding path program 1 times [2020-11-09 17:13:48,302 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 17:13:48,302 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817450672] [2020-11-09 17:13:48,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 17:13:48,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 17:13:48,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 17:13:48,432 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817450672] [2020-11-09 17:13:48,435 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 17:13:48,435 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-09 17:13:48,435 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [833260083] [2020-11-09 17:13:48,435 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 17:13:48,440 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 17:13:48,460 INFO L252 McrAutomatonBuilder]: Finished intersection with 76 states and 145 transitions. [2020-11-09 17:13:48,460 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 17:13:48,485 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 17:13:48,485 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:13:48,487 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 17:13:48,487 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:13:48,488 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 17:13:48,489 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:13:48,538 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 17:13:48,538 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:13:48,539 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 17:13:48,539 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:13:48,540 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 17:13:48,540 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:13:48,601 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 17:13:48,601 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:13:48,602 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 17:13:48,602 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:13:48,603 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 17:13:48,604 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:13:48,647 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 17:13:48,647 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:13:48,648 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 17:13:48,649 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:13:48,650 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 17:13:48,650 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:13:48,703 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 17:13:48,703 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:13:48,704 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 17:13:48,705 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:13:48,706 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 17:13:48,706 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:13:48,739 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 17:13:48,740 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-09 17:13:48,740 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 17:13:48,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-09 17:13:48,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-11-09 17:13:48,741 INFO L87 Difference]: Start difference. First operand 87 states and 176 transitions. Second operand 6 states. [2020-11-09 17:13:48,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 17:13:48,838 INFO L93 Difference]: Finished difference Result 141 states and 289 transitions. [2020-11-09 17:13:48,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-09 17:13:48,840 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-11-09 17:13:48,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 17:13:48,841 INFO L225 Difference]: With dead ends: 141 [2020-11-09 17:13:48,841 INFO L226 Difference]: Without dead ends: 75 [2020-11-09 17:13:48,842 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-11-09 17:13:48,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2020-11-09 17:13:48,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2020-11-09 17:13:48,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-11-09 17:13:48,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 152 transitions. [2020-11-09 17:13:48,845 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 152 transitions. Word has length 20 [2020-11-09 17:13:48,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 17:13:48,846 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 152 transitions. [2020-11-09 17:13:48,846 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-09 17:13:48,846 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 152 transitions. [2020-11-09 17:13:48,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-11-09 17:13:48,846 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 17:13:48,847 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 17:13:48,847 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-09 17:13:48,847 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 17:13:48,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 17:13:48,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1943956750, now seen corresponding path program 2 times [2020-11-09 17:13:48,855 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 17:13:48,855 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676594447] [2020-11-09 17:13:48,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 17:13:48,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 17:13:48,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 17:13:48,908 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676594447] [2020-11-09 17:13:48,909 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 17:13:48,909 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 17:13:48,909 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1231938781] [2020-11-09 17:13:48,909 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 17:13:48,912 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 17:13:48,932 INFO L252 McrAutomatonBuilder]: Finished intersection with 71 states and 128 transitions. [2020-11-09 17:13:48,932 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 17:13:48,955 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 17:13:48,955 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:13:48,956 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 17:13:48,956 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:13:48,957 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 17:13:48,957 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:13:48,992 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 17:13:48,993 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:13:48,994 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 17:13:48,994 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:13:48,995 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 17:13:48,995 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:13:49,039 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 17:13:49,039 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:13:49,040 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 17:13:49,041 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:13:49,041 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 17:13:49,042 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:13:49,096 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 17:13:49,097 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:13:49,097 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 17:13:49,098 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:13:49,099 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 17:13:49,099 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:13:49,129 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 17:13:49,129 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:13:49,130 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 17:13:49,131 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:13:49,131 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 17:13:49,131 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:13:49,164 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 17:13:49,164 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:13:49,165 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 17:13:49,166 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:13:49,166 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 17:13:49,167 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:13:49,246 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 17:13:49,246 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-09 17:13:49,246 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 17:13:49,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-09 17:13:49,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-09 17:13:49,247 INFO L87 Difference]: Start difference. First operand 75 states and 152 transitions. Second operand 4 states. [2020-11-09 17:13:49,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 17:13:49,273 INFO L93 Difference]: Finished difference Result 101 states and 200 transitions. [2020-11-09 17:13:49,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-09 17:13:49,275 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2020-11-09 17:13:49,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 17:13:49,276 INFO L225 Difference]: With dead ends: 101 [2020-11-09 17:13:49,276 INFO L226 Difference]: Without dead ends: 47 [2020-11-09 17:13:49,277 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-09 17:13:49,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-11-09 17:13:49,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2020-11-09 17:13:49,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-11-09 17:13:49,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 80 transitions. [2020-11-09 17:13:49,279 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 80 transitions. Word has length 20 [2020-11-09 17:13:49,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 17:13:49,279 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 80 transitions. [2020-11-09 17:13:49,279 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-09 17:13:49,279 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 80 transitions. [2020-11-09 17:13:49,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-11-09 17:13:49,280 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 17:13:49,280 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 17:13:49,280 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-09 17:13:49,280 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 17:13:49,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 17:13:49,281 INFO L82 PathProgramCache]: Analyzing trace with hash -7896946, now seen corresponding path program 3 times [2020-11-09 17:13:49,283 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 17:13:49,283 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649816770] [2020-11-09 17:13:49,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 17:13:49,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-09 17:13:49,322 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-09 17:13:49,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-09 17:13:49,370 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-09 17:13:49,422 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-09 17:13:49,423 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-09 17:13:49,423 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-09 17:13:49,559 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 05:13:49 BasicIcfg [2020-11-09 17:13:49,560 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-09 17:13:49,562 INFO L168 Benchmark]: Toolchain (without parser) took 47092.62 ms. Allocated memory was 151.0 MB in the beginning and 262.1 MB in the end (delta: 111.1 MB). Free memory was 126.2 MB in the beginning and 190.3 MB in the end (delta: -64.1 MB). Peak memory consumption was 47.6 MB. Max. memory is 8.0 GB. [2020-11-09 17:13:49,563 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 125.8 MB. Free memory was 101.9 MB in the beginning and 101.8 MB in the end (delta: 136.3 kB). There was no memory consumed. Max. memory is 8.0 GB. [2020-11-09 17:13:49,565 INFO L168 Benchmark]: CACSL2BoogieTranslator took 989.00 ms. Allocated memory is still 151.0 MB. Free memory was 125.5 MB in the beginning and 123.0 MB in the end (delta: 2.5 MB). Peak memory consumption was 29.6 MB. Max. memory is 8.0 GB. [2020-11-09 17:13:49,565 INFO L168 Benchmark]: Boogie Procedure Inliner took 128.95 ms. Allocated memory is still 151.0 MB. Free memory was 123.0 MB in the beginning and 120.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2020-11-09 17:13:49,566 INFO L168 Benchmark]: Boogie Preprocessor took 76.65 ms. Allocated memory is still 151.0 MB. Free memory was 120.4 MB in the beginning and 117.8 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-11-09 17:13:49,566 INFO L168 Benchmark]: RCFGBuilder took 2666.36 ms. Allocated memory was 151.0 MB in the beginning and 181.4 MB in the end (delta: 30.4 MB). Free memory was 117.8 MB in the beginning and 108.8 MB in the end (delta: 9.0 MB). Peak memory consumption was 61.8 MB. Max. memory is 8.0 GB. [2020-11-09 17:13:49,567 INFO L168 Benchmark]: TraceAbstraction took 43213.62 ms. Allocated memory was 181.4 MB in the beginning and 262.1 MB in the end (delta: 80.7 MB). Free memory was 108.3 MB in the beginning and 190.3 MB in the end (delta: -82.1 MB). There was no memory consumed. Max. memory is 8.0 GB. [2020-11-09 17:13:49,572 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.29 ms. Allocated memory is still 125.8 MB. Free memory was 101.9 MB in the beginning and 101.8 MB in the end (delta: 136.3 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 989.00 ms. Allocated memory is still 151.0 MB. Free memory was 125.5 MB in the beginning and 123.0 MB in the end (delta: 2.5 MB). Peak memory consumption was 29.6 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 128.95 ms. Allocated memory is still 151.0 MB. Free memory was 123.0 MB in the beginning and 120.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 76.65 ms. Allocated memory is still 151.0 MB. Free memory was 120.4 MB in the beginning and 117.8 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 2666.36 ms. Allocated memory was 151.0 MB in the beginning and 181.4 MB in the end (delta: 30.4 MB). Free memory was 117.8 MB in the beginning and 108.8 MB in the end (delta: 9.0 MB). Peak memory consumption was 61.8 MB. Max. memory is 8.0 GB. * TraceAbstraction took 43213.62 ms. Allocated memory was 181.4 MB in the beginning and 262.1 MB in the end (delta: 80.7 MB). Free memory was 108.3 MB in the beginning and 190.3 MB in the end (delta: -82.1 MB). There was no memory consumed. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 963 VarBasedMoverChecksPositive, 36 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 67 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 35.6s, 107 PlacesBefore, 35 PlacesAfterwards, 100 TransitionsBefore, 25 TransitionsAfterwards, 1746 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 3 ChoiceCompositions, 92 TotalNumberOfCompositions, 4701 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L718] 0 _Bool y$flush_delayed; [L719] 0 int y$mem_tmp; [L720] 0 _Bool y$r_buff0_thd0; [L721] 0 _Bool y$r_buff0_thd1; [L722] 0 _Bool y$r_buff0_thd2; [L723] 0 _Bool y$r_buff0_thd3; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$r_buff1_thd3; [L728] 0 _Bool y$read_delayed; [L729] 0 int *y$read_delayed_var; [L730] 0 int y$w_buff0; [L731] 0 _Bool y$w_buff0_used; [L732] 0 int y$w_buff1; [L733] 0 _Bool y$w_buff1_used; [L735] 0 int z = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L815] 0 pthread_t t2522; [L816] FCALL, FORK 0 pthread_create(&t2522, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L817] 0 pthread_t t2523; [L818] FCALL, FORK 0 pthread_create(&t2523, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L819] 0 pthread_t t2524; [L820] FCALL, FORK 0 pthread_create(&t2524, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L778] 3 y$w_buff1 = y$w_buff0 [L779] 3 y$w_buff0 = 2 [L780] 3 y$w_buff1_used = y$w_buff0_used [L781] 3 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L783] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L784] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L785] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L786] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L787] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L790] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L741] 1 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L746] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L751] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L753] 1 return 0; [L758] 2 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L761] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L764] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L764] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L764] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L764] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L765] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L765] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L766] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L766] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L767] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L767] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L768] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L768] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L771] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 2 return 0; [L793] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L793] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L794] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L794] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L795] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L795] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L796] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L796] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L797] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L797] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L800] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L802] 3 return 0; [L822] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L826] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L826] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L827] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L827] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L828] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L828] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L829] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L829] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L830] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L830] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L833] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L834] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L835] 0 y$flush_delayed = weak$$choice2 [L836] 0 y$mem_tmp = y [L837] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L837] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L838] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L838] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L839] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L839] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L840] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L840] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L841] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L841] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L842] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L843] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L843] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0) [L845] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L845] 0 y = y$flush_delayed ? y$mem_tmp : y [L846] 0 y$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "safe031_pso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 98 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 42.9s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 35.7s, HoareTripleCheckerStatistics: 269 SDtfs, 322 SDslu, 437 SDs, 0 SdLazy, 271 SolverSat, 89 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 153 GetRequests, 88 SyntacticMatches, 14 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=650occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 171 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 176 NumberOfCodeBlocks, 176 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 144 ConstructedInterpolants, 0 QuantifiedInterpolants, 10641 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 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! Received shutdown request...