/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/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi001_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 07:03:44,659 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 07:03:44,662 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 07:03:44,673 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 07:03:44,674 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 07:03:44,675 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 07:03:44,677 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 07:03:44,680 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 07:03:44,683 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 07:03:44,686 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 07:03:44,688 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 07:03:44,696 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 07:03:44,696 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 07:03:44,697 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 07:03:44,699 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 07:03:44,701 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 07:03:44,703 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 07:03:44,704 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 07:03:44,707 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 07:03:44,709 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 07:03:44,711 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 07:03:44,714 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 07:03:44,715 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 07:03:44,717 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 07:03:44,720 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 07:03:44,720 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 07:03:44,721 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 07:03:44,722 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 07:03:44,723 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 07:03:44,725 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 07:03:44,725 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 07:03:44,726 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 07:03:44,727 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 07:03:44,728 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 07:03:44,730 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 07:03:44,731 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 07:03:44,732 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 07:03:44,732 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 07:03:44,732 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 07:03:44,734 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 07:03:44,735 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 07:03:44,736 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-27 07:03:44,756 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 07:03:44,756 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 07:03:44,757 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 07:03:44,758 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 07:03:44,758 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 07:03:44,758 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 07:03:44,758 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 07:03:44,759 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 07:03:44,761 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 07:03:44,761 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 07:03:44,761 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 07:03:44,761 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 07:03:44,762 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 07:03:44,762 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 07:03:44,762 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 07:03:44,762 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 07:03:44,762 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 07:03:44,763 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 07:03:44,763 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 07:03:44,763 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 07:03:44,763 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 07:03:44,763 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 07:03:44,765 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 07:03:44,765 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 07:03:44,765 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 07:03:44,765 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 07:03:44,766 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 07:03:44,766 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 07:03:44,766 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 07:03:44,766 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 07:03:45,043 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 07:03:45,060 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 07:03:45,063 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 07:03:45,065 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 07:03:45,065 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 07:03:45,066 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi001_power.oepc.i [2019-12-27 07:03:45,137 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2aca460af/02bd62e1150f4a6c956383839a1c769b/FLAGa49778ebd [2019-12-27 07:03:45,772 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 07:03:45,773 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi001_power.oepc.i [2019-12-27 07:03:45,787 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2aca460af/02bd62e1150f4a6c956383839a1c769b/FLAGa49778ebd [2019-12-27 07:03:46,046 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2aca460af/02bd62e1150f4a6c956383839a1c769b [2019-12-27 07:03:46,055 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 07:03:46,056 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 07:03:46,057 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 07:03:46,058 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 07:03:46,061 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 07:03:46,062 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:03:46" (1/1) ... [2019-12-27 07:03:46,065 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@409796a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:03:46, skipping insertion in model container [2019-12-27 07:03:46,065 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:03:46" (1/1) ... [2019-12-27 07:03:46,073 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 07:03:46,131 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 07:03:46,659 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 07:03:46,673 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 07:03:46,780 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 07:03:46,851 INFO L208 MainTranslator]: Completed translation [2019-12-27 07:03:46,851 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:03:46 WrapperNode [2019-12-27 07:03:46,851 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 07:03:46,852 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 07:03:46,852 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 07:03:46,852 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 07:03:46,862 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:03:46" (1/1) ... [2019-12-27 07:03:46,881 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:03:46" (1/1) ... [2019-12-27 07:03:46,914 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 07:03:46,914 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 07:03:46,914 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 07:03:46,914 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 07:03:46,923 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:03:46" (1/1) ... [2019-12-27 07:03:46,924 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:03:46" (1/1) ... [2019-12-27 07:03:46,929 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:03:46" (1/1) ... [2019-12-27 07:03:46,929 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:03:46" (1/1) ... [2019-12-27 07:03:46,943 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:03:46" (1/1) ... [2019-12-27 07:03:46,949 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:03:46" (1/1) ... [2019-12-27 07:03:46,953 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:03:46" (1/1) ... [2019-12-27 07:03:46,958 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 07:03:46,959 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 07:03:46,959 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 07:03:46,959 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 07:03:46,960 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:03:46" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 07:03:47,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 07:03:47,060 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 07:03:47,060 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 07:03:47,060 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 07:03:47,061 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 07:03:47,061 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 07:03:47,062 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 07:03:47,062 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 07:03:47,062 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 07:03:47,062 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 07:03:47,062 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 07:03:47,064 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 07:03:47,746 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 07:03:47,747 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 07:03:47,748 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:03:47 BoogieIcfgContainer [2019-12-27 07:03:47,749 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 07:03:47,750 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 07:03:47,750 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 07:03:47,754 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 07:03:47,754 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 07:03:46" (1/3) ... [2019-12-27 07:03:47,755 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@122ab7d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:03:47, skipping insertion in model container [2019-12-27 07:03:47,755 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:03:46" (2/3) ... [2019-12-27 07:03:47,756 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@122ab7d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:03:47, skipping insertion in model container [2019-12-27 07:03:47,756 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:03:47" (3/3) ... [2019-12-27 07:03:47,758 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi001_power.oepc.i [2019-12-27 07:03:47,768 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 07:03:47,768 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 07:03:47,775 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 07:03:47,776 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 07:03:47,822 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,823 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,823 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,823 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,823 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,824 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,824 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,824 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,826 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,827 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,827 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,827 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,828 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,828 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,828 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,828 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,829 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,829 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,830 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,830 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,830 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,830 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,831 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,831 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,831 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,831 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,832 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,832 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,832 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,833 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,833 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,833 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,833 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,834 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,839 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,839 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,852 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,852 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,852 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,852 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,858 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,858 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,858 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,858 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,858 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,859 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,859 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,859 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,860 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,860 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,860 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,860 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,861 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,861 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,861 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,861 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,861 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,862 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,862 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,862 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,862 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,864 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,864 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,864 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,864 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,865 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,886 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,886 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,886 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,887 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,887 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,887 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,887 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,888 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,888 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,888 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,888 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,888 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,888 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,893 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,893 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,893 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,893 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,893 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,894 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,894 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,894 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,894 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,901 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,904 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:47,919 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 07:03:47,938 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 07:03:47,939 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 07:03:47,939 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 07:03:47,939 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 07:03:47,939 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 07:03:47,939 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 07:03:47,939 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 07:03:47,940 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 07:03:47,956 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 182 transitions [2019-12-27 07:03:47,958 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-27 07:03:48,047 INFO L132 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-27 07:03:48,047 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 07:03:48,063 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 350 event pairs. 0/137 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 07:03:48,082 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-27 07:03:48,171 INFO L132 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-27 07:03:48,172 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 07:03:48,180 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 350 event pairs. 0/137 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 07:03:48,202 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-27 07:03:48,204 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 07:03:51,328 WARN L192 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-27 07:03:51,439 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-27 07:03:51,471 INFO L206 etLargeBlockEncoding]: Checked pairs total: 49085 [2019-12-27 07:03:51,471 INFO L214 etLargeBlockEncoding]: Total number of compositions: 102 [2019-12-27 07:03:51,475 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 76 places, 87 transitions [2019-12-27 07:03:51,976 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8066 states. [2019-12-27 07:03:51,979 INFO L276 IsEmpty]: Start isEmpty. Operand 8066 states. [2019-12-27 07:03:51,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 07:03:51,985 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:03:51,986 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 07:03:51,987 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:03:51,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:03:51,993 INFO L82 PathProgramCache]: Analyzing trace with hash 791333, now seen corresponding path program 1 times [2019-12-27 07:03:52,004 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:03:52,004 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263537670] [2019-12-27 07:03:52,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:03:52,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:03:52,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:03:52,199 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263537670] [2019-12-27 07:03:52,200 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:03:52,200 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 07:03:52,201 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263727771] [2019-12-27 07:03:52,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:03:52,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:03:52,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:03:52,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:03:52,224 INFO L87 Difference]: Start difference. First operand 8066 states. Second operand 3 states. [2019-12-27 07:03:52,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:03:52,502 INFO L93 Difference]: Finished difference Result 7932 states and 26018 transitions. [2019-12-27 07:03:52,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:03:52,504 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 07:03:52,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:03:52,583 INFO L225 Difference]: With dead ends: 7932 [2019-12-27 07:03:52,583 INFO L226 Difference]: Without dead ends: 7440 [2019-12-27 07:03:52,584 INFO L631 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 [2019-12-27 07:03:52,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7440 states. [2019-12-27 07:03:52,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7440 to 7440. [2019-12-27 07:03:52,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7440 states. [2019-12-27 07:03:53,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7440 states to 7440 states and 24357 transitions. [2019-12-27 07:03:53,112 INFO L78 Accepts]: Start accepts. Automaton has 7440 states and 24357 transitions. Word has length 3 [2019-12-27 07:03:53,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:03:53,112 INFO L462 AbstractCegarLoop]: Abstraction has 7440 states and 24357 transitions. [2019-12-27 07:03:53,112 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:03:53,113 INFO L276 IsEmpty]: Start isEmpty. Operand 7440 states and 24357 transitions. [2019-12-27 07:03:53,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 07:03:53,118 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:03:53,118 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:03:53,119 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:03:53,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:03:53,119 INFO L82 PathProgramCache]: Analyzing trace with hash 912855206, now seen corresponding path program 1 times [2019-12-27 07:03:53,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:03:53,120 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892912766] [2019-12-27 07:03:53,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:03:53,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:03:53,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:03:53,212 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892912766] [2019-12-27 07:03:53,212 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:03:53,212 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:03:53,212 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281468765] [2019-12-27 07:03:53,214 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:03:53,215 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:03:53,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:03:53,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:03:53,215 INFO L87 Difference]: Start difference. First operand 7440 states and 24357 transitions. Second operand 3 states. [2019-12-27 07:03:53,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:03:53,256 INFO L93 Difference]: Finished difference Result 1230 states and 2824 transitions. [2019-12-27 07:03:53,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:03:53,256 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-27 07:03:53,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:03:53,264 INFO L225 Difference]: With dead ends: 1230 [2019-12-27 07:03:53,264 INFO L226 Difference]: Without dead ends: 1230 [2019-12-27 07:03:53,265 INFO L631 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 [2019-12-27 07:03:53,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2019-12-27 07:03:53,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 1230. [2019-12-27 07:03:53,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1230 states. [2019-12-27 07:03:53,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 1230 states and 2824 transitions. [2019-12-27 07:03:53,298 INFO L78 Accepts]: Start accepts. Automaton has 1230 states and 2824 transitions. Word has length 11 [2019-12-27 07:03:53,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:03:53,298 INFO L462 AbstractCegarLoop]: Abstraction has 1230 states and 2824 transitions. [2019-12-27 07:03:53,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:03:53,299 INFO L276 IsEmpty]: Start isEmpty. Operand 1230 states and 2824 transitions. [2019-12-27 07:03:53,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 07:03:53,300 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:03:53,300 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:03:53,301 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:03:53,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:03:53,301 INFO L82 PathProgramCache]: Analyzing trace with hash 124584310, now seen corresponding path program 1 times [2019-12-27 07:03:53,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:03:53,302 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403548551] [2019-12-27 07:03:53,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:03:53,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:03:53,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:03:53,373 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403548551] [2019-12-27 07:03:53,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:03:53,374 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:03:53,374 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32339119] [2019-12-27 07:03:53,374 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:03:53,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:03:53,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:03:53,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:03:53,375 INFO L87 Difference]: Start difference. First operand 1230 states and 2824 transitions. Second operand 3 states. [2019-12-27 07:03:53,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:03:53,442 INFO L93 Difference]: Finished difference Result 1956 states and 4348 transitions. [2019-12-27 07:03:53,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:03:53,443 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-27 07:03:53,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:03:53,455 INFO L225 Difference]: With dead ends: 1956 [2019-12-27 07:03:53,455 INFO L226 Difference]: Without dead ends: 1956 [2019-12-27 07:03:53,456 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:03:53,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1956 states. [2019-12-27 07:03:53,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1956 to 1356. [2019-12-27 07:03:53,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1356 states. [2019-12-27 07:03:53,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1356 states to 1356 states and 3081 transitions. [2019-12-27 07:03:53,508 INFO L78 Accepts]: Start accepts. Automaton has 1356 states and 3081 transitions. Word has length 14 [2019-12-27 07:03:53,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:03:53,508 INFO L462 AbstractCegarLoop]: Abstraction has 1356 states and 3081 transitions. [2019-12-27 07:03:53,509 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:03:53,509 INFO L276 IsEmpty]: Start isEmpty. Operand 1356 states and 3081 transitions. [2019-12-27 07:03:53,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 07:03:53,510 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:03:53,510 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:03:53,511 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:03:53,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:03:53,511 INFO L82 PathProgramCache]: Analyzing trace with hash 35390056, now seen corresponding path program 1 times [2019-12-27 07:03:53,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:03:53,511 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599102705] [2019-12-27 07:03:53,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:03:53,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:03:53,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:03:53,579 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599102705] [2019-12-27 07:03:53,579 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:03:53,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:03:53,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676661768] [2019-12-27 07:03:53,580 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:03:53,582 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:03:53,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:03:53,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:03:53,583 INFO L87 Difference]: Start difference. First operand 1356 states and 3081 transitions. Second operand 4 states. [2019-12-27 07:03:53,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:03:53,761 INFO L93 Difference]: Finished difference Result 1678 states and 3739 transitions. [2019-12-27 07:03:53,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:03:53,761 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 07:03:53,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:03:53,771 INFO L225 Difference]: With dead ends: 1678 [2019-12-27 07:03:53,771 INFO L226 Difference]: Without dead ends: 1678 [2019-12-27 07:03:53,772 INFO L631 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 [2019-12-27 07:03:53,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1678 states. [2019-12-27 07:03:53,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1678 to 1618. [2019-12-27 07:03:53,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1618 states. [2019-12-27 07:03:53,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1618 states to 1618 states and 3623 transitions. [2019-12-27 07:03:53,827 INFO L78 Accepts]: Start accepts. Automaton has 1618 states and 3623 transitions. Word has length 14 [2019-12-27 07:03:53,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:03:53,827 INFO L462 AbstractCegarLoop]: Abstraction has 1618 states and 3623 transitions. [2019-12-27 07:03:53,828 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:03:53,828 INFO L276 IsEmpty]: Start isEmpty. Operand 1618 states and 3623 transitions. [2019-12-27 07:03:53,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 07:03:53,829 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:03:53,829 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:03:53,829 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:03:53,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:03:53,830 INFO L82 PathProgramCache]: Analyzing trace with hash 801099966, now seen corresponding path program 1 times [2019-12-27 07:03:53,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:03:53,831 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47724242] [2019-12-27 07:03:53,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:03:53,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:03:53,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:03:53,920 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47724242] [2019-12-27 07:03:53,920 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:03:53,920 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:03:53,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062704976] [2019-12-27 07:03:53,921 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:03:53,921 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:03:53,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:03:53,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:03:53,922 INFO L87 Difference]: Start difference. First operand 1618 states and 3623 transitions. Second operand 4 states. [2019-12-27 07:03:54,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:03:54,091 INFO L93 Difference]: Finished difference Result 1981 states and 4398 transitions. [2019-12-27 07:03:54,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:03:54,092 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 07:03:54,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:03:54,103 INFO L225 Difference]: With dead ends: 1981 [2019-12-27 07:03:54,103 INFO L226 Difference]: Without dead ends: 1981 [2019-12-27 07:03:54,104 INFO L631 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 [2019-12-27 07:03:54,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1981 states. [2019-12-27 07:03:54,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1981 to 1706. [2019-12-27 07:03:54,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1706 states. [2019-12-27 07:03:54,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1706 states to 1706 states and 3834 transitions. [2019-12-27 07:03:54,153 INFO L78 Accepts]: Start accepts. Automaton has 1706 states and 3834 transitions. Word has length 14 [2019-12-27 07:03:54,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:03:54,153 INFO L462 AbstractCegarLoop]: Abstraction has 1706 states and 3834 transitions. [2019-12-27 07:03:54,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:03:54,154 INFO L276 IsEmpty]: Start isEmpty. Operand 1706 states and 3834 transitions. [2019-12-27 07:03:54,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 07:03:54,156 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:03:54,157 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:03:54,157 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:03:54,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:03:54,157 INFO L82 PathProgramCache]: Analyzing trace with hash -738044695, now seen corresponding path program 1 times [2019-12-27 07:03:54,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:03:54,158 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116742029] [2019-12-27 07:03:54,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:03:54,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:03:54,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:03:54,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116742029] [2019-12-27 07:03:54,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:03:54,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:03:54,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010459153] [2019-12-27 07:03:54,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:03:54,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:03:54,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:03:54,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:03:54,257 INFO L87 Difference]: Start difference. First operand 1706 states and 3834 transitions. Second operand 5 states. [2019-12-27 07:03:54,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:03:54,564 INFO L93 Difference]: Finished difference Result 2240 states and 4897 transitions. [2019-12-27 07:03:54,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 07:03:54,564 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 07:03:54,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:03:54,580 INFO L225 Difference]: With dead ends: 2240 [2019-12-27 07:03:54,584 INFO L226 Difference]: Without dead ends: 2240 [2019-12-27 07:03:54,584 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:03:54,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2240 states. [2019-12-27 07:03:54,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2240 to 1991. [2019-12-27 07:03:54,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1991 states. [2019-12-27 07:03:54,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1991 states to 1991 states and 4418 transitions. [2019-12-27 07:03:54,633 INFO L78 Accepts]: Start accepts. Automaton has 1991 states and 4418 transitions. Word has length 25 [2019-12-27 07:03:54,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:03:54,633 INFO L462 AbstractCegarLoop]: Abstraction has 1991 states and 4418 transitions. [2019-12-27 07:03:54,634 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:03:54,634 INFO L276 IsEmpty]: Start isEmpty. Operand 1991 states and 4418 transitions. [2019-12-27 07:03:54,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 07:03:54,636 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:03:54,637 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:03:54,637 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:03:54,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:03:54,637 INFO L82 PathProgramCache]: Analyzing trace with hash 602591181, now seen corresponding path program 1 times [2019-12-27 07:03:54,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:03:54,638 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851681671] [2019-12-27 07:03:54,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:03:54,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:03:54,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:03:54,684 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851681671] [2019-12-27 07:03:54,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:03:54,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:03:54,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451033252] [2019-12-27 07:03:54,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:03:54,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:03:54,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:03:54,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:03:54,686 INFO L87 Difference]: Start difference. First operand 1991 states and 4418 transitions. Second operand 3 states. [2019-12-27 07:03:54,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:03:54,733 INFO L93 Difference]: Finished difference Result 2574 states and 5503 transitions. [2019-12-27 07:03:54,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:03:54,733 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-12-27 07:03:54,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:03:54,741 INFO L225 Difference]: With dead ends: 2574 [2019-12-27 07:03:54,741 INFO L226 Difference]: Without dead ends: 2574 [2019-12-27 07:03:54,741 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:03:54,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2574 states. [2019-12-27 07:03:54,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2574 to 1963. [2019-12-27 07:03:54,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1963 states. [2019-12-27 07:03:54,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1963 states to 1963 states and 4214 transitions. [2019-12-27 07:03:54,791 INFO L78 Accepts]: Start accepts. Automaton has 1963 states and 4214 transitions. Word has length 25 [2019-12-27 07:03:54,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:03:54,792 INFO L462 AbstractCegarLoop]: Abstraction has 1963 states and 4214 transitions. [2019-12-27 07:03:54,792 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:03:54,792 INFO L276 IsEmpty]: Start isEmpty. Operand 1963 states and 4214 transitions. [2019-12-27 07:03:54,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 07:03:54,794 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:03:54,794 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:03:54,795 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:03:54,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:03:54,795 INFO L82 PathProgramCache]: Analyzing trace with hash -2104804157, now seen corresponding path program 1 times [2019-12-27 07:03:54,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:03:54,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746228322] [2019-12-27 07:03:54,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:03:54,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:03:54,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:03:54,844 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746228322] [2019-12-27 07:03:54,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:03:54,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:03:54,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157874357] [2019-12-27 07:03:54,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:03:54,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:03:54,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:03:54,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:03:54,846 INFO L87 Difference]: Start difference. First operand 1963 states and 4214 transitions. Second operand 4 states. [2019-12-27 07:03:54,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:03:54,861 INFO L93 Difference]: Finished difference Result 1053 states and 2169 transitions. [2019-12-27 07:03:54,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 07:03:54,861 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2019-12-27 07:03:54,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:03:54,865 INFO L225 Difference]: With dead ends: 1053 [2019-12-27 07:03:54,865 INFO L226 Difference]: Without dead ends: 1053 [2019-12-27 07:03:54,865 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:03:54,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1053 states. [2019-12-27 07:03:54,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1053 to 995. [2019-12-27 07:03:54,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 995 states. [2019-12-27 07:03:54,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 2062 transitions. [2019-12-27 07:03:54,886 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 2062 transitions. Word has length 26 [2019-12-27 07:03:54,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:03:54,887 INFO L462 AbstractCegarLoop]: Abstraction has 995 states and 2062 transitions. [2019-12-27 07:03:54,887 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:03:54,887 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 2062 transitions. [2019-12-27 07:03:54,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 07:03:54,889 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:03:54,889 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:03:54,889 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:03:54,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:03:54,890 INFO L82 PathProgramCache]: Analyzing trace with hash -134458557, now seen corresponding path program 1 times [2019-12-27 07:03:54,890 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:03:54,890 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675755214] [2019-12-27 07:03:54,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:03:54,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:03:54,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:03:54,958 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675755214] [2019-12-27 07:03:54,958 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:03:54,958 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:03:54,959 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120343043] [2019-12-27 07:03:54,959 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:03:54,959 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:03:54,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:03:54,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:03:54,960 INFO L87 Difference]: Start difference. First operand 995 states and 2062 transitions. Second operand 5 states. [2019-12-27 07:03:55,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:03:55,152 INFO L93 Difference]: Finished difference Result 1129 states and 2304 transitions. [2019-12-27 07:03:55,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 07:03:55,152 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-27 07:03:55,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:03:55,155 INFO L225 Difference]: With dead ends: 1129 [2019-12-27 07:03:55,155 INFO L226 Difference]: Without dead ends: 1129 [2019-12-27 07:03:55,155 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:03:55,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1129 states. [2019-12-27 07:03:55,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1129 to 904. [2019-12-27 07:03:55,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 904 states. [2019-12-27 07:03:55,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1874 transitions. [2019-12-27 07:03:55,175 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1874 transitions. Word has length 26 [2019-12-27 07:03:55,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:03:55,175 INFO L462 AbstractCegarLoop]: Abstraction has 904 states and 1874 transitions. [2019-12-27 07:03:55,176 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:03:55,176 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1874 transitions. [2019-12-27 07:03:55,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 07:03:55,178 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:03:55,178 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:03:55,179 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:03:55,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:03:55,179 INFO L82 PathProgramCache]: Analyzing trace with hash 830310095, now seen corresponding path program 1 times [2019-12-27 07:03:55,179 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:03:55,179 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240729297] [2019-12-27 07:03:55,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:03:55,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:03:55,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:03:55,233 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240729297] [2019-12-27 07:03:55,233 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:03:55,233 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:03:55,233 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083796634] [2019-12-27 07:03:55,234 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:03:55,234 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:03:55,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:03:55,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:03:55,234 INFO L87 Difference]: Start difference. First operand 904 states and 1874 transitions. Second operand 3 states. [2019-12-27 07:03:55,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:03:55,246 INFO L93 Difference]: Finished difference Result 1410 states and 2964 transitions. [2019-12-27 07:03:55,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:03:55,246 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-27 07:03:55,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:03:55,248 INFO L225 Difference]: With dead ends: 1410 [2019-12-27 07:03:55,248 INFO L226 Difference]: Without dead ends: 548 [2019-12-27 07:03:55,249 INFO L631 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 [2019-12-27 07:03:55,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2019-12-27 07:03:55,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 548. [2019-12-27 07:03:55,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 548 states. [2019-12-27 07:03:55,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 1169 transitions. [2019-12-27 07:03:55,260 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 1169 transitions. Word has length 51 [2019-12-27 07:03:55,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:03:55,261 INFO L462 AbstractCegarLoop]: Abstraction has 548 states and 1169 transitions. [2019-12-27 07:03:55,261 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:03:55,261 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 1169 transitions. [2019-12-27 07:03:55,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 07:03:55,263 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:03:55,263 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:03:55,263 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:03:55,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:03:55,263 INFO L82 PathProgramCache]: Analyzing trace with hash 365260025, now seen corresponding path program 2 times [2019-12-27 07:03:55,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:03:55,264 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161898347] [2019-12-27 07:03:55,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:03:55,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:03:55,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:03:55,353 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161898347] [2019-12-27 07:03:55,353 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:03:55,353 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 07:03:55,353 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500286551] [2019-12-27 07:03:55,354 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 07:03:55,354 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:03:55,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 07:03:55,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:03:55,354 INFO L87 Difference]: Start difference. First operand 548 states and 1169 transitions. Second operand 7 states. [2019-12-27 07:03:55,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:03:55,604 INFO L93 Difference]: Finished difference Result 1122 states and 2322 transitions. [2019-12-27 07:03:55,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 07:03:55,604 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-12-27 07:03:55,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:03:55,607 INFO L225 Difference]: With dead ends: 1122 [2019-12-27 07:03:55,607 INFO L226 Difference]: Without dead ends: 775 [2019-12-27 07:03:55,607 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-27 07:03:55,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2019-12-27 07:03:55,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 613. [2019-12-27 07:03:55,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 613 states. [2019-12-27 07:03:55,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 1276 transitions. [2019-12-27 07:03:55,621 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 1276 transitions. Word has length 51 [2019-12-27 07:03:55,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:03:55,621 INFO L462 AbstractCegarLoop]: Abstraction has 613 states and 1276 transitions. [2019-12-27 07:03:55,621 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 07:03:55,621 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 1276 transitions. [2019-12-27 07:03:55,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 07:03:55,623 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:03:55,623 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:03:55,624 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:03:55,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:03:55,624 INFO L82 PathProgramCache]: Analyzing trace with hash 372470905, now seen corresponding path program 3 times [2019-12-27 07:03:55,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:03:55,624 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489991600] [2019-12-27 07:03:55,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:03:55,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:03:55,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:03:55,726 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489991600] [2019-12-27 07:03:55,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:03:55,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:03:55,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032704245] [2019-12-27 07:03:55,727 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:03:55,727 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:03:55,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:03:55,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:03:55,727 INFO L87 Difference]: Start difference. First operand 613 states and 1276 transitions. Second operand 3 states. [2019-12-27 07:03:55,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:03:55,775 INFO L93 Difference]: Finished difference Result 758 states and 1575 transitions. [2019-12-27 07:03:55,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:03:55,775 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-27 07:03:55,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:03:55,777 INFO L225 Difference]: With dead ends: 758 [2019-12-27 07:03:55,777 INFO L226 Difference]: Without dead ends: 758 [2019-12-27 07:03:55,779 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:03:55,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2019-12-27 07:03:55,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 670. [2019-12-27 07:03:55,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 670 states. [2019-12-27 07:03:55,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 1399 transitions. [2019-12-27 07:03:55,792 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 1399 transitions. Word has length 51 [2019-12-27 07:03:55,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:03:55,793 INFO L462 AbstractCegarLoop]: Abstraction has 670 states and 1399 transitions. [2019-12-27 07:03:55,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:03:55,793 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 1399 transitions. [2019-12-27 07:03:55,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 07:03:55,796 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:03:55,796 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:03:55,797 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:03:55,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:03:55,797 INFO L82 PathProgramCache]: Analyzing trace with hash 679432093, now seen corresponding path program 1 times [2019-12-27 07:03:55,797 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:03:55,797 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821474343] [2019-12-27 07:03:55,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:03:55,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:03:55,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:03:55,982 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821474343] [2019-12-27 07:03:55,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:03:55,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 07:03:55,983 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014106844] [2019-12-27 07:03:55,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 07:03:55,984 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:03:55,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 07:03:55,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:03:55,985 INFO L87 Difference]: Start difference. First operand 670 states and 1399 transitions. Second operand 7 states. [2019-12-27 07:03:56,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:03:56,726 INFO L93 Difference]: Finished difference Result 1152 states and 2340 transitions. [2019-12-27 07:03:56,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 07:03:56,727 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-12-27 07:03:56,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:03:56,731 INFO L225 Difference]: With dead ends: 1152 [2019-12-27 07:03:56,731 INFO L226 Difference]: Without dead ends: 1128 [2019-12-27 07:03:56,732 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-12-27 07:03:56,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1128 states. [2019-12-27 07:03:56,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1128 to 1039. [2019-12-27 07:03:56,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1039 states. [2019-12-27 07:03:56,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1039 states to 1039 states and 2123 transitions. [2019-12-27 07:03:56,752 INFO L78 Accepts]: Start accepts. Automaton has 1039 states and 2123 transitions. Word has length 52 [2019-12-27 07:03:56,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:03:56,753 INFO L462 AbstractCegarLoop]: Abstraction has 1039 states and 2123 transitions. [2019-12-27 07:03:56,753 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 07:03:56,753 INFO L276 IsEmpty]: Start isEmpty. Operand 1039 states and 2123 transitions. [2019-12-27 07:03:56,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 07:03:56,756 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:03:56,756 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:03:56,756 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:03:56,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:03:56,756 INFO L82 PathProgramCache]: Analyzing trace with hash 292599181, now seen corresponding path program 1 times [2019-12-27 07:03:56,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:03:56,757 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619385360] [2019-12-27 07:03:56,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:03:56,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:03:56,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:03:56,870 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619385360] [2019-12-27 07:03:56,870 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:03:56,870 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 07:03:56,871 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932296275] [2019-12-27 07:03:56,871 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 07:03:56,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:03:56,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 07:03:56,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 07:03:56,872 INFO L87 Difference]: Start difference. First operand 1039 states and 2123 transitions. Second operand 6 states. [2019-12-27 07:03:57,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:03:57,405 INFO L93 Difference]: Finished difference Result 1291 states and 2597 transitions. [2019-12-27 07:03:57,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 07:03:57,405 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-12-27 07:03:57,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:03:57,409 INFO L225 Difference]: With dead ends: 1291 [2019-12-27 07:03:57,409 INFO L226 Difference]: Without dead ends: 1291 [2019-12-27 07:03:57,410 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 07:03:57,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1291 states. [2019-12-27 07:03:57,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1291 to 1075. [2019-12-27 07:03:57,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1075 states. [2019-12-27 07:03:57,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1075 states to 1075 states and 2189 transitions. [2019-12-27 07:03:57,483 INFO L78 Accepts]: Start accepts. Automaton has 1075 states and 2189 transitions. Word has length 52 [2019-12-27 07:03:57,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:03:57,483 INFO L462 AbstractCegarLoop]: Abstraction has 1075 states and 2189 transitions. [2019-12-27 07:03:57,483 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 07:03:57,483 INFO L276 IsEmpty]: Start isEmpty. Operand 1075 states and 2189 transitions. [2019-12-27 07:03:57,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 07:03:57,486 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:03:57,486 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:03:57,486 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:03:57,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:03:57,487 INFO L82 PathProgramCache]: Analyzing trace with hash -267803227, now seen corresponding path program 2 times [2019-12-27 07:03:57,487 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:03:57,487 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040486692] [2019-12-27 07:03:57,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:03:57,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:03:57,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:03:57,554 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040486692] [2019-12-27 07:03:57,554 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:03:57,554 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:03:57,554 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072618972] [2019-12-27 07:03:57,555 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:03:57,555 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:03:57,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:03:57,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:03:57,556 INFO L87 Difference]: Start difference. First operand 1075 states and 2189 transitions. Second operand 3 states. [2019-12-27 07:03:57,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:03:57,572 INFO L93 Difference]: Finished difference Result 1075 states and 2188 transitions. [2019-12-27 07:03:57,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:03:57,573 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 07:03:57,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:03:57,575 INFO L225 Difference]: With dead ends: 1075 [2019-12-27 07:03:57,576 INFO L226 Difference]: Without dead ends: 1075 [2019-12-27 07:03:57,576 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:03:57,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1075 states. [2019-12-27 07:03:57,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1075 to 826. [2019-12-27 07:03:57,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 826 states. [2019-12-27 07:03:57,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 826 states to 826 states and 1719 transitions. [2019-12-27 07:03:57,597 INFO L78 Accepts]: Start accepts. Automaton has 826 states and 1719 transitions. Word has length 52 [2019-12-27 07:03:57,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:03:57,598 INFO L462 AbstractCegarLoop]: Abstraction has 826 states and 1719 transitions. [2019-12-27 07:03:57,598 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:03:57,598 INFO L276 IsEmpty]: Start isEmpty. Operand 826 states and 1719 transitions. [2019-12-27 07:03:57,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 07:03:57,601 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:03:57,601 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:03:57,601 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:03:57,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:03:57,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1093323660, now seen corresponding path program 1 times [2019-12-27 07:03:57,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:03:57,602 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454851151] [2019-12-27 07:03:57,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:03:57,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 07:03:57,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 07:03:57,743 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 07:03:57,744 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 07:03:57,748 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] ULTIMATE.startENTRY-->L802: Formula: (let ((.cse0 (store |v_#valid_48| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= v_~main$tmp_guard1~0_17 0) (= v_~main$tmp_guard0~0_10 0) (= 0 |v_ULTIMATE.start_main_~#t1601~0.offset_18|) (= 0 v_~x$read_delayed_var~0.offset_6) (= v_~x$r_buff1_thd0~0_27 0) (= 0 v_~weak$$choice0~0_8) (= 0 v_~x$w_buff1~0_22) (= v_~y~0_18 0) (= 0 v_~__unbuffered_p1_EAX~0_15) (= |v_#NULL.offset_6| 0) (= v_~__unbuffered_p1_EBX~0_15 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1601~0.base_23| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1601~0.base_23|) |v_ULTIMATE.start_main_~#t1601~0.offset_18| 0)) |v_#memory_int_11|) (= 0 v_~x$w_buff0_used~0_100) (= |v_#valid_46| (store .cse0 |v_ULTIMATE.start_main_~#t1601~0.base_23| 1)) (= 0 v_~x$w_buff0~0_23) (= 0 v_~x$r_buff0_thd0~0_19) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1601~0.base_23| 4)) (= 0 v_~x$r_buff0_thd2~0_78) (< 0 |v_#StackHeapBarrier_15|) (= 0 v_~x$read_delayed~0_6) (= v_~x$r_buff1_thd2~0_49 0) (= v_~x$mem_tmp~0_8 0) (= 0 v_~x$r_buff0_thd1~0_27) (= 0 |v_#NULL.base_6|) (= v_~x$r_buff1_thd1~0_21 0) (= v_~x$flush_delayed~0_11 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1601~0.base_23|)) (= 0 v_~weak$$choice2~0_35) (= v_~x~0_22 0) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t1601~0.base_23|) (= v_~x$w_buff1_used~0_64 0) (= 0 v_~z~0_8) (= 0 v_~__unbuffered_cnt~0_16))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_12|, #length=|v_#length_20|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_23, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_27, ULTIMATE.start_main_~#t1602~0.base=|v_ULTIMATE.start_main_~#t1602~0.base_22|, ~x$flush_delayed~0=v_~x$flush_delayed~0_11, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~x$mem_tmp~0=v_~x$mem_tmp~0_8, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_11|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_11|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_24|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_11|, ULTIMATE.start_main_~#t1601~0.base=|v_ULTIMATE.start_main_~#t1601~0.base_23|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_15, #length=|v_#length_19|, ULTIMATE.start_main_~#t1601~0.offset=|v_ULTIMATE.start_main_~#t1601~0.offset_18|, ~y~0=v_~y~0_18, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_19, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_15, ~x$w_buff1~0=v_~x$w_buff1~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_64, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_49, ULTIMATE.start_main_~#t1602~0.offset=|v_ULTIMATE.start_main_~#t1602~0.offset_16|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_27, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_78, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, #NULL.base=|v_#NULL.base_6|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_100, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_13|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_9|, ~z~0=v_~z~0_8, ~weak$$choice2~0=v_~weak$$choice2~0_35, ~x~0=v_~x~0_22, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_~#t1602~0.base, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t1601~0.base, ~__unbuffered_p1_EAX~0, #length, ULTIMATE.start_main_~#t1601~0.offset, ~y~0, ~x$r_buff0_thd0~0, ~__unbuffered_p1_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_~#t1602~0.offset, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 07:03:57,749 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L802-1-->L804: Formula: (and (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1602~0.base_11| 1)) (= (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t1602~0.base_11| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t1602~0.base_11|) |v_ULTIMATE.start_main_~#t1602~0.offset_10| 1)) |v_#memory_int_5|) (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1602~0.base_11|)) (= 0 |v_ULTIMATE.start_main_~#t1602~0.offset_10|) (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t1602~0.base_11| 4) |v_#length_11|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1602~0.base_11|) (not (= |v_ULTIMATE.start_main_~#t1602~0.base_11| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_6|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t1602~0.base=|v_ULTIMATE.start_main_~#t1602~0.base_11|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_6|, #length=|v_#length_11|, ULTIMATE.start_main_~#t1602~0.offset=|v_ULTIMATE.start_main_~#t1602~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1602~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t1602~0.offset] because there is no mapped edge [2019-12-27 07:03:57,750 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L4-->L740: Formula: (and (= ~x$r_buff1_thd2~0_Out-1370789655 ~x$r_buff0_thd2~0_In-1370789655) (= ~x$r_buff0_thd1~0_In-1370789655 ~x$r_buff1_thd1~0_Out-1370789655) (= ~x$r_buff1_thd0~0_Out-1370789655 ~x$r_buff0_thd0~0_In-1370789655) (= ~y~0_Out-1370789655 1) (= ~x$r_buff0_thd1~0_Out-1370789655 1) (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-1370789655))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1370789655, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1370789655, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-1370789655, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1370789655} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1370789655, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_Out-1370789655, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-1370789655, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_Out-1370789655, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_Out-1370789655, ~y~0=~y~0_Out-1370789655, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1370789655, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out-1370789655} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 07:03:57,753 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L741-->L741-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In863708 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd1~0_In863708 256) 0))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite5_Out863708|) (not .cse0) (not .cse1)) (and (= ~x$w_buff0_used~0_In863708 |P0Thread1of1ForFork0_#t~ite5_Out863708|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In863708, ~x$w_buff0_used~0=~x$w_buff0_used~0_In863708} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out863708|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In863708, ~x$w_buff0_used~0=~x$w_buff0_used~0_In863708} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 07:03:57,754 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L742-->L742-2: Formula: (let ((.cse3 (= (mod ~x$r_buff1_thd1~0_In1050995867 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In1050995867 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1050995867 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In1050995867 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In1050995867 |P0Thread1of1ForFork0_#t~ite6_Out1050995867|)) (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out1050995867|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1050995867, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1050995867, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1050995867, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1050995867} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1050995867|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1050995867, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1050995867, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1050995867, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1050995867} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 07:03:57,755 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L743-->L744: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-1785516693 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd1~0_In-1785516693 256) 0))) (or (and (not .cse0) (not .cse1) (= ~x$r_buff0_thd1~0_Out-1785516693 0)) (and (= ~x$r_buff0_thd1~0_Out-1785516693 ~x$r_buff0_thd1~0_In-1785516693) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1785516693, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1785516693} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_Out-1785516693, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1785516693|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1785516693} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-27 07:03:57,755 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L744-->L744-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd1~0_In-118769521 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In-118769521 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-118769521 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd1~0_In-118769521 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite8_Out-118769521| 0)) (and (= |P0Thread1of1ForFork0_#t~ite8_Out-118769521| ~x$r_buff1_thd1~0_In-118769521) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-118769521, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-118769521, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-118769521, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-118769521} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-118769521, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-118769521|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-118769521, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-118769521, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-118769521} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 07:03:57,756 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L744-2-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= v_~x$r_buff1_thd1~0_17 |v_P0Thread1of1ForFork0_#t~ite8_8|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_17} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-27 07:03:57,762 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [663] [663] L772-->L773: Formula: (and (not (= (mod v_~weak$$choice2~0_21 256) 0)) (= v_~x$r_buff0_thd2~0_53 v_~x$r_buff0_thd2~0_52)) InVars {~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_53, ~weak$$choice2~0=v_~weak$$choice2~0_21} OutVars{P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_7|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_52, ~weak$$choice2~0=v_~weak$$choice2~0_21, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_7|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite27, ~x$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-27 07:03:57,762 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L773-->L773-8: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In1691521024 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In1691521024 256))) (.cse5 (= 0 (mod ~weak$$choice2~0_In1691521024 256))) (.cse4 (= |P1Thread1of1ForFork1_#t~ite30_Out1691521024| |P1Thread1of1ForFork1_#t~ite29_Out1691521024|)) (.cse3 (= (mod ~x$w_buff0_used~0_In1691521024 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In1691521024 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite28_In1691521024| |P1Thread1of1ForFork1_#t~ite28_Out1691521024|) (or (and (= ~x$r_buff1_thd2~0_In1691521024 |P1Thread1of1ForFork1_#t~ite29_Out1691521024|) (or (and .cse0 .cse1) (and .cse1 .cse2) .cse3) .cse4 .cse5) (and (not .cse5) (= |P1Thread1of1ForFork1_#t~ite29_In1691521024| |P1Thread1of1ForFork1_#t~ite29_Out1691521024|) (= ~x$r_buff1_thd2~0_In1691521024 |P1Thread1of1ForFork1_#t~ite30_Out1691521024|)))) (let ((.cse6 (not .cse1))) (and (or (not .cse0) .cse6) (or .cse6 (not .cse2)) (= |P1Thread1of1ForFork1_#t~ite28_Out1691521024| 0) .cse5 (= |P1Thread1of1ForFork1_#t~ite28_Out1691521024| |P1Thread1of1ForFork1_#t~ite29_Out1691521024|) .cse4 (not .cse3))))) InVars {P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In1691521024|, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1691521024, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1691521024, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1691521024, ~weak$$choice2~0=~weak$$choice2~0_In1691521024, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_In1691521024|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1691521024} OutVars{P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out1691521024|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out1691521024|, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1691521024, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1691521024, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1691521024, ~weak$$choice2~0=~weak$$choice2~0_In1691521024, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out1691521024|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1691521024} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-27 07:03:57,763 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L775-->L779: Formula: (and (= v_~x$mem_tmp~0_4 v_~x~0_16) (= 0 v_~x$flush_delayed~0_6) (not (= 0 (mod v_~x$flush_delayed~0_7 256)))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_7, ~x$mem_tmp~0=v_~x$mem_tmp~0_4} OutVars{~x$flush_delayed~0=v_~x$flush_delayed~0_6, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~x$mem_tmp~0=v_~x$mem_tmp~0_4, ~x~0=v_~x~0_16} AuxVars[] AssignedVars[~x$flush_delayed~0, P1Thread1of1ForFork1_#t~ite31, ~x~0] because there is no mapped edge [2019-12-27 07:03:57,764 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L779-2-->L779-4: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In-70080905 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-70080905 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite32_Out-70080905| ~x~0_In-70080905) (or .cse0 .cse1)) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite32_Out-70080905| ~x$w_buff1~0_In-70080905) (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-70080905, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-70080905, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-70080905, ~x~0=~x~0_In-70080905} OutVars{~x$w_buff1~0=~x$w_buff1~0_In-70080905, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-70080905, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-70080905, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-70080905|, ~x~0=~x~0_In-70080905} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-27 07:03:57,765 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L779-4-->L780: Formula: (= v_~x~0_17 |v_P1Thread1of1ForFork1_#t~ite32_8|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_8|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_7|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_7|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-27 07:03:57,765 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L780-->L780-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-842407664 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In-842407664 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-842407664 |P1Thread1of1ForFork1_#t~ite34_Out-842407664|)) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out-842407664| 0) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-842407664, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-842407664} OutVars{P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-842407664|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-842407664, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-842407664} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 07:03:57,766 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L781-->L781-2: Formula: (let ((.cse3 (= (mod ~x$w_buff0_used~0_In-579828182 256) 0)) (.cse2 (= (mod ~x$r_buff0_thd2~0_In-579828182 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In-579828182 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In-579828182 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In-579828182 |P1Thread1of1ForFork1_#t~ite35_Out-579828182|) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite35_Out-579828182|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-579828182, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-579828182, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-579828182, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-579828182} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-579828182, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-579828182, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-579828182|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-579828182, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-579828182} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 07:03:57,767 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L782-->L782-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In320666972 256))) (.cse1 (= (mod ~x$r_buff0_thd2~0_In320666972 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite36_Out320666972| 0) (not .cse1)) (and (or .cse0 .cse1) (= ~x$r_buff0_thd2~0_In320666972 |P1Thread1of1ForFork1_#t~ite36_Out320666972|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In320666972, ~x$w_buff0_used~0=~x$w_buff0_used~0_In320666972} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In320666972, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out320666972|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In320666972} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 07:03:57,767 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L783-->L783-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff1_used~0_In26308154 256))) (.cse2 (= (mod ~x$r_buff1_thd2~0_In26308154 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In26308154 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In26308154 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite37_Out26308154| 0)) (and (or .cse3 .cse2) (= |P1Thread1of1ForFork1_#t~ite37_Out26308154| ~x$r_buff1_thd2~0_In26308154) (or .cse0 .cse1)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In26308154, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In26308154, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In26308154, ~x$w_buff0_used~0=~x$w_buff0_used~0_In26308154} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In26308154, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In26308154, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In26308154, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out26308154|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In26308154} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 07:03:57,768 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] L783-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd2~0_41 |v_P1Thread1of1ForFork1_#t~ite37_8|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_8|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_41, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 07:03:57,768 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L804-1-->L810: Formula: (and (= v_~main$tmp_guard0~0_5 1) (= v_~__unbuffered_cnt~0_7 2)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_7} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_7, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_4|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-27 07:03:57,769 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L810-2-->L810-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite41_Out2105101035| |ULTIMATE.start_main_#t~ite40_Out2105101035|)) (.cse1 (= (mod ~x$w_buff1_used~0_In2105101035 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd0~0_In2105101035 256) 0))) (or (and .cse0 (not .cse1) (not .cse2) (= |ULTIMATE.start_main_#t~ite40_Out2105101035| ~x$w_buff1~0_In2105101035)) (and (= ~x~0_In2105101035 |ULTIMATE.start_main_#t~ite40_Out2105101035|) .cse0 (or .cse1 .cse2)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In2105101035, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2105101035, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2105101035, ~x~0=~x~0_In2105101035} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out2105101035|, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out2105101035|, ~x$w_buff1~0=~x$w_buff1~0_In2105101035, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2105101035, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2105101035, ~x~0=~x~0_In2105101035} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 07:03:57,770 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L811-->L811-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In1391742146 256))) (.cse0 (= (mod ~x$r_buff0_thd0~0_In1391742146 256) 0))) (or (and (= ~x$w_buff0_used~0_In1391742146 |ULTIMATE.start_main_#t~ite42_Out1391742146|) (or .cse0 .cse1)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite42_Out1391742146| 0) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1391742146, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1391742146} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1391742146, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out1391742146|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1391742146} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 07:03:57,770 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L812-->L812-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In812378442 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In812378442 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In812378442 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In812378442 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite43_Out812378442|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~x$w_buff1_used~0_In812378442 |ULTIMATE.start_main_#t~ite43_Out812378442|) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In812378442, ~x$w_buff1_used~0=~x$w_buff1_used~0_In812378442, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In812378442, ~x$w_buff0_used~0=~x$w_buff0_used~0_In812378442} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In812378442, ~x$w_buff1_used~0=~x$w_buff1_used~0_In812378442, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out812378442|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In812378442, ~x$w_buff0_used~0=~x$w_buff0_used~0_In812378442} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 07:03:57,771 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L813-->L813-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In-225506679 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-225506679 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite44_Out-225506679|) (not .cse1)) (and (or .cse0 .cse1) (= ~x$r_buff0_thd0~0_In-225506679 |ULTIMATE.start_main_#t~ite44_Out-225506679|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-225506679, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-225506679} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-225506679, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-225506679|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-225506679} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 07:03:57,772 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L814-->L814-2: Formula: (let ((.cse3 (= (mod ~x$w_buff0_used~0_In-97035924 256) 0)) (.cse2 (= (mod ~x$r_buff0_thd0~0_In-97035924 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd0~0_In-97035924 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-97035924 256)))) (or (and (= ~x$r_buff1_thd0~0_In-97035924 |ULTIMATE.start_main_#t~ite45_Out-97035924|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite45_Out-97035924| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-97035924, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-97035924, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-97035924, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-97035924} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-97035924, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-97035924, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-97035924, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-97035924|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-97035924} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 07:03:57,773 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L814-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 1 v_~__unbuffered_p1_EAX~0_7) (= v_~y~0_10 2) (= v_~main$tmp_guard1~0_8 0) (= v_~x$r_buff1_thd0~0_18 |v_ULTIMATE.start_main_#t~ite45_11|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= 0 v_~__unbuffered_p1_EBX~0_7) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_7, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, ~y~0=v_~y~0_10, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_11|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_7, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~y~0=v_~y~0_10, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_18, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_10|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 07:03:57,863 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 07:03:57 BasicIcfg [2019-12-27 07:03:57,863 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 07:03:57,865 INFO L168 Benchmark]: Toolchain (without parser) took 11809.23 ms. Allocated memory was 145.8 MB in the beginning and 386.9 MB in the end (delta: 241.2 MB). Free memory was 101.7 MB in the beginning and 228.3 MB in the end (delta: -126.6 MB). Peak memory consumption was 114.6 MB. Max. memory is 7.1 GB. [2019-12-27 07:03:57,866 INFO L168 Benchmark]: CDTParser took 0.49 ms. Allocated memory is still 145.8 MB. Free memory is still 121.7 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-27 07:03:57,866 INFO L168 Benchmark]: CACSL2BoogieTranslator took 794.36 ms. Allocated memory was 145.8 MB in the beginning and 201.9 MB in the end (delta: 56.1 MB). Free memory was 101.7 MB in the beginning and 155.6 MB in the end (delta: -53.9 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. [2019-12-27 07:03:57,867 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.69 ms. Allocated memory is still 201.9 MB. Free memory was 155.6 MB in the beginning and 153.7 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-27 07:03:57,868 INFO L168 Benchmark]: Boogie Preprocessor took 44.52 ms. Allocated memory is still 201.9 MB. Free memory was 153.7 MB in the beginning and 150.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 07:03:57,868 INFO L168 Benchmark]: RCFGBuilder took 789.92 ms. Allocated memory is still 201.9 MB. Free memory was 150.9 MB in the beginning and 107.0 MB in the end (delta: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 7.1 GB. [2019-12-27 07:03:57,869 INFO L168 Benchmark]: TraceAbstraction took 10113.42 ms. Allocated memory was 201.9 MB in the beginning and 386.9 MB in the end (delta: 185.1 MB). Free memory was 106.1 MB in the beginning and 228.3 MB in the end (delta: -122.2 MB). Peak memory consumption was 62.8 MB. Max. memory is 7.1 GB. [2019-12-27 07:03:57,872 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.49 ms. Allocated memory is still 145.8 MB. Free memory is still 121.7 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 794.36 ms. Allocated memory was 145.8 MB in the beginning and 201.9 MB in the end (delta: 56.1 MB). Free memory was 101.7 MB in the beginning and 155.6 MB in the end (delta: -53.9 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 61.69 ms. Allocated memory is still 201.9 MB. Free memory was 155.6 MB in the beginning and 153.7 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 44.52 ms. Allocated memory is still 201.9 MB. Free memory was 153.7 MB in the beginning and 150.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 789.92 ms. Allocated memory is still 201.9 MB. Free memory was 150.9 MB in the beginning and 107.0 MB in the end (delta: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10113.42 ms. Allocated memory was 201.9 MB in the beginning and 386.9 MB in the end (delta: 185.1 MB). Free memory was 106.1 MB in the beginning and 228.3 MB in the end (delta: -122.2 MB). Peak memory consumption was 62.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.5s, 148 ProgramPointsBefore, 76 ProgramPointsAfterwards, 182 TransitionsBefore, 87 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 43 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 29 ConcurrentYvCompositions, 26 ChoiceCompositions, 4391 VarBasedMoverChecksPositive, 152 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 49085 CheckedPairsTotal, 102 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L802] FCALL, FORK 0 pthread_create(&t1601, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L726] 1 x$w_buff1 = x$w_buff0 [L727] 1 x$w_buff0 = 1 [L728] 1 x$w_buff1_used = x$w_buff0_used [L729] 1 x$w_buff0_used = (_Bool)1 [L804] FCALL, FORK 0 pthread_create(&t1602, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L740] 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) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L754] 2 y = 2 [L757] 2 z = 1 [L760] 2 __unbuffered_p1_EAX = z [L763] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L764] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L765] 2 x$flush_delayed = weak$$choice2 [L766] 2 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L767] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L740] 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) [L741] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L742] 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 [L767] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L768] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L768] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L769] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L769] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L770] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L770] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L771] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L771] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L773] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L774] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L779] 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L780] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L781] 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 [L782] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L810] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L810] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L811] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L812] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L813] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 142 locations, 2 error locations. Result: UNSAFE, OverallTime: 9.8s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1833 SDtfs, 1192 SDslu, 3303 SDs, 0 SdLazy, 1799 SolverSat, 54 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 83 GetRequests, 27 SyntacticMatches, 8 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8066occurred 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.9s AutomataMinimizationTime, 15 MinimizatonAttempts, 2882 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 520 NumberOfCodeBlocks, 520 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 452 ConstructedInterpolants, 0 QuantifiedInterpolants, 49584 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...