/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-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix041_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 17:01:28,750 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 17:01:28,754 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 17:01:28,774 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 17:01:28,774 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 17:01:28,776 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 17:01:28,778 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 17:01:28,788 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 17:01:28,790 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 17:01:28,791 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 17:01:28,792 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 17:01:28,795 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 17:01:28,795 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 17:01:28,798 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 17:01:28,800 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 17:01:28,803 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 17:01:28,805 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 17:01:28,807 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 17:01:28,808 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 17:01:28,813 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 17:01:28,818 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 17:01:28,821 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 17:01:28,823 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 17:01:28,824 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 17:01:28,826 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 17:01:28,826 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 17:01:28,826 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 17:01:28,828 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 17:01:28,829 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 17:01:28,830 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 17:01:28,830 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 17:01:28,831 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 17:01:28,832 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 17:01:28,833 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 17:01:28,834 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 17:01:28,835 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 17:01:28,836 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 17:01:28,836 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 17:01:28,837 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 17:01:28,838 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 17:01:28,839 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 17:01:28,840 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-SemanticLbe-MCR.epf [2019-12-27 17:01:28,871 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 17:01:28,877 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 17:01:28,878 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 17:01:28,878 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 17:01:28,879 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 17:01:28,879 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 17:01:28,879 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 17:01:28,879 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 17:01:28,879 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 17:01:28,879 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 17:01:28,881 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 17:01:28,881 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 17:01:28,881 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 17:01:28,881 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 17:01:28,881 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 17:01:28,882 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 17:01:28,882 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 17:01:28,882 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 17:01:28,882 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 17:01:28,882 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 17:01:28,883 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 17:01:28,884 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 17:01:28,884 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 17:01:28,884 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 17:01:28,885 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 17:01:28,885 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 17:01:28,885 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 17:01:28,885 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 17:01:28,886 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 17:01:28,886 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 17:01:28,886 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 17:01:29,164 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 17:01:29,176 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 17:01:29,179 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 17:01:29,181 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 17:01:29,181 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 17:01:29,182 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix041_power.oepc.i [2019-12-27 17:01:29,242 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83b038edd/76817c21159243cba06ef9ff15354642/FLAG7d5b5f637 [2019-12-27 17:01:29,800 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 17:01:29,801 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix041_power.oepc.i [2019-12-27 17:01:29,816 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83b038edd/76817c21159243cba06ef9ff15354642/FLAG7d5b5f637 [2019-12-27 17:01:30,078 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83b038edd/76817c21159243cba06ef9ff15354642 [2019-12-27 17:01:30,088 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 17:01:30,089 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 17:01:30,090 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 17:01:30,090 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 17:01:30,096 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 17:01:30,097 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:01:30" (1/1) ... [2019-12-27 17:01:30,102 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@691f4c0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:01:30, skipping insertion in model container [2019-12-27 17:01:30,102 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:01:30" (1/1) ... [2019-12-27 17:01:30,108 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 17:01:30,151 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 17:01:30,667 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 17:01:30,680 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 17:01:30,774 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 17:01:30,845 INFO L208 MainTranslator]: Completed translation [2019-12-27 17:01:30,846 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:01:30 WrapperNode [2019-12-27 17:01:30,846 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 17:01:30,847 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 17:01:30,847 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 17:01:30,847 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 17:01:30,856 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:01:30" (1/1) ... [2019-12-27 17:01:30,877 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:01:30" (1/1) ... [2019-12-27 17:01:30,908 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 17:01:30,908 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 17:01:30,909 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 17:01:30,909 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 17:01:30,919 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:01:30" (1/1) ... [2019-12-27 17:01:30,919 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:01:30" (1/1) ... [2019-12-27 17:01:30,924 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:01:30" (1/1) ... [2019-12-27 17:01:30,924 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:01:30" (1/1) ... [2019-12-27 17:01:30,938 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:01:30" (1/1) ... [2019-12-27 17:01:30,943 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:01:30" (1/1) ... [2019-12-27 17:01:30,947 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:01:30" (1/1) ... [2019-12-27 17:01:30,952 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 17:01:30,952 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 17:01:30,953 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 17:01:30,953 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 17:01:30,954 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:01:30" (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 17:01:31,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 17:01:31,037 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 17:01:31,037 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 17:01:31,038 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 17:01:31,038 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 17:01:31,038 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 17:01:31,039 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 17:01:31,040 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 17:01:31,040 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 17:01:31,041 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 17:01:31,041 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 17:01:31,043 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 17:01:31,721 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 17:01:31,721 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 17:01:31,723 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:01:31 BoogieIcfgContainer [2019-12-27 17:01:31,724 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 17:01:31,725 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 17:01:31,725 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 17:01:31,731 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 17:01:31,731 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 05:01:30" (1/3) ... [2019-12-27 17:01:31,733 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6843686 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:01:31, skipping insertion in model container [2019-12-27 17:01:31,734 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:01:30" (2/3) ... [2019-12-27 17:01:31,735 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6843686 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:01:31, skipping insertion in model container [2019-12-27 17:01:31,735 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:01:31" (3/3) ... [2019-12-27 17:01:31,738 INFO L109 eAbstractionObserver]: Analyzing ICFG mix041_power.oepc.i [2019-12-27 17:01:31,749 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 17:01:31,750 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 17:01:31,760 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 17:01:31,762 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 17:01:31,825 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,825 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,826 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,826 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,826 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,826 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,828 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,829 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,829 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,829 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,830 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,830 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,830 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,831 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,831 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,831 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,831 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,832 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,832 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,832 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,832 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,832 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,833 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,833 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,833 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,834 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,834 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,834 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,834 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,835 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,835 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,835 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,836 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,836 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,842 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,842 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,852 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,852 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,852 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,852 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,858 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,858 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,858 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,858 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,859 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,859 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,859 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,859 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,860 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,860 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,860 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,860 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,861 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,862 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,865 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,865 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,866 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,867 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,873 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,874 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,874 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,874 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,874 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,874 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,876 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,876 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,877 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,877 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,877 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,877 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,878 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,878 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,878 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,878 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,879 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,879 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,879 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,879 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,879 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,880 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,880 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,880 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,880 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,881 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,881 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,881 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,881 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,881 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,882 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,882 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,882 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,882 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,883 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,883 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,883 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,883 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,884 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,884 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,884 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,884 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,884 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,885 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,885 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,889 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,889 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,890 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,890 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,906 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,907 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,907 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,907 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,907 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,907 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,908 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,908 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,915 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,915 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,915 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,915 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,915 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,915 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,917 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,917 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,917 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,917 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,917 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,917 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,918 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,918 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,918 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:31,937 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 17:01:31,960 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 17:01:31,960 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 17:01:31,960 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 17:01:31,960 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 17:01:31,960 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 17:01:31,960 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 17:01:31,961 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 17:01:31,961 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 17:01:31,983 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 182 transitions [2019-12-27 17:01:31,985 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-27 17:01:32,072 INFO L132 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-27 17:01:32,072 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 17:01:32,085 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 348 event pairs. 0/137 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 17:01:32,104 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-27 17:01:32,149 INFO L132 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-27 17:01:32,149 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 17:01:32,156 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 348 event pairs. 0/137 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 17:01:32,171 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-27 17:01:32,173 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 17:01:36,103 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-12-27 17:01:36,683 WARN L192 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-27 17:01:37,209 INFO L206 etLargeBlockEncoding]: Checked pairs total: 82827 [2019-12-27 17:01:37,210 INFO L214 etLargeBlockEncoding]: Total number of compositions: 110 [2019-12-27 17:01:37,213 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 77 places, 89 transitions [2019-12-27 17:01:37,726 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8640 states. [2019-12-27 17:01:37,729 INFO L276 IsEmpty]: Start isEmpty. Operand 8640 states. [2019-12-27 17:01:37,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 17:01:37,736 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:01:37,737 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 17:01:37,737 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:01:37,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:01:37,745 INFO L82 PathProgramCache]: Analyzing trace with hash 792296, now seen corresponding path program 1 times [2019-12-27 17:01:37,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:01:37,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890765022] [2019-12-27 17:01:37,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:01:37,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:01:37,990 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 17:01:37,991 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890765022] [2019-12-27 17:01:37,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:01:37,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 17:01:37,993 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2146563888] [2019-12-27 17:01:37,993 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:01:37,998 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:01:38,007 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 17:01:38,008 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:01:38,011 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:01:38,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:01:38,012 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:01:38,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:01:38,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:01:38,026 INFO L87 Difference]: Start difference. First operand 8640 states. Second operand 3 states. [2019-12-27 17:01:38,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:01:38,417 INFO L93 Difference]: Finished difference Result 8506 states and 27908 transitions. [2019-12-27 17:01:38,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:01:38,419 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 17:01:38,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:01:38,549 INFO L225 Difference]: With dead ends: 8506 [2019-12-27 17:01:38,549 INFO L226 Difference]: Without dead ends: 7522 [2019-12-27 17:01:38,551 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 17:01:38,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7522 states. [2019-12-27 17:01:38,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7522 to 7522. [2019-12-27 17:01:38,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7522 states. [2019-12-27 17:01:38,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7522 states to 7522 states and 24586 transitions. [2019-12-27 17:01:38,971 INFO L78 Accepts]: Start accepts. Automaton has 7522 states and 24586 transitions. Word has length 3 [2019-12-27 17:01:38,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:01:38,971 INFO L462 AbstractCegarLoop]: Abstraction has 7522 states and 24586 transitions. [2019-12-27 17:01:38,971 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:01:38,971 INFO L276 IsEmpty]: Start isEmpty. Operand 7522 states and 24586 transitions. [2019-12-27 17:01:38,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 17:01:38,977 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:01:38,977 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:01:38,978 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:01:38,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:01:38,978 INFO L82 PathProgramCache]: Analyzing trace with hash -476377294, now seen corresponding path program 1 times [2019-12-27 17:01:38,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:01:38,979 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270595925] [2019-12-27 17:01:38,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:01:39,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:01:39,111 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 17:01:39,112 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270595925] [2019-12-27 17:01:39,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:01:39,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:01:39,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [295942883] [2019-12-27 17:01:39,112 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:01:39,113 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:01:39,115 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 17:01:39,115 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:01:39,117 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:01:39,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:01:39,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:01:39,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:01:39,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:01:39,120 INFO L87 Difference]: Start difference. First operand 7522 states and 24586 transitions. Second operand 3 states. [2019-12-27 17:01:39,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:01:39,165 INFO L93 Difference]: Finished difference Result 1232 states and 2827 transitions. [2019-12-27 17:01:39,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:01:39,166 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-27 17:01:39,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:01:39,175 INFO L225 Difference]: With dead ends: 1232 [2019-12-27 17:01:39,175 INFO L226 Difference]: Without dead ends: 1232 [2019-12-27 17:01:39,176 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 17:01:39,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2019-12-27 17:01:39,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 1232. [2019-12-27 17:01:39,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1232 states. [2019-12-27 17:01:39,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1232 states to 1232 states and 2827 transitions. [2019-12-27 17:01:39,225 INFO L78 Accepts]: Start accepts. Automaton has 1232 states and 2827 transitions. Word has length 11 [2019-12-27 17:01:39,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:01:39,226 INFO L462 AbstractCegarLoop]: Abstraction has 1232 states and 2827 transitions. [2019-12-27 17:01:39,226 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:01:39,226 INFO L276 IsEmpty]: Start isEmpty. Operand 1232 states and 2827 transitions. [2019-12-27 17:01:39,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 17:01:39,235 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:01:39,235 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:01:39,235 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:01:39,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:01:39,236 INFO L82 PathProgramCache]: Analyzing trace with hash 394534895, now seen corresponding path program 1 times [2019-12-27 17:01:39,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:01:39,237 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072071299] [2019-12-27 17:01:39,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:01:39,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:01:39,346 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 17:01:39,346 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072071299] [2019-12-27 17:01:39,346 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:01:39,347 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:01:39,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1016218270] [2019-12-27 17:01:39,348 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:01:39,350 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:01:39,353 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 15 states and 14 transitions. [2019-12-27 17:01:39,354 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:01:39,354 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:01:39,354 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:01:39,355 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:01:39,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:01:39,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:01:39,355 INFO L87 Difference]: Start difference. First operand 1232 states and 2827 transitions. Second operand 3 states. [2019-12-27 17:01:39,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:01:39,441 INFO L93 Difference]: Finished difference Result 1960 states and 4354 transitions. [2019-12-27 17:01:39,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:01:39,442 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-27 17:01:39,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:01:39,453 INFO L225 Difference]: With dead ends: 1960 [2019-12-27 17:01:39,453 INFO L226 Difference]: Without dead ends: 1960 [2019-12-27 17:01:39,453 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 17:01:39,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1960 states. [2019-12-27 17:01:39,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1960 to 1384. [2019-12-27 17:01:39,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1384 states. [2019-12-27 17:01:39,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1384 states to 1384 states and 3137 transitions. [2019-12-27 17:01:39,504 INFO L78 Accepts]: Start accepts. Automaton has 1384 states and 3137 transitions. Word has length 14 [2019-12-27 17:01:39,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:01:39,504 INFO L462 AbstractCegarLoop]: Abstraction has 1384 states and 3137 transitions. [2019-12-27 17:01:39,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:01:39,504 INFO L276 IsEmpty]: Start isEmpty. Operand 1384 states and 3137 transitions. [2019-12-27 17:01:39,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 17:01:39,505 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:01:39,506 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:01:39,506 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:01:39,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:01:39,506 INFO L82 PathProgramCache]: Analyzing trace with hash 304327747, now seen corresponding path program 1 times [2019-12-27 17:01:39,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:01:39,507 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509168607] [2019-12-27 17:01:39,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:01:39,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:01:39,624 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 17:01:39,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509168607] [2019-12-27 17:01:39,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:01:39,625 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:01:39,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1411710061] [2019-12-27 17:01:39,629 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:01:39,631 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:01:39,633 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 15 states and 14 transitions. [2019-12-27 17:01:39,634 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:01:39,634 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:01:39,634 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 17:01:39,635 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:01:39,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 17:01:39,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:01:39,636 INFO L87 Difference]: Start difference. First operand 1384 states and 3137 transitions. Second operand 4 states. [2019-12-27 17:01:39,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:01:39,906 INFO L93 Difference]: Finished difference Result 1706 states and 3795 transitions. [2019-12-27 17:01:39,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:01:39,907 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 17:01:39,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:01:39,916 INFO L225 Difference]: With dead ends: 1706 [2019-12-27 17:01:39,917 INFO L226 Difference]: Without dead ends: 1706 [2019-12-27 17:01:39,917 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 17:01:39,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1706 states. [2019-12-27 17:01:39,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1706 to 1646. [2019-12-27 17:01:39,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1646 states. [2019-12-27 17:01:39,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1646 states to 1646 states and 3679 transitions. [2019-12-27 17:01:39,969 INFO L78 Accepts]: Start accepts. Automaton has 1646 states and 3679 transitions. Word has length 14 [2019-12-27 17:01:39,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:01:39,969 INFO L462 AbstractCegarLoop]: Abstraction has 1646 states and 3679 transitions. [2019-12-27 17:01:39,969 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 17:01:39,970 INFO L276 IsEmpty]: Start isEmpty. Operand 1646 states and 3679 transitions. [2019-12-27 17:01:39,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 17:01:39,970 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:01:39,970 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:01:39,971 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:01:39,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:01:39,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1071051512, now seen corresponding path program 1 times [2019-12-27 17:01:39,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:01:39,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947462752] [2019-12-27 17:01:39,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:01:39,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:01:40,066 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 17:01:40,066 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947462752] [2019-12-27 17:01:40,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:01:40,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:01:40,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1400047794] [2019-12-27 17:01:40,067 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:01:40,069 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:01:40,071 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 15 states and 14 transitions. [2019-12-27 17:01:40,071 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:01:40,072 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:01:40,072 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 17:01:40,072 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:01:40,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 17:01:40,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:01:40,073 INFO L87 Difference]: Start difference. First operand 1646 states and 3679 transitions. Second operand 4 states. [2019-12-27 17:01:40,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:01:40,248 INFO L93 Difference]: Finished difference Result 2032 states and 4499 transitions. [2019-12-27 17:01:40,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:01:40,248 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 17:01:40,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:01:40,259 INFO L225 Difference]: With dead ends: 2032 [2019-12-27 17:01:40,260 INFO L226 Difference]: Without dead ends: 2032 [2019-12-27 17:01:40,260 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 17:01:40,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2032 states. [2019-12-27 17:01:40,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2032 to 1750. [2019-12-27 17:01:40,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1750 states. [2019-12-27 17:01:40,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1750 states to 1750 states and 3922 transitions. [2019-12-27 17:01:40,311 INFO L78 Accepts]: Start accepts. Automaton has 1750 states and 3922 transitions. Word has length 14 [2019-12-27 17:01:40,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:01:40,312 INFO L462 AbstractCegarLoop]: Abstraction has 1750 states and 3922 transitions. [2019-12-27 17:01:40,312 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 17:01:40,312 INFO L276 IsEmpty]: Start isEmpty. Operand 1750 states and 3922 transitions. [2019-12-27 17:01:40,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 17:01:40,314 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:01:40,315 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 17:01:40,315 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:01:40,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:01:40,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1681809556, now seen corresponding path program 1 times [2019-12-27 17:01:40,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:01:40,316 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558782613] [2019-12-27 17:01:40,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:01:40,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:01:40,398 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 17:01:40,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558782613] [2019-12-27 17:01:40,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:01:40,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:01:40,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1419436147] [2019-12-27 17:01:40,399 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:01:40,403 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:01:40,407 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 17:01:40,408 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:01:40,408 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:01:40,408 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:01:40,409 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:01:40,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:01:40,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:01:40,409 INFO L87 Difference]: Start difference. First operand 1750 states and 3922 transitions. Second operand 5 states. [2019-12-27 17:01:40,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:01:40,700 INFO L93 Difference]: Finished difference Result 2284 states and 4985 transitions. [2019-12-27 17:01:40,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 17:01:40,701 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 17:01:40,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:01:40,714 INFO L225 Difference]: With dead ends: 2284 [2019-12-27 17:01:40,714 INFO L226 Difference]: Without dead ends: 2284 [2019-12-27 17:01:40,714 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 17:01:40,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2284 states. [2019-12-27 17:01:40,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2284 to 2035. [2019-12-27 17:01:40,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2035 states. [2019-12-27 17:01:40,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2035 states to 2035 states and 4506 transitions. [2019-12-27 17:01:40,762 INFO L78 Accepts]: Start accepts. Automaton has 2035 states and 4506 transitions. Word has length 25 [2019-12-27 17:01:40,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:01:40,762 INFO L462 AbstractCegarLoop]: Abstraction has 2035 states and 4506 transitions. [2019-12-27 17:01:40,762 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:01:40,763 INFO L276 IsEmpty]: Start isEmpty. Operand 2035 states and 4506 transitions. [2019-12-27 17:01:40,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 17:01:40,765 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:01:40,766 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 17:01:40,766 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:01:40,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:01:40,766 INFO L82 PathProgramCache]: Analyzing trace with hash 968997935, now seen corresponding path program 1 times [2019-12-27 17:01:40,767 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:01:40,767 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635312381] [2019-12-27 17:01:40,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:01:40,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:01:40,805 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 17:01:40,805 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635312381] [2019-12-27 17:01:40,806 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:01:40,806 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:01:40,806 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1131733773] [2019-12-27 17:01:40,806 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:01:40,811 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:01:40,817 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 17:01:40,817 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:01:40,818 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:01:40,818 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:01:40,818 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:01:40,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:01:40,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:01:40,819 INFO L87 Difference]: Start difference. First operand 2035 states and 4506 transitions. Second operand 3 states. [2019-12-27 17:01:40,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:01:40,860 INFO L93 Difference]: Finished difference Result 2578 states and 5509 transitions. [2019-12-27 17:01:40,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:01:40,860 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-12-27 17:01:40,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:01:40,868 INFO L225 Difference]: With dead ends: 2578 [2019-12-27 17:01:40,868 INFO L226 Difference]: Without dead ends: 2578 [2019-12-27 17:01:40,869 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 17:01:40,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2578 states. [2019-12-27 17:01:40,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2578 to 1993. [2019-12-27 17:01:40,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1993 states. [2019-12-27 17:01:40,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1993 states to 1993 states and 4274 transitions. [2019-12-27 17:01:40,916 INFO L78 Accepts]: Start accepts. Automaton has 1993 states and 4274 transitions. Word has length 25 [2019-12-27 17:01:40,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:01:40,917 INFO L462 AbstractCegarLoop]: Abstraction has 1993 states and 4274 transitions. [2019-12-27 17:01:40,917 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:01:40,917 INFO L276 IsEmpty]: Start isEmpty. Operand 1993 states and 4274 transitions. [2019-12-27 17:01:40,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 17:01:40,920 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:01:40,920 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 17:01:40,920 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:01:40,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:01:40,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1274554926, now seen corresponding path program 1 times [2019-12-27 17:01:40,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:01:40,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382848037] [2019-12-27 17:01:40,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:01:40,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:01:40,962 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 17:01:40,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382848037] [2019-12-27 17:01:40,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:01:40,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:01:40,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [817276854] [2019-12-27 17:01:40,963 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:01:40,967 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:01:40,976 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 49 states and 70 transitions. [2019-12-27 17:01:40,976 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:01:40,978 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:01:40,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:01:40,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:01:40,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:01:40,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:01:40,979 INFO L87 Difference]: Start difference. First operand 1993 states and 4274 transitions. Second operand 3 states. [2019-12-27 17:01:41,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:01:41,002 INFO L93 Difference]: Finished difference Result 3111 states and 6741 transitions. [2019-12-27 17:01:41,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:01:41,002 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-27 17:01:41,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:01:41,008 INFO L225 Difference]: With dead ends: 3111 [2019-12-27 17:01:41,008 INFO L226 Difference]: Without dead ends: 1431 [2019-12-27 17:01:41,008 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 17:01:41,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1431 states. [2019-12-27 17:01:41,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1431 to 1411. [2019-12-27 17:01:41,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1411 states. [2019-12-27 17:01:41,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1411 states to 1411 states and 2997 transitions. [2019-12-27 17:01:41,044 INFO L78 Accepts]: Start accepts. Automaton has 1411 states and 2997 transitions. Word has length 26 [2019-12-27 17:01:41,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:01:41,044 INFO L462 AbstractCegarLoop]: Abstraction has 1411 states and 2997 transitions. [2019-12-27 17:01:41,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:01:41,045 INFO L276 IsEmpty]: Start isEmpty. Operand 1411 states and 2997 transitions. [2019-12-27 17:01:41,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 17:01:41,047 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:01:41,047 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 17:01:41,047 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:01:41,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:01:41,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1286104553, now seen corresponding path program 1 times [2019-12-27 17:01:41,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:01:41,049 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724211838] [2019-12-27 17:01:41,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:01:41,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:01:41,167 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 17:01:41,167 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724211838] [2019-12-27 17:01:41,168 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:01:41,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:01:41,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1816902977] [2019-12-27 17:01:41,168 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:01:41,213 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:01:41,219 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 27 states and 26 transitions. [2019-12-27 17:01:41,220 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:01:41,220 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:01:41,220 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:01:41,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:01:41,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:01:41,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:01:41,221 INFO L87 Difference]: Start difference. First operand 1411 states and 2997 transitions. Second operand 5 states. [2019-12-27 17:01:41,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:01:41,372 INFO L93 Difference]: Finished difference Result 1416 states and 2988 transitions. [2019-12-27 17:01:41,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 17:01:41,373 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-27 17:01:41,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:01:41,378 INFO L225 Difference]: With dead ends: 1416 [2019-12-27 17:01:41,378 INFO L226 Difference]: Without dead ends: 1416 [2019-12-27 17:01:41,379 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 3 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 17:01:41,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1416 states. [2019-12-27 17:01:41,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1416 to 1374. [2019-12-27 17:01:41,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1374 states. [2019-12-27 17:01:41,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1374 states to 1374 states and 2924 transitions. [2019-12-27 17:01:41,418 INFO L78 Accepts]: Start accepts. Automaton has 1374 states and 2924 transitions. Word has length 26 [2019-12-27 17:01:41,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:01:41,419 INFO L462 AbstractCegarLoop]: Abstraction has 1374 states and 2924 transitions. [2019-12-27 17:01:41,419 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:01:41,419 INFO L276 IsEmpty]: Start isEmpty. Operand 1374 states and 2924 transitions. [2019-12-27 17:01:41,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 17:01:41,422 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:01:41,422 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] [2019-12-27 17:01:41,422 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:01:41,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:01:41,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1349237224, now seen corresponding path program 1 times [2019-12-27 17:01:41,424 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:01:41,424 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280162099] [2019-12-27 17:01:41,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:01:41,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:01:41,513 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 17:01:41,513 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280162099] [2019-12-27 17:01:41,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:01:41,514 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 17:01:41,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1030202841] [2019-12-27 17:01:41,514 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:01:41,522 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:01:41,536 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 59 states and 89 transitions. [2019-12-27 17:01:41,536 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:01:41,628 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 17:01:41,628 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 17:01:41,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:01:41,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 17:01:41,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:01:41,629 INFO L87 Difference]: Start difference. First operand 1374 states and 2924 transitions. Second operand 7 states. [2019-12-27 17:01:42,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:01:42,337 INFO L93 Difference]: Finished difference Result 2192 states and 4592 transitions. [2019-12-27 17:01:42,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 17:01:42,337 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2019-12-27 17:01:42,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:01:42,344 INFO L225 Difference]: With dead ends: 2192 [2019-12-27 17:01:42,345 INFO L226 Difference]: Without dead ends: 2192 [2019-12-27 17:01:42,345 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-27 17:01:42,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2192 states. [2019-12-27 17:01:42,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2192 to 1982. [2019-12-27 17:01:42,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1982 states. [2019-12-27 17:01:42,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1982 states to 1982 states and 4188 transitions. [2019-12-27 17:01:42,395 INFO L78 Accepts]: Start accepts. Automaton has 1982 states and 4188 transitions. Word has length 27 [2019-12-27 17:01:42,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:01:42,395 INFO L462 AbstractCegarLoop]: Abstraction has 1982 states and 4188 transitions. [2019-12-27 17:01:42,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 17:01:42,395 INFO L276 IsEmpty]: Start isEmpty. Operand 1982 states and 4188 transitions. [2019-12-27 17:01:42,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 17:01:42,402 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:01:42,402 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] [2019-12-27 17:01:42,402 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:01:42,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:01:42,403 INFO L82 PathProgramCache]: Analyzing trace with hash -1804230119, now seen corresponding path program 1 times [2019-12-27 17:01:42,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:01:42,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200597904] [2019-12-27 17:01:42,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:01:42,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:01:42,446 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 17:01:42,447 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200597904] [2019-12-27 17:01:42,447 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:01:42,447 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:01:42,448 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2115517863] [2019-12-27 17:01:42,451 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:01:42,456 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:01:42,470 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 61 states and 92 transitions. [2019-12-27 17:01:42,470 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:01:42,486 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 17:01:42,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:01:42,487 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:01:42,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:01:42,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:01:42,487 INFO L87 Difference]: Start difference. First operand 1982 states and 4188 transitions. Second operand 5 states. [2019-12-27 17:01:42,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:01:42,506 INFO L93 Difference]: Finished difference Result 1109 states and 2212 transitions. [2019-12-27 17:01:42,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 17:01:42,507 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-27 17:01:42,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:01:42,509 INFO L225 Difference]: With dead ends: 1109 [2019-12-27 17:01:42,509 INFO L226 Difference]: Without dead ends: 1001 [2019-12-27 17:01:42,509 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:01:42,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1001 states. [2019-12-27 17:01:42,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1001 to 923. [2019-12-27 17:01:42,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 923 states. [2019-12-27 17:01:42,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1913 transitions. [2019-12-27 17:01:42,529 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1913 transitions. Word has length 28 [2019-12-27 17:01:42,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:01:42,529 INFO L462 AbstractCegarLoop]: Abstraction has 923 states and 1913 transitions. [2019-12-27 17:01:42,529 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:01:42,529 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1913 transitions. [2019-12-27 17:01:42,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 17:01:42,532 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:01:42,532 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 17:01:42,532 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:01:42,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:01:42,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1370475912, now seen corresponding path program 1 times [2019-12-27 17:01:42,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:01:42,533 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308649849] [2019-12-27 17:01:42,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:01:42,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:01:42,670 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 17:01:42,670 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308649849] [2019-12-27 17:01:42,670 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:01:42,671 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 17:01:42,671 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [823260641] [2019-12-27 17:01:42,671 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:01:42,686 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:01:42,836 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 118 states and 183 transitions. [2019-12-27 17:01:42,836 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:01:42,883 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 17:01:42,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 17:01:42,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:01:42,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 17:01:42,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 17:01:42,884 INFO L87 Difference]: Start difference. First operand 923 states and 1913 transitions. Second operand 8 states. [2019-12-27 17:01:43,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:01:43,115 INFO L93 Difference]: Finished difference Result 1593 states and 3217 transitions. [2019-12-27 17:01:43,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 17:01:43,115 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2019-12-27 17:01:43,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:01:43,120 INFO L225 Difference]: With dead ends: 1593 [2019-12-27 17:01:43,120 INFO L226 Difference]: Without dead ends: 1060 [2019-12-27 17:01:43,120 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-12-27 17:01:43,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1060 states. [2019-12-27 17:01:43,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1060 to 922. [2019-12-27 17:01:43,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 922 states. [2019-12-27 17:01:43,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 922 states to 922 states and 1886 transitions. [2019-12-27 17:01:43,140 INFO L78 Accepts]: Start accepts. Automaton has 922 states and 1886 transitions. Word has length 51 [2019-12-27 17:01:43,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:01:43,141 INFO L462 AbstractCegarLoop]: Abstraction has 922 states and 1886 transitions. [2019-12-27 17:01:43,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 17:01:43,141 INFO L276 IsEmpty]: Start isEmpty. Operand 922 states and 1886 transitions. [2019-12-27 17:01:43,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 17:01:43,144 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:01:43,144 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 17:01:43,144 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:01:43,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:01:43,145 INFO L82 PathProgramCache]: Analyzing trace with hash 1368511210, now seen corresponding path program 2 times [2019-12-27 17:01:43,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:01:43,146 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716264957] [2019-12-27 17:01:43,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:01:43,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:01:43,272 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 17:01:43,272 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716264957] [2019-12-27 17:01:43,272 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:01:43,272 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 17:01:43,273 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [155484202] [2019-12-27 17:01:43,273 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:01:43,289 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:01:43,361 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 125 states and 191 transitions. [2019-12-27 17:01:43,361 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:01:43,397 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 17:01:43,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 17:01:43,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:01:43,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 17:01:43,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:01:43,399 INFO L87 Difference]: Start difference. First operand 922 states and 1886 transitions. Second operand 6 states. [2019-12-27 17:01:43,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:01:43,888 INFO L93 Difference]: Finished difference Result 1079 states and 2184 transitions. [2019-12-27 17:01:43,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 17:01:43,888 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2019-12-27 17:01:43,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:01:43,892 INFO L225 Difference]: With dead ends: 1079 [2019-12-27 17:01:43,892 INFO L226 Difference]: Without dead ends: 1079 [2019-12-27 17:01:43,893 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 5 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 17:01:43,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1079 states. [2019-12-27 17:01:43,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1079 to 952. [2019-12-27 17:01:43,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 952 states. [2019-12-27 17:01:43,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 1941 transitions. [2019-12-27 17:01:43,913 INFO L78 Accepts]: Start accepts. Automaton has 952 states and 1941 transitions. Word has length 51 [2019-12-27 17:01:43,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:01:43,913 INFO L462 AbstractCegarLoop]: Abstraction has 952 states and 1941 transitions. [2019-12-27 17:01:43,913 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 17:01:43,914 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 1941 transitions. [2019-12-27 17:01:43,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 17:01:43,916 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:01:43,917 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 17:01:43,917 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:01:43,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:01:43,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1240455298, now seen corresponding path program 3 times [2019-12-27 17:01:43,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:01:43,918 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076742485] [2019-12-27 17:01:43,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:01:43,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:01:44,116 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 17:01:44,116 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076742485] [2019-12-27 17:01:44,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:01:44,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 17:01:44,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1872386237] [2019-12-27 17:01:44,117 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:01:44,130 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:01:44,178 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 95 states and 129 transitions. [2019-12-27 17:01:44,178 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:01:44,182 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 17:01:44,182 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:01:44,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:01:44,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:01:44,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:01:44,183 INFO L87 Difference]: Start difference. First operand 952 states and 1941 transitions. Second operand 5 states. [2019-12-27 17:01:44,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:01:44,382 INFO L93 Difference]: Finished difference Result 1081 states and 2174 transitions. [2019-12-27 17:01:44,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 17:01:44,383 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2019-12-27 17:01:44,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:01:44,386 INFO L225 Difference]: With dead ends: 1081 [2019-12-27 17:01:44,387 INFO L226 Difference]: Without dead ends: 1081 [2019-12-27 17:01:44,387 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:01:44,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2019-12-27 17:01:44,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 993. [2019-12-27 17:01:44,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 993 states. [2019-12-27 17:01:44,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 993 states to 993 states and 2021 transitions. [2019-12-27 17:01:44,406 INFO L78 Accepts]: Start accepts. Automaton has 993 states and 2021 transitions. Word has length 51 [2019-12-27 17:01:44,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:01:44,407 INFO L462 AbstractCegarLoop]: Abstraction has 993 states and 2021 transitions. [2019-12-27 17:01:44,407 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:01:44,407 INFO L276 IsEmpty]: Start isEmpty. Operand 993 states and 2021 transitions. [2019-12-27 17:01:44,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 17:01:44,409 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:01:44,410 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 17:01:44,410 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:01:44,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:01:44,410 INFO L82 PathProgramCache]: Analyzing trace with hash 503151608, now seen corresponding path program 4 times [2019-12-27 17:01:44,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:01:44,411 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673250605] [2019-12-27 17:01:44,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:01:44,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:01:44,511 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 17:01:44,511 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673250605] [2019-12-27 17:01:44,512 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:01:44,512 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:01:44,512 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1509282875] [2019-12-27 17:01:44,512 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:01:44,525 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:01:44,575 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 86 states and 111 transitions. [2019-12-27 17:01:44,576 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:01:44,576 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:01:44,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:01:44,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:01:44,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:01:44,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:01:44,577 INFO L87 Difference]: Start difference. First operand 993 states and 2021 transitions. Second operand 3 states. [2019-12-27 17:01:44,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:01:44,591 INFO L93 Difference]: Finished difference Result 993 states and 2020 transitions. [2019-12-27 17:01:44,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:01:44,592 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-27 17:01:44,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:01:44,594 INFO L225 Difference]: With dead ends: 993 [2019-12-27 17:01:44,594 INFO L226 Difference]: Without dead ends: 993 [2019-12-27 17:01:44,594 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 17:01:44,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 993 states. [2019-12-27 17:01:44,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 993 to 882. [2019-12-27 17:01:44,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 882 states. [2019-12-27 17:01:44,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1817 transitions. [2019-12-27 17:01:44,611 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1817 transitions. Word has length 51 [2019-12-27 17:01:44,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:01:44,612 INFO L462 AbstractCegarLoop]: Abstraction has 882 states and 1817 transitions. [2019-12-27 17:01:44,612 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:01:44,612 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1817 transitions. [2019-12-27 17:01:44,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 17:01:44,614 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:01:44,614 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 17:01:44,615 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:01:44,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:01:44,615 INFO L82 PathProgramCache]: Analyzing trace with hash -480319677, now seen corresponding path program 1 times [2019-12-27 17:01:44,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:01:44,616 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008593147] [2019-12-27 17:01:44,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:01:44,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:01:44,705 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 17:01:44,705 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008593147] [2019-12-27 17:01:44,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:01:44,706 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:01:44,706 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1484866966] [2019-12-27 17:01:44,706 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:01:44,720 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:01:45,139 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 96 states and 130 transitions. [2019-12-27 17:01:45,139 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:01:45,141 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:01:45,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 17:01:45,141 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:01:45,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 17:01:45,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:01:45,142 INFO L87 Difference]: Start difference. First operand 882 states and 1817 transitions. Second operand 4 states. [2019-12-27 17:01:45,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:01:45,200 INFO L93 Difference]: Finished difference Result 1057 states and 2181 transitions. [2019-12-27 17:01:45,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:01:45,200 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-12-27 17:01:45,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:01:45,203 INFO L225 Difference]: With dead ends: 1057 [2019-12-27 17:01:45,203 INFO L226 Difference]: Without dead ends: 1057 [2019-12-27 17:01:45,204 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 2 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 17:01:45,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057 states. [2019-12-27 17:01:45,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 823. [2019-12-27 17:01:45,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 823 states. [2019-12-27 17:01:45,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1716 transitions. [2019-12-27 17:01:45,220 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1716 transitions. Word has length 52 [2019-12-27 17:01:45,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:01:45,220 INFO L462 AbstractCegarLoop]: Abstraction has 823 states and 1716 transitions. [2019-12-27 17:01:45,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 17:01:45,220 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1716 transitions. [2019-12-27 17:01:45,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 17:01:45,222 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:01:45,223 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 17:01:45,223 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:01:45,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:01:45,223 INFO L82 PathProgramCache]: Analyzing trace with hash -409769665, now seen corresponding path program 1 times [2019-12-27 17:01:45,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:01:45,224 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102015045] [2019-12-27 17:01:45,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:01:45,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 17:01:45,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 17:01:45,371 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 17:01:45,372 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 17:01:45,376 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] ULTIMATE.startENTRY-->L802: Formula: (let ((.cse0 (store |v_#valid_60| 0 0))) (and (= |v_ULTIMATE.start_main_~#t1089~0.offset_19| 0) (= v_~z$mem_tmp~0_25 0) (= v_~y~0_23 0) (= 0 v_~__unbuffered_cnt~0_55) (= v_~x~0_98 0) (= v_~main$tmp_guard1~0_44 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1089~0.base_27|) (= (store .cse0 |v_ULTIMATE.start_main_~#t1089~0.base_27| 1) |v_#valid_58|) (= v_~z$w_buff1~0_160 0) (= 0 v_~weak$$choice0~0_23) (= v_~z$r_buff1_thd1~0_108 0) (= v_~z$r_buff0_thd1~0_174 0) (= v_~z$read_delayed_var~0.offset_7 0) (= 0 v_~__unbuffered_p1_EAX~0_45) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1089~0.base_27|)) (= v_~z$w_buff0~0_252 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1089~0.base_27| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1089~0.base_27|) |v_ULTIMATE.start_main_~#t1089~0.offset_19| 0)) |v_#memory_int_11|) (= v_~z~0_120 0) (= v_~z$r_buff0_thd0~0_134 0) (= v_~z$read_delayed_var~0.base_7 0) (= v_~main$tmp_guard0~0_20 0) (= v_~z$read_delayed~0_7 0) (= 0 v_~z$flush_delayed~0_33) (= |v_#NULL.offset_5| 0) (= v_~z$r_buff1_thd2~0_196 0) (= v_~z$r_buff1_thd0~0_144 0) (= 0 v_~weak$$choice2~0_99) (= v_~z$w_buff0_used~0_606 0) (= v_~z$w_buff1_used~0_306 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1089~0.base_27| 4)) (= 0 |v_#NULL.base_5|) (= v_~__unbuffered_p1_EBX~0_43 0) (= v_~z$r_buff0_thd2~0_279 0) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_12|, #length=|v_#length_18|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_196, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_160, #NULL.offset=|v_#NULL.offset_5|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_44, ULTIMATE.start_main_~#t1090~0.base=|v_ULTIMATE.start_main_~#t1090~0.base_22|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_26|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_370|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_93|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_40|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_134, ULTIMATE.start_main_~#t1089~0.offset=|v_ULTIMATE.start_main_~#t1089~0.offset_19|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_45, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_144, #length=|v_#length_17|, ~y~0=v_~y~0_23, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_279, ~z$mem_tmp~0=v_~z$mem_tmp~0_25, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_43, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_606, ~z$w_buff0~0=v_~z$w_buff0~0_252, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_306, ~z$flush_delayed~0=v_~z$flush_delayed~0_33, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20, #NULL.base=|v_#NULL.base_5|, ~weak$$choice0~0=v_~weak$$choice0~0_23, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_24|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_22|, ULTIMATE.start_main_~#t1089~0.base=|v_ULTIMATE.start_main_~#t1089~0.base_27|, ULTIMATE.start_main_~#t1090~0.offset=|v_ULTIMATE.start_main_~#t1090~0.offset_14|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_31|, #valid=|v_#valid_58|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_108, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_9|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_18|, ~z~0=v_~z~0_120, ~weak$$choice2~0=v_~weak$$choice2~0_99, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_174, ~x~0=v_~x~0_98} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ~z$read_delayed~0, ~z$w_buff1~0, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t1090~0.base, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~z$r_buff0_thd0~0, ULTIMATE.start_main_~#t1089~0.offset, ~__unbuffered_p1_EAX~0, ~z$r_buff1_thd0~0, #length, ~y~0, ~z$r_buff0_thd2~0, ~z$mem_tmp~0, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~main$tmp_guard0~0, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_~#t1089~0.base, ULTIMATE.start_main_~#t1090~0.offset, ULTIMATE.start_main_#res, #valid, ~z$r_buff1_thd1~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~z$read_delayed_var~0.base, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-27 17:01:45,377 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L4-->L740: Formula: (and (= ~z$r_buff0_thd2~0_In618968325 ~z$r_buff1_thd2~0_Out618968325) (not (= P0Thread1of1ForFork0___VERIFIER_assert_~expression_In618968325 0)) (= ~z$r_buff0_thd1~0_In618968325 ~z$r_buff1_thd1~0_Out618968325) (= 1 ~z$r_buff0_thd1~0_Out618968325) (= ~z$r_buff1_thd0~0_Out618968325 ~z$r_buff0_thd0~0_In618968325) (= ~x~0_Out618968325 1)) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In618968325, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In618968325, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In618968325, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In618968325} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In618968325, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out618968325, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out618968325, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out618968325, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In618968325, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out618968325, ~x~0=~x~0_Out618968325, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In618968325} AuxVars[] AssignedVars[~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-27 17:01:45,378 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L802-1-->L804: Formula: (and (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1090~0.base_11| 1)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1090~0.base_11|) (= |v_#memory_int_5| (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t1090~0.base_11| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t1090~0.base_11|) |v_ULTIMATE.start_main_~#t1090~0.offset_10| 1))) (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1090~0.base_11|)) (= 0 |v_ULTIMATE.start_main_~#t1090~0.offset_10|) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t1090~0.base_11| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t1090~0.base_11|))) 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_~#t1090~0.offset=|v_ULTIMATE.start_main_~#t1090~0.offset_10|, #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_~#t1090~0.base=|v_ULTIMATE.start_main_~#t1090~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1090~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t1090~0.base] because there is no mapped edge [2019-12-27 17:01:45,380 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L741-->L741-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1510269296 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd1~0_In1510269296 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out1510269296|)) (and (or .cse1 .cse0) (= ~z$w_buff0_used~0_In1510269296 |P0Thread1of1ForFork0_#t~ite5_Out1510269296|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1510269296, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1510269296} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1510269296|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1510269296, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1510269296} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 17:01:45,380 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L742-->L742-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd1~0_In1755978277 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1755978277 256))) (.cse3 (= (mod ~z$r_buff1_thd1~0_In1755978277 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In1755978277 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite6_Out1755978277| ~z$w_buff1_used~0_In1755978277) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork0_#t~ite6_Out1755978277| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1755978277, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1755978277, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1755978277, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1755978277} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1755978277|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1755978277, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1755978277, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1755978277, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1755978277} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 17:01:45,381 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L743-->L744: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In556723135 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In556723135 256)))) (or (and (= ~z$r_buff0_thd1~0_In556723135 ~z$r_buff0_thd1~0_Out556723135) (or .cse0 .cse1)) (and (not .cse1) (= 0 ~z$r_buff0_thd1~0_Out556723135) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In556723135, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In556723135} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In556723135, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out556723135|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out556723135} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 17:01:45,381 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L744-->L744-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff0_thd1~0_In-1853175601 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1853175601 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd1~0_In-1853175601 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1853175601 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite8_Out-1853175601| ~z$r_buff1_thd1~0_In-1853175601) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork0_#t~ite8_Out-1853175601| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1853175601, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1853175601, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1853175601, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1853175601} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1853175601, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1853175601|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1853175601, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1853175601, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1853175601} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 17:01:45,385 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L744-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~z$r_buff1_thd1~0_68 |v_P0Thread1of1ForFork0_#t~ite8_34|) (= (+ v_~__unbuffered_cnt~0_45 1) v_~__unbuffered_cnt~0_44) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_33|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_68, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 17:01:45,385 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [663] [663] L772-->L773: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_25 256))) (= v_~z$r_buff0_thd2~0_61 v_~z$r_buff0_thd2~0_60)) InVars {~weak$$choice2~0=v_~weak$$choice2~0_25, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_61} OutVars{P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_7|, ~weak$$choice2~0=v_~weak$$choice2~0_25, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_60, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_7|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite27, ~z$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-27 17:01:45,385 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L773-->L773-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-734777683 256)))) (or (and (let ((.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-734777683 256)))) (or (and (= (mod ~z$w_buff1_used~0_In-734777683 256) 0) .cse0) (= (mod ~z$w_buff0_used~0_In-734777683 256) 0) (and .cse0 (= 0 (mod ~z$r_buff1_thd2~0_In-734777683 256))))) (= |P1Thread1of1ForFork1_#t~ite30_Out-734777683| |P1Thread1of1ForFork1_#t~ite29_Out-734777683|) (= ~z$r_buff1_thd2~0_In-734777683 |P1Thread1of1ForFork1_#t~ite29_Out-734777683|) .cse1) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite29_In-734777683| |P1Thread1of1ForFork1_#t~ite29_Out-734777683|) (= |P1Thread1of1ForFork1_#t~ite30_Out-734777683| ~z$r_buff1_thd2~0_In-734777683)))) InVars {P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-734777683|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-734777683, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-734777683, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-734777683, ~weak$$choice2~0=~weak$$choice2~0_In-734777683, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-734777683} OutVars{P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-734777683|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-734777683|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-734777683, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-734777683, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-734777683, ~weak$$choice2~0=~weak$$choice2~0_In-734777683, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-734777683} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-27 17:01:45,386 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L775-->L779: Formula: (and (= v_~z~0_27 v_~z$mem_tmp~0_6) (= 0 v_~z$flush_delayed~0_8) (not (= 0 (mod v_~z$flush_delayed~0_9 256)))) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_6, ~z$flush_delayed~0=v_~z$flush_delayed~0_9} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_6, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~z$flush_delayed~0=v_~z$flush_delayed~0_8, ~z~0=v_~z~0_27} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-27 17:01:45,387 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L779-2-->L779-4: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd2~0_In2104639316 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In2104639316 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite32_Out2104639316| ~z~0_In2104639316) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite32_Out2104639316| ~z$w_buff1~0_In2104639316)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In2104639316, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2104639316, ~z$w_buff1~0=~z$w_buff1~0_In2104639316, ~z~0=~z~0_In2104639316} OutVars{~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In2104639316, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2104639316, ~z$w_buff1~0=~z$w_buff1~0_In2104639316, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out2104639316|, ~z~0=~z~0_In2104639316} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-27 17:01:45,387 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L779-4-->L780: Formula: (= v_~z~0_39 |v_P1Thread1of1ForFork1_#t~ite32_10|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_10|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_9|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_13|, ~z~0=v_~z~0_39} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~z~0] because there is no mapped edge [2019-12-27 17:01:45,387 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L780-->L780-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd2~0_In1703665349 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In1703665349 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite34_Out1703665349| 0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite34_Out1703665349| ~z$w_buff0_used~0_In1703665349) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1703665349, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1703665349} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1703665349, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out1703665349|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1703665349} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 17:01:45,388 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L781-->L781-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In346054134 256))) (.cse0 (= (mod ~z$r_buff0_thd2~0_In346054134 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In346054134 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd2~0_In346054134 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite35_Out346054134| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite35_Out346054134| ~z$w_buff1_used~0_In346054134)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In346054134, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In346054134, ~z$w_buff1_used~0=~z$w_buff1_used~0_In346054134, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In346054134} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In346054134, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In346054134, ~z$w_buff1_used~0=~z$w_buff1_used~0_In346054134, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out346054134|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In346054134} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 17:01:45,388 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L782-->L782-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1525602011 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-1525602011 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite36_Out-1525602011|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite36_Out-1525602011| ~z$r_buff0_thd2~0_In-1525602011)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1525602011, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1525602011} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1525602011, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1525602011, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-1525602011|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 17:01:45,389 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L783-->L783-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1063657758 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-1063657758 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-1063657758 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd2~0_In-1063657758 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite37_Out-1063657758|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~z$r_buff1_thd2~0_In-1063657758 |P1Thread1of1ForFork1_#t~ite37_Out-1063657758|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1063657758, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1063657758, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1063657758, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1063657758} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1063657758, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1063657758, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1063657758, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1063657758, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-1063657758|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 17:01:45,389 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] L783-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= |v_P1Thread1of1ForFork1_#t~ite37_24| v_~z$r_buff1_thd2~0_88) (= v_~__unbuffered_cnt~0_28 (+ v_~__unbuffered_cnt~0_29 1)) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_29, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_24|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_88, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_28, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_23|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 17:01:45,389 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L804-1-->L810: Formula: (and (= v_~main$tmp_guard0~0_7 1) (= 2 v_~__unbuffered_cnt~0_16)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_6|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-27 17:01:45,390 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L810-2-->L810-5: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1185991623 256))) (.cse0 (= (mod ~z$r_buff1_thd0~0_In-1185991623 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite41_Out-1185991623| |ULTIMATE.start_main_#t~ite40_Out-1185991623|))) (or (and (not .cse0) (not .cse1) (= ~z$w_buff1~0_In-1185991623 |ULTIMATE.start_main_#t~ite40_Out-1185991623|) .cse2) (and (or .cse1 .cse0) (= ~z~0_In-1185991623 |ULTIMATE.start_main_#t~ite40_Out-1185991623|) .cse2))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1185991623, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1185991623, ~z$w_buff1~0=~z$w_buff1~0_In-1185991623, ~z~0=~z~0_In-1185991623} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-1185991623|, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1185991623|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1185991623, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1185991623, ~z$w_buff1~0=~z$w_buff1~0_In-1185991623, ~z~0=~z~0_In-1185991623} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 17:01:45,390 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L811-->L811-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-401000586 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-401000586 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-401000586 |ULTIMATE.start_main_#t~ite42_Out-401000586|)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite42_Out-401000586|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-401000586, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-401000586} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-401000586, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-401000586, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-401000586|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 17:01:45,391 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L812-->L812-2: Formula: (let ((.cse3 (= (mod ~z$r_buff1_thd0~0_In-218822900 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In-218822900 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-218822900 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-218822900 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In-218822900 |ULTIMATE.start_main_#t~ite43_Out-218822900|) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |ULTIMATE.start_main_#t~ite43_Out-218822900|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-218822900, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-218822900, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-218822900, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-218822900} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-218822900, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-218822900, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-218822900, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-218822900, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-218822900|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 17:01:45,392 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L813-->L813-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-72383720 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-72383720 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite44_Out-72383720|)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd0~0_In-72383720 |ULTIMATE.start_main_#t~ite44_Out-72383720|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-72383720, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-72383720} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-72383720, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-72383720, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-72383720|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 17:01:45,392 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L814-->L814-2: Formula: (let ((.cse2 (= (mod ~z$r_buff0_thd0~0_In-688424121 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In-688424121 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-688424121 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-688424121 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite45_Out-688424121| ~z$r_buff1_thd0~0_In-688424121)) (and (= |ULTIMATE.start_main_#t~ite45_Out-688424121| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-688424121, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-688424121, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-688424121, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-688424121} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-688424121, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-688424121, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-688424121, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-688424121, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-688424121|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 17:01:45,392 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L814-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_~__unbuffered_p1_EBX~0_28 0) (= v_~z$r_buff1_thd0~0_107 |v_ULTIMATE.start_main_#t~ite45_60|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= 1 v_~__unbuffered_p1_EAX~0_28) (= v_~x~0_67 2) (= v_~main$tmp_guard1~0_22 0)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_28, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_28, ~x~0=v_~x~0_67, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_60|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_28, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_28, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_107, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_22, ~x~0=v_~x~0_67, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_59|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 17:01:45,479 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 05:01:45 BasicIcfg [2019-12-27 17:01:45,479 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 17:01:45,481 INFO L168 Benchmark]: Toolchain (without parser) took 15391.51 ms. Allocated memory was 145.2 MB in the beginning and 622.9 MB in the end (delta: 477.6 MB). Free memory was 101.5 MB in the beginning and 491.3 MB in the end (delta: -389.9 MB). Peak memory consumption was 87.8 MB. Max. memory is 7.1 GB. [2019-12-27 17:01:45,481 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 145.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 17:01:45,482 INFO L168 Benchmark]: CACSL2BoogieTranslator took 756.44 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 101.3 MB in the beginning and 157.2 MB in the end (delta: -56.0 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. [2019-12-27 17:01:45,483 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.23 ms. Allocated memory is still 202.9 MB. Free memory was 156.6 MB in the beginning and 154.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 17:01:45,484 INFO L168 Benchmark]: Boogie Preprocessor took 43.63 ms. Allocated memory is still 202.9 MB. Free memory was 154.6 MB in the beginning and 151.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 17:01:45,484 INFO L168 Benchmark]: RCFGBuilder took 771.57 ms. Allocated memory is still 202.9 MB. Free memory was 151.9 MB in the beginning and 107.8 MB in the end (delta: 44.1 MB). Peak memory consumption was 44.1 MB. Max. memory is 7.1 GB. [2019-12-27 17:01:45,485 INFO L168 Benchmark]: TraceAbstraction took 13753.65 ms. Allocated memory was 202.9 MB in the beginning and 622.9 MB in the end (delta: 420.0 MB). Free memory was 107.1 MB in the beginning and 491.3 MB in the end (delta: -384.2 MB). Peak memory consumption was 35.7 MB. Max. memory is 7.1 GB. [2019-12-27 17:01:45,489 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.17 ms. Allocated memory is still 145.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 756.44 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 101.3 MB in the beginning and 157.2 MB in the end (delta: -56.0 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 61.23 ms. Allocated memory is still 202.9 MB. Free memory was 156.6 MB in the beginning and 154.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.63 ms. Allocated memory is still 202.9 MB. Free memory was 154.6 MB in the beginning and 151.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 771.57 ms. Allocated memory is still 202.9 MB. Free memory was 151.9 MB in the beginning and 107.8 MB in the end (delta: 44.1 MB). Peak memory consumption was 44.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13753.65 ms. Allocated memory was 202.9 MB in the beginning and 622.9 MB in the end (delta: 420.0 MB). Free memory was 107.1 MB in the beginning and 491.3 MB in the end (delta: -384.2 MB). Peak memory consumption was 35.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.2s, 148 ProgramPointsBefore, 77 ProgramPointsAfterwards, 182 TransitionsBefore, 89 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 13 FixpointIterations, 30 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 25 ChoiceCompositions, 4608 VarBasedMoverChecksPositive, 304 VarBasedMoverChecksNegative, 234 SemBasedMoverChecksPositive, 187 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.5s, 0 MoverChecksTotal, 82827 CheckedPairsTotal, 110 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(&t1089, ((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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L726] 1 z$w_buff1 = z$w_buff0 [L727] 1 z$w_buff0 = 1 [L728] 1 z$w_buff1_used = z$w_buff0_used [L729] 1 z$w_buff0_used = (_Bool)1 [L740] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) 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=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L804] FCALL, FORK 0 pthread_create(&t1090, ((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=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L754] 2 x = 2 [L757] 2 y = 1 [L760] 2 __unbuffered_p1_EAX = y [L763] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L764] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L765] 2 z$flush_delayed = weak$$choice2 [L766] 2 z$mem_tmp = z 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=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L767] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$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=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L740] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L741] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L742] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L767] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L768] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) 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, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L769] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) 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, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L770] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) 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, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L771] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) 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, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L773] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L774] 2 __unbuffered_p1_EBX = z 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=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L779] 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) 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=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L780] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L781] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L782] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L810] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) 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=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L810] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L811] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L812] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L813] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 142 locations, 2 error locations. Result: UNSAFE, OverallTime: 13.4s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1928 SDtfs, 1359 SDslu, 3399 SDs, 0 SdLazy, 1964 SolverSat, 58 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 113 GetRequests, 42 SyntacticMatches, 18 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8640occurred 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, 16 MinimizatonAttempts, 2800 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 522 NumberOfCodeBlocks, 522 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 453 ConstructedInterpolants, 0 QuantifiedInterpolants, 83667 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...