/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix052_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-b09bf87 [2020-10-16 12:04:23,557 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 12:04:23,559 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 12:04:23,584 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 12:04:23,584 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 12:04:23,585 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 12:04:23,586 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 12:04:23,588 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 12:04:23,590 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 12:04:23,591 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 12:04:23,592 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 12:04:23,593 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 12:04:23,593 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 12:04:23,594 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 12:04:23,599 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 12:04:23,600 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 12:04:23,601 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 12:04:23,602 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 12:04:23,605 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 12:04:23,609 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 12:04:23,613 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 12:04:23,614 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 12:04:23,615 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 12:04:23,615 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 12:04:23,618 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 12:04:23,618 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 12:04:23,618 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 12:04:23,620 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 12:04:23,621 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 12:04:23,622 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 12:04:23,623 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 12:04:23,624 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 12:04:23,625 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 12:04:23,625 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 12:04:23,627 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 12:04:23,627 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 12:04:23,628 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 12:04:23,628 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 12:04:23,628 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 12:04:23,638 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 12:04:23,639 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 12:04:23,640 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf [2020-10-16 12:04:23,684 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 12:04:23,684 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 12:04:23,686 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 12:04:23,686 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 12:04:23,686 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 12:04:23,686 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 12:04:23,687 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 12:04:23,687 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 12:04:23,687 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 12:04:23,688 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 12:04:23,689 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 12:04:23,689 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 12:04:23,689 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 12:04:23,690 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 12:04:23,690 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 12:04:23,690 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 12:04:23,690 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 12:04:23,691 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 12:04:23,691 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 12:04:23,691 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 12:04:23,691 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 12:04:23,691 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 12:04:23,691 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 12:04:23,692 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-16 12:04:23,692 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 12:04:23,692 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 12:04:23,692 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 12:04:23,692 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-16 12:04:23,693 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-16 12:04:23,992 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 12:04:24,011 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 12:04:24,015 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 12:04:24,016 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 12:04:24,017 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 12:04:24,017 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix052_tso.oepc.i [2020-10-16 12:04:24,091 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/d29778b58/6bfcf736e17148458033adbd65ab751f/FLAG7dbd25be5 [2020-10-16 12:04:24,726 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 12:04:24,728 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/pthread-wmm/mix052_tso.oepc.i [2020-10-16 12:04:24,751 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/d29778b58/6bfcf736e17148458033adbd65ab751f/FLAG7dbd25be5 [2020-10-16 12:04:24,935 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/d29778b58/6bfcf736e17148458033adbd65ab751f [2020-10-16 12:04:24,943 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 12:04:24,946 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 12:04:24,947 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 12:04:24,947 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 12:04:24,951 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 12:04:24,952 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 12:04:24" (1/1) ... [2020-10-16 12:04:24,956 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@602078d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:04:24, skipping insertion in model container [2020-10-16 12:04:24,957 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 12:04:24" (1/1) ... [2020-10-16 12:04:24,965 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 12:04:25,026 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 12:04:25,574 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 12:04:25,587 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 12:04:25,653 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 12:04:25,723 INFO L208 MainTranslator]: Completed translation [2020-10-16 12:04:25,724 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:04:25 WrapperNode [2020-10-16 12:04:25,724 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 12:04:25,725 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 12:04:25,725 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 12:04:25,725 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 12:04:25,734 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:04:25" (1/1) ... [2020-10-16 12:04:25,753 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:04:25" (1/1) ... [2020-10-16 12:04:25,786 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 12:04:25,787 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 12:04:25,787 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 12:04:25,787 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 12:04:25,797 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:04:25" (1/1) ... [2020-10-16 12:04:25,797 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:04:25" (1/1) ... [2020-10-16 12:04:25,802 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:04:25" (1/1) ... [2020-10-16 12:04:25,803 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:04:25" (1/1) ... [2020-10-16 12:04:25,813 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:04:25" (1/1) ... [2020-10-16 12:04:25,817 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:04:25" (1/1) ... [2020-10-16 12:04:25,822 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:04:25" (1/1) ... [2020-10-16 12:04:25,828 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 12:04:25,829 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 12:04:25,829 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 12:04:25,829 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 12:04:25,830 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:04:25" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/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-10-16 12:04:25,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 12:04:25,899 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 12:04:25,899 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 12:04:25,900 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 12:04:25,900 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 12:04:25,900 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 12:04:25,900 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 12:04:25,900 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 12:04:25,901 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 12:04:25,901 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 12:04:25,901 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 12:04:25,901 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 12:04:25,901 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 12:04:25,903 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-16 12:04:28,020 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 12:04:28,020 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 12:04:28,023 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 12:04:28 BoogieIcfgContainer [2020-10-16 12:04:28,023 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 12:04:28,024 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 12:04:28,025 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 12:04:28,029 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 12:04:28,029 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 12:04:24" (1/3) ... [2020-10-16 12:04:28,030 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@717274e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 12:04:28, skipping insertion in model container [2020-10-16 12:04:28,030 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:04:25" (2/3) ... [2020-10-16 12:04:28,031 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@717274e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 12:04:28, skipping insertion in model container [2020-10-16 12:04:28,031 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 12:04:28" (3/3) ... [2020-10-16 12:04:28,033 INFO L111 eAbstractionObserver]: Analyzing ICFG mix052_tso.oepc.i [2020-10-16 12:04:28,046 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-16 12:04:28,046 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-16 12:04:28,054 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 12:04:28,056 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 12:04:28,087 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:28,087 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:28,088 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:28,088 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:28,088 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:28,089 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:28,089 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:28,089 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:28,089 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:28,090 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:28,090 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:28,091 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:28,091 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:28,092 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:28,092 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:28,092 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:28,092 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:28,093 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:28,093 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:28,093 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:28,093 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:28,094 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:28,094 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:28,094 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:28,094 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:28,094 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:28,095 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:28,095 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:28,095 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:28,096 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:28,096 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:28,096 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:28,096 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:28,096 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:28,097 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:28,097 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:28,097 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:28,097 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:28,097 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:28,098 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:28,098 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:28,098 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:28,099 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:28,103 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:28,104 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:28,104 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:28,105 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:28,105 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:28,105 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:28,105 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:28,105 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:28,106 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:28,106 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:28,110 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:28,110 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:28,110 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:28,111 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:28,111 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:28,111 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:28,111 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:28,112 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:28,112 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:28,112 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:28,114 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:28,115 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:28,115 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:28,115 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:28,116 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:28,116 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:28,116 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:28,116 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:28,116 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:28,117 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:28,117 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:28,117 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:28,119 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-16 12:04:28,136 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-16 12:04:28,160 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 12:04:28,161 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-16 12:04:28,161 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-16 12:04:28,161 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 12:04:28,161 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 12:04:28,161 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 12:04:28,162 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 12:04:28,162 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 12:04:28,178 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-16 12:04:28,178 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 101 places, 93 transitions, 201 flow [2020-10-16 12:04:28,182 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 101 places, 93 transitions, 201 flow [2020-10-16 12:04:28,184 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 101 places, 93 transitions, 201 flow [2020-10-16 12:04:28,232 INFO L129 PetriNetUnfolder]: 2/90 cut-off events. [2020-10-16 12:04:28,232 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 12:04:28,238 INFO L80 FinitePrefix]: Finished finitePrefix Result has 100 conditions, 90 events. 2/90 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 67 event pairs, 0 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2020-10-16 12:04:28,241 INFO L117 LiptonReduction]: Number of co-enabled transitions 1642 [2020-10-16 12:04:29,920 WARN L193 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 226 DAG size of output: 186 [2020-10-16 12:04:29,963 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 2, 1] term [2020-10-16 12:04:29,963 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:04:29,966 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 12:04:29,967 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:04:31,050 WARN L193 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 142 DAG size of output: 121 [2020-10-16 12:04:31,554 WARN L193 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-10-16 12:04:31,727 WARN L193 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-16 12:04:32,410 WARN L193 SmtUtils]: Spent 366.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2020-10-16 12:04:32,949 WARN L193 SmtUtils]: Spent 536.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2020-10-16 12:04:33,614 WARN L193 SmtUtils]: Spent 660.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 106 [2020-10-16 12:04:33,888 WARN L193 SmtUtils]: Spent 271.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2020-10-16 12:04:35,101 WARN L193 SmtUtils]: Spent 971.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 123 [2020-10-16 12:04:35,412 WARN L193 SmtUtils]: Spent 309.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2020-10-16 12:04:35,800 WARN L193 SmtUtils]: Spent 298.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2020-10-16 12:04:36,180 WARN L193 SmtUtils]: Spent 376.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2020-10-16 12:04:36,540 WARN L193 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2020-10-16 12:04:36,697 WARN L193 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2020-10-16 12:04:36,707 INFO L132 LiptonReduction]: Checked pairs total: 4710 [2020-10-16 12:04:36,707 INFO L134 LiptonReduction]: Total number of compositions: 77 [2020-10-16 12:04:36,717 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 26 transitions, 67 flow [2020-10-16 12:04:36,779 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 822 states. [2020-10-16 12:04:36,782 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states. [2020-10-16 12:04:36,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-10-16 12:04:36,788 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:04:36,789 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-10-16 12:04:36,789 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:04:36,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:04:36,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1003457510, now seen corresponding path program 1 times [2020-10-16 12:04:36,806 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:04:36,806 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278024216] [2020-10-16 12:04:36,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:04:36,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:04:37,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:04:37,037 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278024216] [2020-10-16 12:04:37,037 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:04:37,038 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 12:04:37,038 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584988318] [2020-10-16 12:04:37,043 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:04:37,044 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:04:37,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:04:37,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:04:37,062 INFO L87 Difference]: Start difference. First operand 822 states. Second operand 3 states. [2020-10-16 12:04:37,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:04:37,191 INFO L93 Difference]: Finished difference Result 687 states and 2150 transitions. [2020-10-16 12:04:37,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:04:37,194 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-10-16 12:04:37,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:04:37,216 INFO L225 Difference]: With dead ends: 687 [2020-10-16 12:04:37,216 INFO L226 Difference]: Without dead ends: 562 [2020-10-16 12:04:37,218 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-10-16 12:04:37,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2020-10-16 12:04:37,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2020-10-16 12:04:37,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2020-10-16 12:04:37,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 1725 transitions. [2020-10-16 12:04:37,317 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 1725 transitions. Word has length 5 [2020-10-16 12:04:37,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:04:37,318 INFO L481 AbstractCegarLoop]: Abstraction has 562 states and 1725 transitions. [2020-10-16 12:04:37,318 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:04:37,318 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 1725 transitions. [2020-10-16 12:04:37,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-16 12:04:37,320 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:04:37,320 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:04:37,320 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 12:04:37,321 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:04:37,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:04:37,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1922104647, now seen corresponding path program 1 times [2020-10-16 12:04:37,321 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:04:37,322 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265545032] [2020-10-16 12:04:37,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:04:37,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:04:37,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:04:37,534 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265545032] [2020-10-16 12:04:37,534 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:04:37,535 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 12:04:37,535 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462233374] [2020-10-16 12:04:37,536 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:04:37,537 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:04:37,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:04:37,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:04:37,537 INFO L87 Difference]: Start difference. First operand 562 states and 1725 transitions. Second operand 3 states. [2020-10-16 12:04:37,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:04:37,593 INFO L93 Difference]: Finished difference Result 552 states and 1687 transitions. [2020-10-16 12:04:37,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:04:37,595 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-16 12:04:37,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:04:37,605 INFO L225 Difference]: With dead ends: 552 [2020-10-16 12:04:37,605 INFO L226 Difference]: Without dead ends: 552 [2020-10-16 12:04:37,606 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-10-16 12:04:37,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2020-10-16 12:04:37,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2020-10-16 12:04:37,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2020-10-16 12:04:37,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 1687 transitions. [2020-10-16 12:04:37,648 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 1687 transitions. Word has length 9 [2020-10-16 12:04:37,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:04:37,659 INFO L481 AbstractCegarLoop]: Abstraction has 552 states and 1687 transitions. [2020-10-16 12:04:37,659 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:04:37,659 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 1687 transitions. [2020-10-16 12:04:37,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-16 12:04:37,662 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:04:37,662 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:04:37,662 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 12:04:37,663 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:04:37,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:04:37,663 INFO L82 PathProgramCache]: Analyzing trace with hash -1109692064, now seen corresponding path program 1 times [2020-10-16 12:04:37,663 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:04:37,664 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656997953] [2020-10-16 12:04:37,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:04:37,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:04:37,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:04:37,805 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656997953] [2020-10-16 12:04:37,805 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:04:37,806 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:04:37,806 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909880753] [2020-10-16 12:04:37,806 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 12:04:37,806 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:04:37,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 12:04:37,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:04:37,808 INFO L87 Difference]: Start difference. First operand 552 states and 1687 transitions. Second operand 5 states. [2020-10-16 12:04:37,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:04:37,914 INFO L93 Difference]: Finished difference Result 564 states and 1715 transitions. [2020-10-16 12:04:37,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 12:04:37,916 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-10-16 12:04:37,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:04:37,924 INFO L225 Difference]: With dead ends: 564 [2020-10-16 12:04:37,925 INFO L226 Difference]: Without dead ends: 564 [2020-10-16 12:04:37,925 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:04:37,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2020-10-16 12:04:37,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 564. [2020-10-16 12:04:37,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 564 states. [2020-10-16 12:04:37,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 1715 transitions. [2020-10-16 12:04:37,947 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 1715 transitions. Word has length 10 [2020-10-16 12:04:37,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:04:37,948 INFO L481 AbstractCegarLoop]: Abstraction has 564 states and 1715 transitions. [2020-10-16 12:04:37,948 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 12:04:37,948 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 1715 transitions. [2020-10-16 12:04:37,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-16 12:04:37,955 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:04:37,959 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:04:37,959 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 12:04:37,959 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:04:37,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:04:37,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1971258457, now seen corresponding path program 1 times [2020-10-16 12:04:37,965 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:04:37,965 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778641311] [2020-10-16 12:04:37,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:04:38,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:04:38,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:04:38,122 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778641311] [2020-10-16 12:04:38,122 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:04:38,123 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:04:38,124 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516808301] [2020-10-16 12:04:38,124 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 12:04:38,124 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:04:38,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 12:04:38,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:04:38,125 INFO L87 Difference]: Start difference. First operand 564 states and 1715 transitions. Second operand 5 states. [2020-10-16 12:04:38,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:04:38,234 INFO L93 Difference]: Finished difference Result 567 states and 1722 transitions. [2020-10-16 12:04:38,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 12:04:38,235 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-10-16 12:04:38,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:04:38,239 INFO L225 Difference]: With dead ends: 567 [2020-10-16 12:04:38,240 INFO L226 Difference]: Without dead ends: 567 [2020-10-16 12:04:38,240 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:04:38,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2020-10-16 12:04:38,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 567. [2020-10-16 12:04:38,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 567 states. [2020-10-16 12:04:38,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 1722 transitions. [2020-10-16 12:04:38,258 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 1722 transitions. Word has length 11 [2020-10-16 12:04:38,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:04:38,258 INFO L481 AbstractCegarLoop]: Abstraction has 567 states and 1722 transitions. [2020-10-16 12:04:38,259 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 12:04:38,259 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 1722 transitions. [2020-10-16 12:04:38,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-16 12:04:38,260 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:04:38,260 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:04:38,260 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 12:04:38,261 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:04:38,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:04:38,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1275329160, now seen corresponding path program 1 times [2020-10-16 12:04:38,261 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:04:38,262 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672507120] [2020-10-16 12:04:38,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:04:38,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:04:38,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:04:38,411 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672507120] [2020-10-16 12:04:38,412 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:04:38,412 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 12:04:38,412 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152433830] [2020-10-16 12:04:38,413 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 12:04:38,413 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:04:38,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 12:04:38,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:04:38,413 INFO L87 Difference]: Start difference. First operand 567 states and 1722 transitions. Second operand 6 states. [2020-10-16 12:04:38,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:04:38,592 INFO L93 Difference]: Finished difference Result 621 states and 1868 transitions. [2020-10-16 12:04:38,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 12:04:38,593 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2020-10-16 12:04:38,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:04:38,598 INFO L225 Difference]: With dead ends: 621 [2020-10-16 12:04:38,598 INFO L226 Difference]: Without dead ends: 621 [2020-10-16 12:04:38,598 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-16 12:04:38,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2020-10-16 12:04:38,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 607. [2020-10-16 12:04:38,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 607 states. [2020-10-16 12:04:38,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 1835 transitions. [2020-10-16 12:04:38,618 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 1835 transitions. Word has length 12 [2020-10-16 12:04:38,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:04:38,619 INFO L481 AbstractCegarLoop]: Abstraction has 607 states and 1835 transitions. [2020-10-16 12:04:38,619 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 12:04:38,619 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 1835 transitions. [2020-10-16 12:04:38,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-16 12:04:38,620 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:04:38,620 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:04:38,620 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 12:04:38,621 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:04:38,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:04:38,621 INFO L82 PathProgramCache]: Analyzing trace with hash 958953436, now seen corresponding path program 1 times [2020-10-16 12:04:38,621 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:04:38,622 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126435816] [2020-10-16 12:04:38,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:04:38,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:04:38,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:04:38,707 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126435816] [2020-10-16 12:04:38,708 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:04:38,708 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:04:38,708 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547061264] [2020-10-16 12:04:38,709 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 12:04:38,709 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:04:38,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 12:04:38,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:04:38,709 INFO L87 Difference]: Start difference. First operand 607 states and 1835 transitions. Second operand 5 states. [2020-10-16 12:04:38,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:04:38,774 INFO L93 Difference]: Finished difference Result 600 states and 1809 transitions. [2020-10-16 12:04:38,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 12:04:38,775 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-10-16 12:04:38,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:04:38,780 INFO L225 Difference]: With dead ends: 600 [2020-10-16 12:04:38,780 INFO L226 Difference]: Without dead ends: 600 [2020-10-16 12:04:38,781 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-10-16 12:04:38,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2020-10-16 12:04:38,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 595. [2020-10-16 12:04:38,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 595 states. [2020-10-16 12:04:38,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 1795 transitions. [2020-10-16 12:04:38,800 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 1795 transitions. Word has length 12 [2020-10-16 12:04:38,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:04:38,800 INFO L481 AbstractCegarLoop]: Abstraction has 595 states and 1795 transitions. [2020-10-16 12:04:38,801 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 12:04:38,801 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 1795 transitions. [2020-10-16 12:04:38,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-16 12:04:38,802 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:04:38,802 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:04:38,802 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 12:04:38,802 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:04:38,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:04:38,803 INFO L82 PathProgramCache]: Analyzing trace with hash 1981061887, now seen corresponding path program 1 times [2020-10-16 12:04:38,803 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:04:38,803 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447736068] [2020-10-16 12:04:38,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:04:38,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:04:38,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:04:38,871 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447736068] [2020-10-16 12:04:38,871 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:04:38,872 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:04:38,872 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588732770] [2020-10-16 12:04:38,872 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 12:04:38,872 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:04:38,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 12:04:38,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 12:04:38,873 INFO L87 Difference]: Start difference. First operand 595 states and 1795 transitions. Second operand 4 states. [2020-10-16 12:04:38,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:04:38,917 INFO L93 Difference]: Finished difference Result 564 states and 1508 transitions. [2020-10-16 12:04:38,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 12:04:38,918 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-10-16 12:04:38,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:04:38,922 INFO L225 Difference]: With dead ends: 564 [2020-10-16 12:04:38,922 INFO L226 Difference]: Without dead ends: 415 [2020-10-16 12:04:38,922 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-10-16 12:04:38,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2020-10-16 12:04:38,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 415. [2020-10-16 12:04:38,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 415 states. [2020-10-16 12:04:38,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 1075 transitions. [2020-10-16 12:04:38,937 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 1075 transitions. Word has length 12 [2020-10-16 12:04:38,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:04:38,937 INFO L481 AbstractCegarLoop]: Abstraction has 415 states and 1075 transitions. [2020-10-16 12:04:38,937 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 12:04:38,938 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 1075 transitions. [2020-10-16 12:04:38,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-16 12:04:38,939 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:04:38,939 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:04:38,939 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 12:04:38,939 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:04:38,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:04:38,940 INFO L82 PathProgramCache]: Analyzing trace with hash 1720002661, now seen corresponding path program 1 times [2020-10-16 12:04:38,940 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:04:38,940 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071015379] [2020-10-16 12:04:38,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:04:38,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:04:39,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:04:39,015 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071015379] [2020-10-16 12:04:39,016 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:04:39,016 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 12:04:39,016 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492459618] [2020-10-16 12:04:39,017 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 12:04:39,017 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:04:39,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 12:04:39,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:04:39,018 INFO L87 Difference]: Start difference. First operand 415 states and 1075 transitions. Second operand 5 states. [2020-10-16 12:04:39,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:04:39,070 INFO L93 Difference]: Finished difference Result 329 states and 788 transitions. [2020-10-16 12:04:39,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 12:04:39,072 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-16 12:04:39,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:04:39,073 INFO L225 Difference]: With dead ends: 329 [2020-10-16 12:04:39,074 INFO L226 Difference]: Without dead ends: 255 [2020-10-16 12:04:39,075 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:04:39,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2020-10-16 12:04:39,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 231. [2020-10-16 12:04:39,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2020-10-16 12:04:39,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 535 transitions. [2020-10-16 12:04:39,086 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 535 transitions. Word has length 13 [2020-10-16 12:04:39,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:04:39,086 INFO L481 AbstractCegarLoop]: Abstraction has 231 states and 535 transitions. [2020-10-16 12:04:39,086 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 12:04:39,086 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 535 transitions. [2020-10-16 12:04:39,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-16 12:04:39,087 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:04:39,088 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:04:39,088 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 12:04:39,088 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:04:39,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:04:39,088 INFO L82 PathProgramCache]: Analyzing trace with hash -742899671, now seen corresponding path program 1 times [2020-10-16 12:04:39,090 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:04:39,090 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2682997] [2020-10-16 12:04:39,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:04:39,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:04:39,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:04:39,368 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2682997] [2020-10-16 12:04:39,368 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:04:39,368 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 12:04:39,369 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660504276] [2020-10-16 12:04:39,369 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 12:04:39,369 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:04:39,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 12:04:39,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-16 12:04:39,370 INFO L87 Difference]: Start difference. First operand 231 states and 535 transitions. Second operand 8 states. [2020-10-16 12:04:39,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:04:39,645 INFO L93 Difference]: Finished difference Result 383 states and 836 transitions. [2020-10-16 12:04:39,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 12:04:39,646 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2020-10-16 12:04:39,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:04:39,649 INFO L225 Difference]: With dead ends: 383 [2020-10-16 12:04:39,649 INFO L226 Difference]: Without dead ends: 361 [2020-10-16 12:04:39,649 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2020-10-16 12:04:39,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2020-10-16 12:04:39,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 311. [2020-10-16 12:04:39,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2020-10-16 12:04:39,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 703 transitions. [2020-10-16 12:04:39,664 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 703 transitions. Word has length 17 [2020-10-16 12:04:39,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:04:39,664 INFO L481 AbstractCegarLoop]: Abstraction has 311 states and 703 transitions. [2020-10-16 12:04:39,668 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 12:04:39,668 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 703 transitions. [2020-10-16 12:04:39,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-16 12:04:39,669 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:04:39,669 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:04:39,669 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 12:04:39,670 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:04:39,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:04:39,670 INFO L82 PathProgramCache]: Analyzing trace with hash -1789459351, now seen corresponding path program 2 times [2020-10-16 12:04:39,670 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:04:39,671 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969550092] [2020-10-16 12:04:39,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:04:39,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:04:39,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:04:39,820 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969550092] [2020-10-16 12:04:39,822 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:04:39,822 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 12:04:39,822 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16184128] [2020-10-16 12:04:39,823 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 12:04:39,823 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:04:39,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 12:04:39,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:04:39,824 INFO L87 Difference]: Start difference. First operand 311 states and 703 transitions. Second operand 6 states. [2020-10-16 12:04:39,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:04:39,881 INFO L93 Difference]: Finished difference Result 280 states and 638 transitions. [2020-10-16 12:04:39,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 12:04:39,881 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-10-16 12:04:39,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:04:39,883 INFO L225 Difference]: With dead ends: 280 [2020-10-16 12:04:39,883 INFO L226 Difference]: Without dead ends: 250 [2020-10-16 12:04:39,884 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-16 12:04:39,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2020-10-16 12:04:39,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 198. [2020-10-16 12:04:39,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2020-10-16 12:04:39,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 465 transitions. [2020-10-16 12:04:39,890 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 465 transitions. Word has length 17 [2020-10-16 12:04:39,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:04:39,891 INFO L481 AbstractCegarLoop]: Abstraction has 198 states and 465 transitions. [2020-10-16 12:04:39,891 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 12:04:39,891 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 465 transitions. [2020-10-16 12:04:39,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-16 12:04:39,892 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:04:39,892 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, 1] [2020-10-16 12:04:39,892 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 12:04:39,892 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:04:39,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:04:39,893 INFO L82 PathProgramCache]: Analyzing trace with hash 9332787, now seen corresponding path program 1 times [2020-10-16 12:04:39,893 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:04:39,893 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755615750] [2020-10-16 12:04:39,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:04:39,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:04:39,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:04:39,963 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755615750] [2020-10-16 12:04:39,964 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:04:39,964 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:04:39,964 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112368804] [2020-10-16 12:04:39,964 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 12:04:39,965 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:04:39,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 12:04:39,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 12:04:39,965 INFO L87 Difference]: Start difference. First operand 198 states and 465 transitions. Second operand 4 states. [2020-10-16 12:04:39,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:04:39,982 INFO L93 Difference]: Finished difference Result 264 states and 606 transitions. [2020-10-16 12:04:39,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 12:04:39,983 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2020-10-16 12:04:39,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:04:39,984 INFO L225 Difference]: With dead ends: 264 [2020-10-16 12:04:39,984 INFO L226 Difference]: Without dead ends: 110 [2020-10-16 12:04:39,984 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-10-16 12:04:39,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2020-10-16 12:04:39,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2020-10-16 12:04:39,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2020-10-16 12:04:39,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 225 transitions. [2020-10-16 12:04:39,988 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 225 transitions. Word has length 21 [2020-10-16 12:04:39,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:04:39,990 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 225 transitions. [2020-10-16 12:04:39,990 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 12:04:39,990 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 225 transitions. [2020-10-16 12:04:39,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-16 12:04:39,990 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:04:39,991 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, 1] [2020-10-16 12:04:39,991 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 12:04:39,991 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:04:39,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:04:39,991 INFO L82 PathProgramCache]: Analyzing trace with hash 702820371, now seen corresponding path program 2 times [2020-10-16 12:04:39,992 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:04:39,992 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535520090] [2020-10-16 12:04:39,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:04:40,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:04:40,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:04:40,419 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535520090] [2020-10-16 12:04:40,419 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:04:40,419 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-16 12:04:40,420 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507917853] [2020-10-16 12:04:40,421 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 12:04:40,421 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:04:40,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 12:04:40,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-16 12:04:40,422 INFO L87 Difference]: Start difference. First operand 110 states and 225 transitions. Second operand 9 states. [2020-10-16 12:04:40,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:04:40,795 INFO L93 Difference]: Finished difference Result 157 states and 309 transitions. [2020-10-16 12:04:40,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 12:04:40,796 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-10-16 12:04:40,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:04:40,797 INFO L225 Difference]: With dead ends: 157 [2020-10-16 12:04:40,797 INFO L226 Difference]: Without dead ends: 125 [2020-10-16 12:04:40,798 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2020-10-16 12:04:40,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2020-10-16 12:04:40,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 98. [2020-10-16 12:04:40,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2020-10-16 12:04:40,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 201 transitions. [2020-10-16 12:04:40,804 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 201 transitions. Word has length 21 [2020-10-16 12:04:40,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:04:40,804 INFO L481 AbstractCegarLoop]: Abstraction has 98 states and 201 transitions. [2020-10-16 12:04:40,804 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 12:04:40,804 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 201 transitions. [2020-10-16 12:04:40,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-16 12:04:40,805 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:04:40,805 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, 1] [2020-10-16 12:04:40,805 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 12:04:40,805 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:04:40,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:04:40,806 INFO L82 PathProgramCache]: Analyzing trace with hash -346290541, now seen corresponding path program 3 times [2020-10-16 12:04:40,808 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:04:40,809 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918954709] [2020-10-16 12:04:40,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:04:40,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 12:04:40,866 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 12:04:40,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 12:04:40,903 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 12:04:40,937 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 12:04:40,938 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 12:04:40,938 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-16 12:04:40,939 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-16 12:04:40,954 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1003] [1003] L2-->L825: Formula: (let ((.cse6 (= (mod ~x$r_buff0_thd0~0_In1103438004 256) 0)) (.cse7 (= (mod ~x$w_buff0_used~0_In1103438004 256) 0)) (.cse9 (= (mod ~x$w_buff1_used~0_In1103438004 256) 0)) (.cse8 (= (mod ~x$r_buff1_thd0~0_In1103438004 256) 0))) (let ((.cse0 (or .cse9 .cse8)) (.cse1 (not .cse9)) (.cse2 (not .cse8)) (.cse3 (or .cse6 .cse7)) (.cse4 (not .cse7)) (.cse5 (not .cse6))) (and (or (and (= ~x$w_buff1_used~0_In1103438004 ~x$w_buff1_used~0_Out1103438004) .cse0) (and .cse1 .cse2 (= ~x$w_buff1_used~0_Out1103438004 0))) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out1103438004 0)) (or (and .cse3 (or (and (= ~x~0_In1103438004 ~x~0_Out1103438004) .cse0) (and .cse1 .cse2 (= ~x$w_buff1~0_In1103438004 ~x~0_Out1103438004)))) (and .cse4 (= ~x$w_buff0~0_In1103438004 ~x~0_Out1103438004) .cse5)) (= ULTIMATE.start_assume_abort_if_not_~cond_Out1103438004 |ULTIMATE.start_assume_abort_if_not_#in~cond_In1103438004|) (= ~x$r_buff1_thd0~0_Out1103438004 ~x$r_buff1_thd0~0_In1103438004) (= ~x$r_buff0_thd0~0_In1103438004 ~x$r_buff0_thd0~0_Out1103438004) (or (and (= ~x$w_buff0_used~0_Out1103438004 ~x$w_buff0_used~0_In1103438004) .cse3) (and .cse4 (= ~x$w_buff0_used~0_Out1103438004 0) .cse5))))) InVars {~x$w_buff0~0=~x$w_buff0~0_In1103438004, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1103438004, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In1103438004|, ~x$w_buff1~0=~x$w_buff1~0_In1103438004, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1103438004, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1103438004, ~x~0=~x~0_In1103438004, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1103438004} OutVars{~x$w_buff0~0=~x$w_buff0~0_In1103438004, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_Out1103438004, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out1103438004|, ~x$w_buff1~0=~x$w_buff1~0_In1103438004, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out1103438004|, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out1103438004, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out1103438004|, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out1103438004|, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out1103438004|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out1103438004, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out1103438004, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out1103438004|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In1103438004|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out1103438004, ~x~0=~x~0_Out1103438004} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond, ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_#t~ite24, ~x$w_buff1_used~0, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite27, ~x$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2020-10-16 12:04:40,959 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:04:40,960 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:04:40,962 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:04:40,963 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:04:40,963 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:04:40,963 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:04:40,963 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:04:40,963 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:04:40,964 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:04:40,964 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:04:40,964 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:04:40,964 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:04:40,964 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:04:40,964 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:04:40,965 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:04:40,965 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:04:40,965 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:04:40,966 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:04:40,966 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:04:40,966 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:04:40,966 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:04:40,966 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:04:40,967 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:04:40,967 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:04:40,967 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:04:40,967 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:04:40,967 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:04:40,968 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:04:40,968 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:04:40,968 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:04:40,968 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:04:40,968 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:04:40,968 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:04:40,969 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:04:40,969 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:04:40,969 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:04:40,970 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:04:40,970 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:04:40,970 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:04:40,970 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:04:40,971 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:04:40,971 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:04:40,971 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:04:40,971 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:04:40,971 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:04:40,971 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:04:40,972 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:04:40,972 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:04:40,972 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:04:40,972 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:04:40,972 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:04:40,973 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:04:40,973 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:04:40,973 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:04:40,973 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:04:40,973 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:04:40,973 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:04:40,974 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:04:40,974 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:04:40,974 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:04:40,974 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:04:40,974 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:04:41,082 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 12:04:41 BasicIcfg [2020-10-16 12:04:41,085 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 12:04:41,087 INFO L168 Benchmark]: Toolchain (without parser) took 16142.06 ms. Allocated memory was 140.5 MB in the beginning and 394.3 MB in the end (delta: 253.8 MB). Free memory was 100.8 MB in the beginning and 351.1 MB in the end (delta: -250.3 MB). Peak memory consumption was 233.1 MB. Max. memory is 7.1 GB. [2020-10-16 12:04:41,088 INFO L168 Benchmark]: CDTParser took 0.44 ms. Allocated memory is still 140.5 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-10-16 12:04:41,088 INFO L168 Benchmark]: CACSL2BoogieTranslator took 777.38 ms. Allocated memory was 140.5 MB in the beginning and 202.9 MB in the end (delta: 62.4 MB). Free memory was 100.4 MB in the beginning and 156.5 MB in the end (delta: -56.1 MB). Peak memory consumption was 23.4 MB. Max. memory is 7.1 GB. [2020-10-16 12:04:41,089 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.69 ms. Allocated memory is still 202.9 MB. Free memory was 156.5 MB in the beginning and 153.3 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. [2020-10-16 12:04:41,090 INFO L168 Benchmark]: Boogie Preprocessor took 41.52 ms. Allocated memory is still 202.9 MB. Free memory was 153.3 MB in the beginning and 150.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2020-10-16 12:04:41,091 INFO L168 Benchmark]: RCFGBuilder took 2194.63 ms. Allocated memory was 202.9 MB in the beginning and 246.9 MB in the end (delta: 44.0 MB). Free memory was 150.7 MB in the beginning and 165.8 MB in the end (delta: -15.2 MB). Peak memory consumption was 102.1 MB. Max. memory is 7.1 GB. [2020-10-16 12:04:41,091 INFO L168 Benchmark]: TraceAbstraction took 13060.88 ms. Allocated memory was 246.9 MB in the beginning and 394.3 MB in the end (delta: 147.3 MB). Free memory was 164.1 MB in the beginning and 351.1 MB in the end (delta: -187.1 MB). Peak memory consumption was 190.0 MB. Max. memory is 7.1 GB. [2020-10-16 12:04:41,096 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.44 ms. Allocated memory is still 140.5 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 777.38 ms. Allocated memory was 140.5 MB in the beginning and 202.9 MB in the end (delta: 62.4 MB). Free memory was 100.4 MB in the beginning and 156.5 MB in the end (delta: -56.1 MB). Peak memory consumption was 23.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 61.69 ms. Allocated memory is still 202.9 MB. Free memory was 156.5 MB in the beginning and 153.3 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.52 ms. Allocated memory is still 202.9 MB. Free memory was 153.3 MB in the beginning and 150.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2194.63 ms. Allocated memory was 202.9 MB in the beginning and 246.9 MB in the end (delta: 44.0 MB). Free memory was 150.7 MB in the beginning and 165.8 MB in the end (delta: -15.2 MB). Peak memory consumption was 102.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13060.88 ms. Allocated memory was 246.9 MB in the beginning and 394.3 MB in the end (delta: 147.3 MB). Free memory was 164.1 MB in the beginning and 351.1 MB in the end (delta: -187.1 MB). Peak memory consumption was 190.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 846 VarBasedMoverChecksPositive, 33 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 70 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 8.5s, 101 PlacesBefore, 36 PlacesAfterwards, 93 TransitionsBefore, 26 TransitionsAfterwards, 1642 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 38 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 2 ChoiceCompositions, 77 TotalNumberOfCompositions, 4710 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L698] 0 int __unbuffered_cnt = 0; [L700] 0 int __unbuffered_p1_EAX = 0; [L702] 0 int __unbuffered_p2_EAX = 0; [L703] 0 _Bool main$tmp_guard0; [L704] 0 _Bool main$tmp_guard1; [L706] 0 int x = 0; [L707] 0 _Bool x$flush_delayed; [L708] 0 int x$mem_tmp; [L709] 0 _Bool x$r_buff0_thd0; [L710] 0 _Bool x$r_buff0_thd1; [L711] 0 _Bool x$r_buff0_thd2; [L712] 0 _Bool x$r_buff0_thd3; [L713] 0 _Bool x$r_buff1_thd0; [L714] 0 _Bool x$r_buff1_thd1; [L715] 0 _Bool x$r_buff1_thd2; [L716] 0 _Bool x$r_buff1_thd3; [L717] 0 _Bool x$read_delayed; [L718] 0 int *x$read_delayed_var; [L719] 0 int x$w_buff0; [L720] 0 _Bool x$w_buff0_used; [L721] 0 int x$w_buff1; [L722] 0 _Bool x$w_buff1_used; [L724] 0 int y = 0; [L726] 0 int z = 0; [L727] 0 _Bool weak$$choice0; [L728] 0 _Bool weak$$choice2; [L809] 0 pthread_t t1403; [L810] FCALL, FORK 0 pthread_create(&t1403, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L811] 0 pthread_t t1404; [L812] FCALL, FORK 0 pthread_create(&t1404, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L752] 2 x$w_buff1 = x$w_buff0 [L753] 2 x$w_buff0 = 2 [L754] 2 x$w_buff1_used = x$w_buff0_used [L755] 2 x$w_buff0_used = (_Bool)1 [L7] COND TRUE 2 !expression [L7] 2 __VERIFIER_error() [L757] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L758] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L759] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L760] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L761] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L764] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L813] 0 pthread_t t1405; [L814] FCALL, FORK 0 pthread_create(&t1405, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L781] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L784] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L732] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L735] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L767] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L767] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L767] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L767] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L768] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L768] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L769] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L769] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L770] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L770] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L771] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L771] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L774] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L776] 2 return 0; [L787] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L787] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L788] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L788] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L789] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L789] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L790] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L790] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L791] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L791] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L738] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L738] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L738] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L738] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L739] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L739] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L740] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L740] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L741] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L741] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L742] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L742] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L745] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L747] 1 return 0; [L794] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L796] 3 return 0; [L816] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L827] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L828] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L829] 0 x$flush_delayed = weak$$choice2 [L830] 0 x$mem_tmp = x [L831] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L831] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L832] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L832] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0) [L832] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0 [L832] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0) [L832] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L832] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L833] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L833] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L834] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L834] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L835] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L835] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L835] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L835] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L836] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L836] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0) [L836] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L836] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L837] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L837] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L837] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L837] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L838] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0) [L839] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L839] 0 x = x$flush_delayed ? x$mem_tmp : x [L840] 0 x$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 92 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 12.7s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.6s, HoareTripleCheckerStatistics: 309 SDtfs, 386 SDslu, 579 SDs, 0 SdLazy, 376 SolverSat, 124 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 60 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=822occurred 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, 172 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 181 NumberOfCodeBlocks, 181 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 148 ConstructedInterpolants, 0 QuantifiedInterpolants, 19471 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...