/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix056_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 21:43:48,790 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 21:43:48,792 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 21:43:48,810 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 21:43:48,810 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 21:43:48,811 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 21:43:48,812 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 21:43:48,814 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 21:43:48,816 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 21:43:48,816 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 21:43:48,817 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 21:43:48,819 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 21:43:48,819 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 21:43:48,820 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 21:43:48,821 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 21:43:48,822 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 21:43:48,823 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 21:43:48,824 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 21:43:48,825 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 21:43:48,828 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 21:43:48,830 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 21:43:48,831 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 21:43:48,832 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 21:43:48,833 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 21:43:48,835 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 21:43:48,835 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 21:43:48,836 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 21:43:48,837 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 21:43:48,837 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 21:43:48,842 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 21:43:48,842 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 21:43:48,843 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 21:43:48,843 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 21:43:48,844 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 21:43:48,849 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 21:43:48,849 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 21:43:48,850 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 21:43:48,850 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 21:43:48,850 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 21:43:48,853 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 21:43:48,853 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 21:43:48,857 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf [2019-12-27 21:43:48,879 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 21:43:48,879 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 21:43:48,880 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 21:43:48,881 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 21:43:48,881 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 21:43:48,881 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 21:43:48,881 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 21:43:48,881 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 21:43:48,882 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 21:43:48,882 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 21:43:48,882 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 21:43:48,882 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 21:43:48,882 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 21:43:48,883 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 21:43:48,883 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 21:43:48,883 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 21:43:48,883 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 21:43:48,883 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 21:43:48,884 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 21:43:48,884 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 21:43:48,884 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 21:43:48,884 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 21:43:48,885 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 21:43:48,885 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 21:43:48,885 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 21:43:48,885 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 21:43:48,885 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 21:43:48,886 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 21:43:48,886 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 21:43:48,886 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 21:43:48,886 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 21:43:48,886 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 21:43:49,152 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 21:43:49,165 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 21:43:49,168 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 21:43:49,169 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 21:43:49,170 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 21:43:49,170 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix056_tso.oepc.i [2019-12-27 21:43:49,228 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22f0dadef/7af7a12236274560871721e50999eb26/FLAGf7dec20c1 [2019-12-27 21:43:49,820 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 21:43:49,821 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix056_tso.oepc.i [2019-12-27 21:43:49,834 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22f0dadef/7af7a12236274560871721e50999eb26/FLAGf7dec20c1 [2019-12-27 21:43:50,094 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22f0dadef/7af7a12236274560871721e50999eb26 [2019-12-27 21:43:50,104 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 21:43:50,106 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 21:43:50,107 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 21:43:50,107 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 21:43:50,111 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 21:43:50,112 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:43:50" (1/1) ... [2019-12-27 21:43:50,114 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10ee76dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:43:50, skipping insertion in model container [2019-12-27 21:43:50,115 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:43:50" (1/1) ... [2019-12-27 21:43:50,122 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 21:43:50,182 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 21:43:50,695 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:43:50,708 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 21:43:50,799 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:43:50,872 INFO L208 MainTranslator]: Completed translation [2019-12-27 21:43:50,873 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:43:50 WrapperNode [2019-12-27 21:43:50,873 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 21:43:50,874 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 21:43:50,874 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 21:43:50,874 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 21:43:50,884 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:43:50" (1/1) ... [2019-12-27 21:43:50,905 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:43:50" (1/1) ... [2019-12-27 21:43:50,943 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 21:43:50,943 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 21:43:50,943 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 21:43:50,944 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 21:43:50,954 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:43:50" (1/1) ... [2019-12-27 21:43:50,954 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:43:50" (1/1) ... [2019-12-27 21:43:50,959 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:43:50" (1/1) ... [2019-12-27 21:43:50,960 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:43:50" (1/1) ... [2019-12-27 21:43:50,970 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:43:50" (1/1) ... [2019-12-27 21:43:50,975 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:43:50" (1/1) ... [2019-12-27 21:43:50,978 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:43:50" (1/1) ... [2019-12-27 21:43:50,983 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 21:43:50,984 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 21:43:50,984 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 21:43:50,984 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 21:43:50,985 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:43:50" (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 21:43:51,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 21:43:51,040 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 21:43:51,040 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 21:43:51,040 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 21:43:51,040 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 21:43:51,041 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 21:43:51,041 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 21:43:51,041 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 21:43:51,041 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 21:43:51,041 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 21:43:51,041 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 21:43:51,042 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 21:43:51,042 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 21:43:51,044 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 21:43:51,773 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 21:43:51,773 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 21:43:51,775 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:43:51 BoogieIcfgContainer [2019-12-27 21:43:51,775 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 21:43:51,776 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 21:43:51,777 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 21:43:51,780 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 21:43:51,780 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 09:43:50" (1/3) ... [2019-12-27 21:43:51,781 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c025bf2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:43:51, skipping insertion in model container [2019-12-27 21:43:51,781 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:43:50" (2/3) ... [2019-12-27 21:43:51,782 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c025bf2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:43:51, skipping insertion in model container [2019-12-27 21:43:51,782 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:43:51" (3/3) ... [2019-12-27 21:43:51,784 INFO L109 eAbstractionObserver]: Analyzing ICFG mix056_tso.oepc.i [2019-12-27 21:43:51,794 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 21:43:51,794 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 21:43:51,808 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 21:43:51,809 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 21:43:51,845 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:43:51,845 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:43:51,845 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:43:51,846 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:43:51,846 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:43:51,847 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:43:51,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:43:51,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:43:51,848 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:43:51,848 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:43:51,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:43:51,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:43:51,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:43:51,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:43:51,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:43:51,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:43:51,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:43:51,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:43:51,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:43:51,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:43:51,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:43:51,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:43:51,852 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:43:51,852 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:43:51,852 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:43:51,852 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:43:51,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:43:51,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:43:51,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:43:51,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:43:51,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:43:51,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:43:51,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:43:51,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:43:51,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:43:51,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:43:51,856 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:43:51,856 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:43:51,857 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:43:51,857 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:43:51,857 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:43:51,857 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:43:51,858 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:43:51,858 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:43:51,858 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:43:51,859 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:43:51,859 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:43:51,859 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:43:51,859 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:43:51,860 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:43:51,860 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:43:51,860 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:43:51,860 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:43:51,861 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:43:51,861 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:43:51,861 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:43:51,861 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:43:51,862 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:43:51,862 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:43:51,862 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:43:51,862 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:43:51,863 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:43:51,863 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:43:51,863 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:43:51,863 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:43:51,864 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:43:51,864 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:43:51,864 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:43:51,864 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:43:51,865 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:43:51,868 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:43:51,869 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:43:51,869 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:43:51,869 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:43:51,870 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:43:51,870 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:43:51,870 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:43:51,870 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:43:51,871 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:43:51,871 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:43:51,871 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:43:51,871 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:43:51,874 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:43:51,874 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:43:51,875 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:43:51,875 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:43:51,877 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:43:51,877 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:43:51,877 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:43:51,877 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:43:51,878 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:43:51,878 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:43:51,878 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:43:51,878 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:43:51,879 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:43:51,879 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:43:51,913 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 21:43:51,929 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 21:43:51,929 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 21:43:51,929 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 21:43:51,929 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 21:43:51,930 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 21:43:51,930 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 21:43:51,930 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 21:43:51,930 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 21:43:51,947 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 162 places, 193 transitions [2019-12-27 21:43:51,949 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 162 places, 193 transitions [2019-12-27 21:43:52,042 INFO L132 PetriNetUnfolder]: 41/190 cut-off events. [2019-12-27 21:43:52,043 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:43:52,058 INFO L76 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 190 events. 41/190 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 261 event pairs. 0/147 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 21:43:52,077 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 162 places, 193 transitions [2019-12-27 21:43:52,126 INFO L132 PetriNetUnfolder]: 41/190 cut-off events. [2019-12-27 21:43:52,126 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:43:52,132 INFO L76 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 190 events. 41/190 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 261 event pairs. 0/147 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 21:43:52,145 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11490 [2019-12-27 21:43:52,146 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 21:43:55,327 WARN L192 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-27 21:43:55,447 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-27 21:43:55,471 INFO L206 etLargeBlockEncoding]: Checked pairs total: 51676 [2019-12-27 21:43:55,471 INFO L214 etLargeBlockEncoding]: Total number of compositions: 106 [2019-12-27 21:43:55,475 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 86 places, 97 transitions [2019-12-27 21:43:56,622 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 18542 states. [2019-12-27 21:43:56,625 INFO L276 IsEmpty]: Start isEmpty. Operand 18542 states. [2019-12-27 21:43:56,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 21:43:56,633 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:43:56,633 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:43:56,634 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:43:56,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:43:56,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1984617832, now seen corresponding path program 1 times [2019-12-27 21:43:56,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:43:56,658 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224758667] [2019-12-27 21:43:56,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:43:56,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:43:56,939 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 21:43:56,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224758667] [2019-12-27 21:43:56,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:43:56,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 21:43:56,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1085872312] [2019-12-27 21:43:56,944 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:43:56,950 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:43:56,966 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 8 states and 7 transitions. [2019-12-27 21:43:56,966 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:43:56,970 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:43:56,971 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:43:56,971 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:43:56,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:43:56,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:43:56,988 INFO L87 Difference]: Start difference. First operand 18542 states. Second operand 3 states. [2019-12-27 21:43:57,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:43:57,346 INFO L93 Difference]: Finished difference Result 18414 states and 69758 transitions. [2019-12-27 21:43:57,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:43:57,348 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-27 21:43:57,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:43:57,523 INFO L225 Difference]: With dead ends: 18414 [2019-12-27 21:43:57,523 INFO L226 Difference]: Without dead ends: 18050 [2019-12-27 21:43:57,525 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 21:43:58,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18050 states. [2019-12-27 21:43:58,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18050 to 18050. [2019-12-27 21:43:58,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18050 states. [2019-12-27 21:43:58,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18050 states to 18050 states and 68456 transitions. [2019-12-27 21:43:58,993 INFO L78 Accepts]: Start accepts. Automaton has 18050 states and 68456 transitions. Word has length 7 [2019-12-27 21:43:58,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:43:58,995 INFO L462 AbstractCegarLoop]: Abstraction has 18050 states and 68456 transitions. [2019-12-27 21:43:58,995 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:43:58,995 INFO L276 IsEmpty]: Start isEmpty. Operand 18050 states and 68456 transitions. [2019-12-27 21:43:59,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 21:43:59,006 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:43:59,006 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:43:59,006 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:43:59,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:43:59,007 INFO L82 PathProgramCache]: Analyzing trace with hash -975860123, now seen corresponding path program 1 times [2019-12-27 21:43:59,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:43:59,008 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804332449] [2019-12-27 21:43:59,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:43:59,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:43:59,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 21:43:59,116 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804332449] [2019-12-27 21:43:59,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:43:59,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:43:59,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [192404939] [2019-12-27 21:43:59,117 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:43:59,119 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:43:59,125 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 37 transitions. [2019-12-27 21:43:59,125 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:43:59,162 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:43:59,164 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:43:59,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:43:59,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:43:59,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:43:59,165 INFO L87 Difference]: Start difference. First operand 18050 states and 68456 transitions. Second operand 5 states. [2019-12-27 21:43:59,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:43:59,813 INFO L93 Difference]: Finished difference Result 28066 states and 102408 transitions. [2019-12-27 21:43:59,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:43:59,813 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-27 21:43:59,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:44:00,880 INFO L225 Difference]: With dead ends: 28066 [2019-12-27 21:44:00,881 INFO L226 Difference]: Without dead ends: 28052 [2019-12-27 21:44:00,881 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:44:01,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28052 states. [2019-12-27 21:44:01,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28052 to 25418. [2019-12-27 21:44:01,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25418 states. [2019-12-27 21:44:01,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25418 states to 25418 states and 94124 transitions. [2019-12-27 21:44:01,883 INFO L78 Accepts]: Start accepts. Automaton has 25418 states and 94124 transitions. Word has length 13 [2019-12-27 21:44:01,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:44:01,883 INFO L462 AbstractCegarLoop]: Abstraction has 25418 states and 94124 transitions. [2019-12-27 21:44:01,883 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:44:01,884 INFO L276 IsEmpty]: Start isEmpty. Operand 25418 states and 94124 transitions. [2019-12-27 21:44:01,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 21:44:01,888 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:44:01,888 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:44:01,888 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:44:01,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:44:01,889 INFO L82 PathProgramCache]: Analyzing trace with hash -595379205, now seen corresponding path program 1 times [2019-12-27 21:44:01,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:44:01,889 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57915332] [2019-12-27 21:44:01,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:44:01,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:44:01,977 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 21:44:01,977 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57915332] [2019-12-27 21:44:01,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:44:01,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:44:01,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1911696818] [2019-12-27 21:44:01,978 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:44:01,979 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:44:01,981 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 21:44:01,981 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:44:01,982 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:44:01,982 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:44:01,982 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:44:01,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:44:01,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:44:01,983 INFO L87 Difference]: Start difference. First operand 25418 states and 94124 transitions. Second operand 3 states. [2019-12-27 21:44:02,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:44:02,061 INFO L93 Difference]: Finished difference Result 14452 states and 46370 transitions. [2019-12-27 21:44:02,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:44:02,061 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 21:44:02,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:44:02,103 INFO L225 Difference]: With dead ends: 14452 [2019-12-27 21:44:02,103 INFO L226 Difference]: Without dead ends: 14452 [2019-12-27 21:44:02,104 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 21:44:02,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14452 states. [2019-12-27 21:44:02,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14452 to 14452. [2019-12-27 21:44:02,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14452 states. [2019-12-27 21:44:02,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14452 states to 14452 states and 46370 transitions. [2019-12-27 21:44:02,685 INFO L78 Accepts]: Start accepts. Automaton has 14452 states and 46370 transitions. Word has length 13 [2019-12-27 21:44:02,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:44:02,686 INFO L462 AbstractCegarLoop]: Abstraction has 14452 states and 46370 transitions. [2019-12-27 21:44:02,686 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:44:02,686 INFO L276 IsEmpty]: Start isEmpty. Operand 14452 states and 46370 transitions. [2019-12-27 21:44:02,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 21:44:02,687 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:44:02,688 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:44:02,688 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:44:02,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:44:02,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1512112924, now seen corresponding path program 1 times [2019-12-27 21:44:02,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:44:02,689 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827452484] [2019-12-27 21:44:02,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:44:02,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:44:02,735 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 21:44:02,736 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827452484] [2019-12-27 21:44:02,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:44:02,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:44:02,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [890484470] [2019-12-27 21:44:02,737 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:44:02,738 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:44:02,740 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 19 states and 22 transitions. [2019-12-27 21:44:02,740 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:44:02,794 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 21:44:02,795 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:44:02,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:44:02,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:44:02,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:44:02,796 INFO L87 Difference]: Start difference. First operand 14452 states and 46370 transitions. Second operand 6 states. [2019-12-27 21:44:02,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:44:02,839 INFO L93 Difference]: Finished difference Result 2114 states and 4969 transitions. [2019-12-27 21:44:02,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 21:44:02,839 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-12-27 21:44:02,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:44:02,843 INFO L225 Difference]: With dead ends: 2114 [2019-12-27 21:44:02,843 INFO L226 Difference]: Without dead ends: 2114 [2019-12-27 21:44:02,844 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:44:02,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2114 states. [2019-12-27 21:44:02,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2114 to 2114. [2019-12-27 21:44:02,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2114 states. [2019-12-27 21:44:02,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2114 states to 2114 states and 4969 transitions. [2019-12-27 21:44:02,880 INFO L78 Accepts]: Start accepts. Automaton has 2114 states and 4969 transitions. Word has length 14 [2019-12-27 21:44:02,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:44:02,880 INFO L462 AbstractCegarLoop]: Abstraction has 2114 states and 4969 transitions. [2019-12-27 21:44:02,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:44:02,880 INFO L276 IsEmpty]: Start isEmpty. Operand 2114 states and 4969 transitions. [2019-12-27 21:44:02,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 21:44:02,882 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:44:02,882 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 21:44:02,883 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:44:02,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:44:02,883 INFO L82 PathProgramCache]: Analyzing trace with hash 107168072, now seen corresponding path program 1 times [2019-12-27 21:44:02,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:44:02,884 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833007520] [2019-12-27 21:44:02,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:44:02,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:44:02,943 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 21:44:02,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833007520] [2019-12-27 21:44:02,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:44:02,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:44:02,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [394393699] [2019-12-27 21:44:02,944 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:44:02,948 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:44:02,960 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 53 states and 78 transitions. [2019-12-27 21:44:02,960 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:44:02,998 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 21:44:02,998 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 21:44:02,998 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:44:02,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 21:44:02,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:44:02,999 INFO L87 Difference]: Start difference. First operand 2114 states and 4969 transitions. Second operand 7 states. [2019-12-27 21:44:03,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:44:03,040 INFO L93 Difference]: Finished difference Result 699 states and 1627 transitions. [2019-12-27 21:44:03,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:44:03,042 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2019-12-27 21:44:03,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:44:03,044 INFO L225 Difference]: With dead ends: 699 [2019-12-27 21:44:03,044 INFO L226 Difference]: Without dead ends: 655 [2019-12-27 21:44:03,044 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:44:03,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2019-12-27 21:44:03,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 599. [2019-12-27 21:44:03,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2019-12-27 21:44:03,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 1405 transitions. [2019-12-27 21:44:03,055 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 1405 transitions. Word has length 26 [2019-12-27 21:44:03,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:44:03,056 INFO L462 AbstractCegarLoop]: Abstraction has 599 states and 1405 transitions. [2019-12-27 21:44:03,056 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 21:44:03,056 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 1405 transitions. [2019-12-27 21:44:03,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 21:44:03,058 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:44:03,059 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, 1, 1] [2019-12-27 21:44:03,059 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:44:03,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:44:03,059 INFO L82 PathProgramCache]: Analyzing trace with hash 523730057, now seen corresponding path program 1 times [2019-12-27 21:44:03,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:44:03,060 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37807714] [2019-12-27 21:44:03,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:44:03,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:44:03,139 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 21:44:03,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37807714] [2019-12-27 21:44:03,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:44:03,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:44:03,141 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2126896128] [2019-12-27 21:44:03,141 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:44:03,161 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:44:03,215 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 87 states and 116 transitions. [2019-12-27 21:44:03,216 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:44:03,216 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:44:03,217 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:44:03,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:44:03,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:44:03,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:44:03,218 INFO L87 Difference]: Start difference. First operand 599 states and 1405 transitions. Second operand 3 states. [2019-12-27 21:44:03,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:44:03,268 INFO L93 Difference]: Finished difference Result 609 states and 1420 transitions. [2019-12-27 21:44:03,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:44:03,268 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-27 21:44:03,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:44:03,270 INFO L225 Difference]: With dead ends: 609 [2019-12-27 21:44:03,270 INFO L226 Difference]: Without dead ends: 609 [2019-12-27 21:44:03,271 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 21:44:03,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2019-12-27 21:44:03,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 605. [2019-12-27 21:44:03,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-12-27 21:44:03,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 1416 transitions. [2019-12-27 21:44:03,282 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 1416 transitions. Word has length 55 [2019-12-27 21:44:03,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:44:03,282 INFO L462 AbstractCegarLoop]: Abstraction has 605 states and 1416 transitions. [2019-12-27 21:44:03,282 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:44:03,283 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 1416 transitions. [2019-12-27 21:44:03,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 21:44:03,284 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:44:03,285 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, 1, 1] [2019-12-27 21:44:03,285 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:44:03,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:44:03,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1466894421, now seen corresponding path program 1 times [2019-12-27 21:44:03,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:44:03,286 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785254159] [2019-12-27 21:44:03,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:44:03,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:44:03,480 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 21:44:03,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785254159] [2019-12-27 21:44:03,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:44:03,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:44:03,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1237705934] [2019-12-27 21:44:03,482 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:44:03,511 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:44:03,569 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 87 states and 116 transitions. [2019-12-27 21:44:03,569 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:44:03,572 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 21:44:03,572 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:44:03,572 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:44:03,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:44:03,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:44:03,573 INFO L87 Difference]: Start difference. First operand 605 states and 1416 transitions. Second operand 5 states. [2019-12-27 21:44:03,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:44:03,811 INFO L93 Difference]: Finished difference Result 894 states and 2088 transitions. [2019-12-27 21:44:03,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 21:44:03,812 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-12-27 21:44:03,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:44:03,813 INFO L225 Difference]: With dead ends: 894 [2019-12-27 21:44:03,813 INFO L226 Difference]: Without dead ends: 894 [2019-12-27 21:44:03,815 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:44:03,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2019-12-27 21:44:03,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 719. [2019-12-27 21:44:03,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 719 states. [2019-12-27 21:44:03,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 1697 transitions. [2019-12-27 21:44:03,837 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 1697 transitions. Word has length 55 [2019-12-27 21:44:03,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:44:03,838 INFO L462 AbstractCegarLoop]: Abstraction has 719 states and 1697 transitions. [2019-12-27 21:44:03,838 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:44:03,838 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 1697 transitions. [2019-12-27 21:44:03,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 21:44:03,842 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:44:03,842 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, 1, 1] [2019-12-27 21:44:03,842 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:44:03,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:44:03,843 INFO L82 PathProgramCache]: Analyzing trace with hash 1931223363, now seen corresponding path program 2 times [2019-12-27 21:44:03,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:44:03,844 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450164114] [2019-12-27 21:44:03,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:44:03,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:44:04,025 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 21:44:04,026 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450164114] [2019-12-27 21:44:04,027 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:44:04,027 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:44:04,027 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1707411884] [2019-12-27 21:44:04,027 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:44:04,046 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:44:04,098 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 87 states and 112 transitions. [2019-12-27 21:44:04,098 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:44:04,191 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 21:44:04,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 21:44:04,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:44:04,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 21:44:04,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-12-27 21:44:04,192 INFO L87 Difference]: Start difference. First operand 719 states and 1697 transitions. Second operand 10 states. [2019-12-27 21:44:05,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:44:05,397 INFO L93 Difference]: Finished difference Result 1624 states and 3628 transitions. [2019-12-27 21:44:05,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 21:44:05,398 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2019-12-27 21:44:05,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:44:05,404 INFO L225 Difference]: With dead ends: 1624 [2019-12-27 21:44:05,404 INFO L226 Difference]: Without dead ends: 1624 [2019-12-27 21:44:05,405 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 10 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=140, Invalid=322, Unknown=0, NotChecked=0, Total=462 [2019-12-27 21:44:05,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1624 states. [2019-12-27 21:44:05,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1624 to 761. [2019-12-27 21:44:05,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 761 states. [2019-12-27 21:44:05,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 1800 transitions. [2019-12-27 21:44:05,423 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 1800 transitions. Word has length 55 [2019-12-27 21:44:05,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:44:05,423 INFO L462 AbstractCegarLoop]: Abstraction has 761 states and 1800 transitions. [2019-12-27 21:44:05,423 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 21:44:05,423 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 1800 transitions. [2019-12-27 21:44:05,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 21:44:05,426 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:44:05,426 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, 1, 1] [2019-12-27 21:44:05,426 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:44:05,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:44:05,427 INFO L82 PathProgramCache]: Analyzing trace with hash 891728533, now seen corresponding path program 3 times [2019-12-27 21:44:05,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:44:05,428 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206172945] [2019-12-27 21:44:05,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:44:05,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:44:05,585 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 21:44:05,586 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206172945] [2019-12-27 21:44:05,586 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:44:05,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:44:05,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [114395971] [2019-12-27 21:44:05,586 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:44:05,605 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:44:05,651 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 83 states and 106 transitions. [2019-12-27 21:44:05,652 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:44:05,652 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:44:05,653 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:44:05,653 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:44:05,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:44:05,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:44:05,653 INFO L87 Difference]: Start difference. First operand 761 states and 1800 transitions. Second operand 3 states. [2019-12-27 21:44:05,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:44:05,704 INFO L93 Difference]: Finished difference Result 760 states and 1798 transitions. [2019-12-27 21:44:05,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:44:05,705 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-27 21:44:05,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:44:05,706 INFO L225 Difference]: With dead ends: 760 [2019-12-27 21:44:05,706 INFO L226 Difference]: Without dead ends: 760 [2019-12-27 21:44:05,707 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 21:44:05,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2019-12-27 21:44:05,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 539. [2019-12-27 21:44:05,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 539 states. [2019-12-27 21:44:05,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 1284 transitions. [2019-12-27 21:44:05,718 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 1284 transitions. Word has length 55 [2019-12-27 21:44:05,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:44:05,718 INFO L462 AbstractCegarLoop]: Abstraction has 539 states and 1284 transitions. [2019-12-27 21:44:05,718 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:44:05,719 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 1284 transitions. [2019-12-27 21:44:05,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 21:44:05,721 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:44:05,721 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, 1, 1, 1] [2019-12-27 21:44:05,721 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:44:05,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:44:05,722 INFO L82 PathProgramCache]: Analyzing trace with hash -660404610, now seen corresponding path program 1 times [2019-12-27 21:44:05,722 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:44:05,723 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613125164] [2019-12-27 21:44:05,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:44:05,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:44:05,855 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 21:44:05,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613125164] [2019-12-27 21:44:05,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:44:05,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:44:05,857 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1616278400] [2019-12-27 21:44:05,857 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:44:05,877 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:44:05,923 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 88 states and 115 transitions. [2019-12-27 21:44:05,923 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:44:05,929 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 21:44:05,929 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:44:05,929 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:44:05,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:44:05,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:44:05,930 INFO L87 Difference]: Start difference. First operand 539 states and 1284 transitions. Second operand 6 states. [2019-12-27 21:44:06,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:44:06,013 INFO L93 Difference]: Finished difference Result 910 states and 2076 transitions. [2019-12-27 21:44:06,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 21:44:06,014 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-12-27 21:44:06,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:44:06,015 INFO L225 Difference]: With dead ends: 910 [2019-12-27 21:44:06,015 INFO L226 Difference]: Without dead ends: 373 [2019-12-27 21:44:06,015 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:44:06,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2019-12-27 21:44:06,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 320. [2019-12-27 21:44:06,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-12-27 21:44:06,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 604 transitions. [2019-12-27 21:44:06,022 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 604 transitions. Word has length 56 [2019-12-27 21:44:06,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:44:06,022 INFO L462 AbstractCegarLoop]: Abstraction has 320 states and 604 transitions. [2019-12-27 21:44:06,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:44:06,022 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 604 transitions. [2019-12-27 21:44:06,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 21:44:06,023 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:44:06,024 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, 1, 1, 1] [2019-12-27 21:44:06,024 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:44:06,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:44:06,024 INFO L82 PathProgramCache]: Analyzing trace with hash 172958554, now seen corresponding path program 2 times [2019-12-27 21:44:06,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:44:06,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173681915] [2019-12-27 21:44:06,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:44:06,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:44:06,091 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 21:44:06,092 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173681915] [2019-12-27 21:44:06,092 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:44:06,092 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:44:06,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1047574091] [2019-12-27 21:44:06,093 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:44:06,111 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:44:06,175 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 118 states and 157 transitions. [2019-12-27 21:44:06,176 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:44:06,185 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 21:44:06,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:44:06,185 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:44:06,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:44:06,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:44:06,186 INFO L87 Difference]: Start difference. First operand 320 states and 604 transitions. Second operand 4 states. [2019-12-27 21:44:06,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:44:06,290 INFO L93 Difference]: Finished difference Result 372 states and 674 transitions. [2019-12-27 21:44:06,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:44:06,291 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-12-27 21:44:06,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:44:06,292 INFO L225 Difference]: With dead ends: 372 [2019-12-27 21:44:06,292 INFO L226 Difference]: Without dead ends: 372 [2019-12-27 21:44:06,292 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 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 21:44:06,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2019-12-27 21:44:06,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 279. [2019-12-27 21:44:06,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2019-12-27 21:44:06,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 509 transitions. [2019-12-27 21:44:06,297 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 509 transitions. Word has length 56 [2019-12-27 21:44:06,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:44:06,297 INFO L462 AbstractCegarLoop]: Abstraction has 279 states and 509 transitions. [2019-12-27 21:44:06,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:44:06,297 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 509 transitions. [2019-12-27 21:44:06,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 21:44:06,298 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:44:06,299 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, 1, 1, 1, 1] [2019-12-27 21:44:06,299 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:44:06,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:44:06,299 INFO L82 PathProgramCache]: Analyzing trace with hash 543693155, now seen corresponding path program 1 times [2019-12-27 21:44:06,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:44:06,300 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234558082] [2019-12-27 21:44:06,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:44:06,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:44:06,590 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 21:44:06,591 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234558082] [2019-12-27 21:44:06,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:44:06,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 21:44:06,592 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1778238861] [2019-12-27 21:44:06,592 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:44:06,614 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:44:06,697 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 108 states and 135 transitions. [2019-12-27 21:44:06,697 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:44:06,746 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 21:44:06,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 21:44:06,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:44:06,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 21:44:06,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-12-27 21:44:06,748 INFO L87 Difference]: Start difference. First operand 279 states and 509 transitions. Second operand 13 states. [2019-12-27 21:44:07,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:44:07,365 INFO L93 Difference]: Finished difference Result 493 states and 880 transitions. [2019-12-27 21:44:07,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 21:44:07,368 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 57 [2019-12-27 21:44:07,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:44:07,370 INFO L225 Difference]: With dead ends: 493 [2019-12-27 21:44:07,370 INFO L226 Difference]: Without dead ends: 461 [2019-12-27 21:44:07,371 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=127, Invalid=523, Unknown=0, NotChecked=0, Total=650 [2019-12-27 21:44:07,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2019-12-27 21:44:07,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 379. [2019-12-27 21:44:07,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2019-12-27 21:44:07,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 680 transitions. [2019-12-27 21:44:07,377 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 680 transitions. Word has length 57 [2019-12-27 21:44:07,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:44:07,378 INFO L462 AbstractCegarLoop]: Abstraction has 379 states and 680 transitions. [2019-12-27 21:44:07,378 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 21:44:07,378 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 680 transitions. [2019-12-27 21:44:07,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 21:44:07,379 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:44:07,379 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, 1, 1, 1, 1] [2019-12-27 21:44:07,379 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:44:07,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:44:07,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1607584303, now seen corresponding path program 2 times [2019-12-27 21:44:07,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:44:07,383 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455562956] [2019-12-27 21:44:07,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:44:07,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:44:07,644 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 21:44:07,644 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455562956] [2019-12-27 21:44:07,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:44:07,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 21:44:07,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2000806009] [2019-12-27 21:44:07,645 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:44:07,661 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:44:07,726 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 128 states and 184 transitions. [2019-12-27 21:44:07,726 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:44:07,766 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 21:44:07,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 21:44:07,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:44:07,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 21:44:07,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-12-27 21:44:07,767 INFO L87 Difference]: Start difference. First operand 379 states and 680 transitions. Second operand 13 states. [2019-12-27 21:44:08,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:44:08,398 INFO L93 Difference]: Finished difference Result 517 states and 910 transitions. [2019-12-27 21:44:08,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 21:44:08,398 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 57 [2019-12-27 21:44:08,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:44:08,399 INFO L225 Difference]: With dead ends: 517 [2019-12-27 21:44:08,399 INFO L226 Difference]: Without dead ends: 485 [2019-12-27 21:44:08,400 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=118, Invalid=482, Unknown=0, NotChecked=0, Total=600 [2019-12-27 21:44:08,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2019-12-27 21:44:08,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 387. [2019-12-27 21:44:08,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2019-12-27 21:44:08,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 694 transitions. [2019-12-27 21:44:08,405 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 694 transitions. Word has length 57 [2019-12-27 21:44:08,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:44:08,406 INFO L462 AbstractCegarLoop]: Abstraction has 387 states and 694 transitions. [2019-12-27 21:44:08,406 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 21:44:08,406 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 694 transitions. [2019-12-27 21:44:08,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 21:44:08,407 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:44:08,407 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, 1, 1, 1, 1] [2019-12-27 21:44:08,408 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:44:08,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:44:08,408 INFO L82 PathProgramCache]: Analyzing trace with hash 1879148695, now seen corresponding path program 3 times [2019-12-27 21:44:08,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:44:08,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537924333] [2019-12-27 21:44:08,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:44:08,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:44:08,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:44:08,514 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 21:44:08,514 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 21:44:08,518 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] ULTIMATE.startENTRY-->L800: Formula: (let ((.cse0 (store |v_#valid_66| 0 0))) (and (= |v_#valid_64| (store .cse0 |v_ULTIMATE.start_main_~#t1507~0.base_27| 1)) (= 0 v_~weak$$choice0~0_8) (= 0 v_~y$read_delayed_var~0.offset_7) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t1507~0.base_27| 4)) (= 0 v_~y$r_buff1_thd0~0_45) (= v_~y~0_25 0) (= v_~y$r_buff0_thd1~0_8 0) (= 0 v_~y$w_buff1~0_24) (= v_~main$tmp_guard0~0_9 0) (= |v_#NULL.offset_6| 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1507~0.base_27|) 0) (= v_~y$read_delayed~0_7 0) (= v_~main$tmp_guard1~0_11 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t1507~0.base_27|) (= v_~y$r_buff0_thd2~0_19 0) (= v_~y$w_buff0_used~0_103 0) (= 0 v_~weak$$choice2~0_32) (= v_~y$r_buff1_thd1~0_8 0) (= 0 v_~y$flush_delayed~0_13) (< 0 |v_#StackHeapBarrier_18|) (= v_~y$r_buff0_thd3~0_25 0) (= 0 v_~__unbuffered_p2_EAX~0_10) (= 0 |v_#NULL.base_6|) (= 0 v_~y$read_delayed_var~0.base_7) (= 0 v_~y$w_buff0~0_25) (= 0 v_~__unbuffered_cnt~0_22) (= 0 v_~y$r_buff1_thd3~0_18) (= v_~z~0_12 0) (= v_~y$mem_tmp~0_10 0) (= 0 |v_ULTIMATE.start_main_~#t1507~0.offset_20|) (= v_~x~0_12 0) (= (store |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1507~0.base_27| (store (select |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1507~0.base_27|) |v_ULTIMATE.start_main_~#t1507~0.offset_20| 0)) |v_#memory_int_25|) (= v_~y$r_buff0_thd0~0_76 0) (= 0 v_~y$r_buff1_thd2~0_16) (= v_~y$w_buff1_used~0_63 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_26|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_13|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_13|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_11|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_14|, ULTIMATE.start_main_~#t1507~0.base=|v_ULTIMATE.start_main_~#t1507~0.base_27|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_11|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_13|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$mem_tmp~0=v_~y$mem_tmp~0_10, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_18, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_8, ~y$flush_delayed~0=v_~y$flush_delayed~0_13, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_13|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_13|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_9|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_16|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_14|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_14|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_13|, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_15|, ~y$w_buff1~0=v_~y$w_buff1~0_24, ULTIMATE.start_main_~#t1507~0.offset=|v_ULTIMATE.start_main_~#t1507~0.offset_20|, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_~#t1508~0.base=|v_ULTIMATE.start_main_~#t1508~0.base_27|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_19, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_9|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_45, ~x~0=v_~x~0_12, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_103, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_15|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_16|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_11, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_13|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_11|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_15|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_11|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_16|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_8, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_15|, ~y$w_buff0~0=v_~y$w_buff0~0_25, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_25, ULTIMATE.start_main_~#t1508~0.offset=|v_ULTIMATE.start_main_~#t1508~0.offset_20|, ~y~0=v_~y~0_25, ULTIMATE.start_main_~#t1509~0.base=|v_ULTIMATE.start_main_~#t1509~0.base_22|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_13|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_9|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_13|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_16|, ULTIMATE.start_main_~#t1509~0.offset=|v_ULTIMATE.start_main_~#t1509~0.offset_15|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_16|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_14|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_16, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_17|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_76, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_9|, ~z~0=v_~z~0_12, ~weak$$choice2~0=v_~weak$$choice2~0_32, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_63} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_~#t1507~0.base, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ULTIMATE.start_main_~#t1507~0.offset, ~y$read_delayed_var~0.base, ULTIMATE.start_main_~#t1508~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite30, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ULTIMATE.start_main_~#t1508~0.offset, ~y~0, ULTIMATE.start_main_~#t1509~0.base, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_~#t1509~0.offset, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 21:44:08,519 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L800-1-->L802: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t1508~0.base_13|)) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1508~0.base_13| 1)) (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1508~0.base_13|)) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1508~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1508~0.base_13|) |v_ULTIMATE.start_main_~#t1508~0.offset_11| 1)) |v_#memory_int_17|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1508~0.base_13|) (= 0 |v_ULTIMATE.start_main_~#t1508~0.offset_11|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1508~0.base_13| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t1508~0.base=|v_ULTIMATE.start_main_~#t1508~0.base_13|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t1508~0.offset=|v_ULTIMATE.start_main_~#t1508~0.offset_11|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1508~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t1508~0.offset, ULTIMATE.start_main_#t~nondet15, #length] because there is no mapped edge [2019-12-27 21:44:08,520 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L802-1-->L804: Formula: (and (= |v_#valid_38| (store |v_#valid_39| |v_ULTIMATE.start_main_~#t1509~0.base_12| 1)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1509~0.base_12| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1509~0.base_12|) |v_ULTIMATE.start_main_~#t1509~0.offset_10| 2)) |v_#memory_int_15|) (= 0 |v_ULTIMATE.start_main_~#t1509~0.offset_10|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1509~0.base_12|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1509~0.base_12| 4)) (= 0 (select |v_#valid_39| |v_ULTIMATE.start_main_~#t1509~0.base_12|)) (not (= |v_ULTIMATE.start_main_~#t1509~0.base_12| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, ULTIMATE.start_main_~#t1509~0.offset=|v_ULTIMATE.start_main_~#t1509~0.offset_10|, #length=|v_#length_15|, ULTIMATE.start_main_~#t1509~0.base=|v_ULTIMATE.start_main_~#t1509~0.base_12|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_~#t1509~0.offset, #length, ULTIMATE.start_main_~#t1509~0.base] because there is no mapped edge [2019-12-27 21:44:08,521 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [641] [641] P2ENTRY-->L4-3: Formula: (and (= 1 v_~y$w_buff0_used~0_79) (= 1 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|) (= (mod v_~y$w_buff1_used~0_51 256) 0) (= v_~y$w_buff1_used~0_51 v_~y$w_buff0_used~0_80) (= |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_4| v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_8) (= v_~y$w_buff0~0_16 v_~y$w_buff1~0_16) (= 2 v_~y$w_buff0~0_15) (= v_P2Thread1of1ForFork0_~arg.offset_4 |v_P2Thread1of1ForFork0_#in~arg.offset_4|) (= v_P2Thread1of1ForFork0_~arg.base_4 |v_P2Thread1of1ForFork0_#in~arg.base_4|)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_4|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_80, ~y$w_buff0~0=v_~y$w_buff0~0_16, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_4|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_4, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_4|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_79, ~y$w_buff1~0=v_~y$w_buff1~0_16, ~y$w_buff0~0=v_~y$w_buff0~0_15, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_4, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_4|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_8, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_51} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0___VERIFIER_assert_~expression, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 21:44:08,522 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork1_~arg.base_5 |v_P0Thread1of1ForFork1_#in~arg.base_5|) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= 1 v_~x~0_9) (= v_P0Thread1of1ForFork1_~arg.offset_5 |v_P0Thread1of1ForFork1_#in~arg.offset_5|) (= 1 v_~z~0_7) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_5, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~z~0=v_~z~0_7, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, ~x~0=v_~x~0_9, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_5} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~z~0, ~x~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-27 21:44:08,524 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L778-->L778-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In-235838613 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-235838613 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite11_Out-235838613| 0)) (and (= ~y$w_buff0_used~0_In-235838613 |P2Thread1of1ForFork0_#t~ite11_Out-235838613|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-235838613, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-235838613} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-235838613, P2Thread1of1ForFork0_#t~ite11=|P2Thread1of1ForFork0_#t~ite11_Out-235838613|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-235838613} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite11] because there is no mapped edge [2019-12-27 21:44:08,525 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [694] [694] L748-2-->L748-4: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In395280359 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In395280359 256)))) (or (and (or .cse0 .cse1) (= ~y~0_In395280359 |P1Thread1of1ForFork2_#t~ite3_Out395280359|)) (and (not .cse0) (not .cse1) (= ~y$w_buff1~0_In395280359 |P1Thread1of1ForFork2_#t~ite3_Out395280359|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In395280359, ~y$w_buff1~0=~y$w_buff1~0_In395280359, ~y~0=~y~0_In395280359, ~y$w_buff1_used~0=~y$w_buff1_used~0_In395280359} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In395280359, ~y$w_buff1~0=~y$w_buff1~0_In395280359, ~y~0=~y~0_In395280359, P1Thread1of1ForFork2_#t~ite3=|P1Thread1of1ForFork2_#t~ite3_Out395280359|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In395280359} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-27 21:44:08,525 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [618] [618] L748-4-->L749: Formula: (= v_~y~0_16 |v_P1Thread1of1ForFork2_#t~ite3_8|) InVars {P1Thread1of1ForFork2_#t~ite3=|v_P1Thread1of1ForFork2_#t~ite3_8|} OutVars{P1Thread1of1ForFork2_#t~ite4=|v_P1Thread1of1ForFork2_#t~ite4_7|, ~y~0=v_~y~0_16, P1Thread1of1ForFork2_#t~ite3=|v_P1Thread1of1ForFork2_#t~ite3_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite4, ~y~0, P1Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-27 21:44:08,525 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L749-->L749-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1287439477 256))) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-1287439477 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite5_Out-1287439477| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite5_Out-1287439477| ~y$w_buff0_used~0_In-1287439477)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1287439477, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1287439477} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1287439477, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1287439477, P1Thread1of1ForFork2_#t~ite5=|P1Thread1of1ForFork2_#t~ite5_Out-1287439477|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-27 21:44:08,526 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L750-->L750-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In2005960575 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd2~0_In2005960575 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd2~0_In2005960575 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In2005960575 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite6_Out2005960575| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P1Thread1of1ForFork2_#t~ite6_Out2005960575| ~y$w_buff1_used~0_In2005960575) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2005960575, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2005960575, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2005960575, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2005960575} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2005960575, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2005960575, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2005960575, P1Thread1of1ForFork2_#t~ite6=|P1Thread1of1ForFork2_#t~ite6_Out2005960575|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2005960575} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-27 21:44:08,527 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L751-->L751-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1576054206 256))) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-1576054206 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd2~0_In-1576054206 |P1Thread1of1ForFork2_#t~ite7_Out-1576054206|)) (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork2_#t~ite7_Out-1576054206|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1576054206, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1576054206} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1576054206, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1576054206, P1Thread1of1ForFork2_#t~ite7=|P1Thread1of1ForFork2_#t~ite7_Out-1576054206|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-27 21:44:08,528 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L779-->L779-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In1385491016 256))) (.cse3 (= (mod ~y$r_buff1_thd3~0_In1385491016 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1385491016 256))) (.cse1 (= (mod ~y$r_buff0_thd3~0_In1385491016 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork0_#t~ite12_Out1385491016| ~y$w_buff1_used~0_In1385491016)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |P2Thread1of1ForFork0_#t~ite12_Out1385491016| 0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1385491016, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1385491016, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1385491016, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1385491016} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1385491016, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1385491016, P2Thread1of1ForFork0_#t~ite12=|P2Thread1of1ForFork0_#t~ite12_Out1385491016|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1385491016, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1385491016} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-27 21:44:08,528 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L752-->L752-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In-2146885020 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-2146885020 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-2146885020 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-2146885020 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork2_#t~ite8_Out-2146885020| ~y$r_buff1_thd2~0_In-2146885020)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P1Thread1of1ForFork2_#t~ite8_Out-2146885020| 0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2146885020, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2146885020, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2146885020, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2146885020} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2146885020, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2146885020, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_Out-2146885020|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2146885020, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2146885020} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 21:44:08,528 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L752-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= |v_P1Thread1of1ForFork2_#t~ite8_8| v_~y$r_buff1_thd2~0_12) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {P1Thread1of1ForFork2_#t~ite8=|v_P1Thread1of1ForFork2_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_12, P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, P1Thread1of1ForFork2_#t~ite8=|v_P1Thread1of1ForFork2_#t~ite8_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork2_#res.offset, P1Thread1of1ForFork2_#t~ite8, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 21:44:08,529 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L780-->L781: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In-1628529186 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-1628529186 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd3~0_In-1628529186 ~y$r_buff0_thd3~0_Out-1628529186)) (and (= ~y$r_buff0_thd3~0_Out-1628529186 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1628529186, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1628529186} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1628529186, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-1628529186, P2Thread1of1ForFork0_#t~ite13=|P2Thread1of1ForFork0_#t~ite13_Out-1628529186|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite13] because there is no mapped edge [2019-12-27 21:44:08,529 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L781-->L781-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In-568970341 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-568970341 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd3~0_In-568970341 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In-568970341 256) 0))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite14_Out-568970341|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~y$r_buff1_thd3~0_In-568970341 |P2Thread1of1ForFork0_#t~ite14_Out-568970341|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-568970341, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-568970341, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-568970341, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-568970341} OutVars{P2Thread1of1ForFork0_#t~ite14=|P2Thread1of1ForFork0_#t~ite14_Out-568970341|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-568970341, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-568970341, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-568970341, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-568970341} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-27 21:44:08,529 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L781-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= v_~y$r_buff1_thd3~0_14 |v_P2Thread1of1ForFork0_#t~ite14_8|) (= v_~__unbuffered_cnt~0_18 (+ v_~__unbuffered_cnt~0_19 1))) InVars {P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19} OutVars{P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_7|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_14, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14, ~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 21:44:08,529 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [617] [617] L804-1-->L810: Formula: (and (= v_~__unbuffered_cnt~0_9 3) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_3|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet17, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 21:44:08,530 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L810-2-->L810-4: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In1586353990 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In1586353990 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite18_Out1586353990| ~y~0_In1586353990)) (and (= ~y$w_buff1~0_In1586353990 |ULTIMATE.start_main_#t~ite18_Out1586353990|) (not .cse1) (not .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1586353990, ~y~0=~y~0_In1586353990, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1586353990, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1586353990} OutVars{~y$w_buff1~0=~y$w_buff1~0_In1586353990, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out1586353990|, ~y~0=~y~0_In1586353990, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1586353990, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1586353990} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite18] because there is no mapped edge [2019-12-27 21:44:08,530 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [636] [636] L810-4-->L811: Formula: (= v_~y~0_18 |v_ULTIMATE.start_main_#t~ite18_7|) InVars {ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_7|} OutVars{ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_6|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_6|, ~y~0=v_~y~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19, ~y~0] because there is no mapped edge [2019-12-27 21:44:08,531 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L811-->L811-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-1410808844 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-1410808844 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite20_Out-1410808844| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite20_Out-1410808844| ~y$w_buff0_used~0_In-1410808844) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1410808844, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1410808844} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1410808844, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1410808844, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-1410808844|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 21:44:08,531 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L812-->L812-2: Formula: (let ((.cse2 (= (mod ~y$w_buff1_used~0_In-1020492159 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In-1020492159 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1020492159 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-1020492159 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In-1020492159 |ULTIMATE.start_main_#t~ite21_Out-1020492159|)) (and (= |ULTIMATE.start_main_#t~ite21_Out-1020492159| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1020492159, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1020492159, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1020492159, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1020492159} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1020492159, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1020492159, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-1020492159|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1020492159, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1020492159} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 21:44:08,532 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L813-->L813-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-2129231752 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-2129231752 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In-2129231752 |ULTIMATE.start_main_#t~ite22_Out-2129231752|)) (and (= 0 |ULTIMATE.start_main_#t~ite22_Out-2129231752|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2129231752, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2129231752} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2129231752, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2129231752, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-2129231752|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 21:44:08,533 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [684] [684] L814-->L814-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In1739815935 256))) (.cse2 (= (mod ~y$r_buff1_thd0~0_In1739815935 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In1739815935 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1739815935 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd0~0_In1739815935 |ULTIMATE.start_main_#t~ite23_Out1739815935|)) (and (= 0 |ULTIMATE.start_main_#t~ite23_Out1739815935|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1739815935, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1739815935, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1739815935, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1739815935} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1739815935, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1739815935, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1739815935, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out1739815935|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1739815935} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-27 21:44:08,535 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L822-->L822-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-464817903 256) 0))) (or (and (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-464817903 256) 0))) (or (and (= (mod ~y$w_buff1_used~0_In-464817903 256) 0) .cse0) (and .cse0 (= (mod ~y$r_buff1_thd0~0_In-464817903 256) 0)) (= (mod ~y$w_buff0_used~0_In-464817903 256) 0))) (= ~y$w_buff0~0_In-464817903 |ULTIMATE.start_main_#t~ite29_Out-464817903|) (= |ULTIMATE.start_main_#t~ite30_Out-464817903| |ULTIMATE.start_main_#t~ite29_Out-464817903|) .cse1) (and (= |ULTIMATE.start_main_#t~ite29_In-464817903| |ULTIMATE.start_main_#t~ite29_Out-464817903|) (not .cse1) (= |ULTIMATE.start_main_#t~ite30_Out-464817903| ~y$w_buff0~0_In-464817903)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-464817903, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_In-464817903|, ~y$w_buff0~0=~y$w_buff0~0_In-464817903, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-464817903, ~weak$$choice2~0=~weak$$choice2~0_In-464817903, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-464817903, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-464817903} OutVars{ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_Out-464817903|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-464817903, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-464817903|, ~y$w_buff0~0=~y$w_buff0~0_In-464817903, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-464817903, ~weak$$choice2~0=~weak$$choice2~0_In-464817903, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-464817903, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-464817903} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-27 21:44:08,539 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L826-->L827: Formula: (and (not (= (mod v_~weak$$choice2~0_21 256) 0)) (= v_~y$r_buff0_thd0~0_54 v_~y$r_buff0_thd0~0_53)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_54, ~weak$$choice2~0=v_~weak$$choice2~0_21} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_6|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_53, ~weak$$choice2~0=v_~weak$$choice2~0_21, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 21:44:08,540 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L829-->L832-1: Formula: (and (= 0 v_~y$flush_delayed~0_10) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5| (mod v_~main$tmp_guard1~0_8 256)) (= v_~y~0_23 v_~y$mem_tmp~0_7) (not (= 0 (mod v_~y$flush_delayed~0_11 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_11, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_10, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_12|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~y~0=v_~y~0_23, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[~y$flush_delayed~0, ULTIMATE.start_main_#t~ite46, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 21:44:08,540 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L832-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 21:44:08,639 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 09:44:08 BasicIcfg [2019-12-27 21:44:08,640 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 21:44:08,642 INFO L168 Benchmark]: Toolchain (without parser) took 18535.78 ms. Allocated memory was 145.8 MB in the beginning and 895.0 MB in the end (delta: 749.2 MB). Free memory was 102.0 MB in the beginning and 617.2 MB in the end (delta: -515.2 MB). Peak memory consumption was 234.0 MB. Max. memory is 7.1 GB. [2019-12-27 21:44:08,642 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 21:44:08,643 INFO L168 Benchmark]: CACSL2BoogieTranslator took 766.35 ms. Allocated memory was 145.8 MB in the beginning and 205.0 MB in the end (delta: 59.2 MB). Free memory was 101.6 MB in the beginning and 159.1 MB in the end (delta: -57.5 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. [2019-12-27 21:44:08,644 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.89 ms. Allocated memory is still 205.0 MB. Free memory was 158.4 MB in the beginning and 155.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 21:44:08,645 INFO L168 Benchmark]: Boogie Preprocessor took 40.49 ms. Allocated memory is still 205.0 MB. Free memory was 155.8 MB in the beginning and 153.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 21:44:08,650 INFO L168 Benchmark]: RCFGBuilder took 791.12 ms. Allocated memory is still 205.0 MB. Free memory was 153.2 MB in the beginning and 107.1 MB in the end (delta: 46.1 MB). Peak memory consumption was 46.1 MB. Max. memory is 7.1 GB. [2019-12-27 21:44:08,650 INFO L168 Benchmark]: TraceAbstraction took 16863.38 ms. Allocated memory was 205.0 MB in the beginning and 895.0 MB in the end (delta: 690.0 MB). Free memory was 106.4 MB in the beginning and 617.2 MB in the end (delta: -510.8 MB). Peak memory consumption was 179.2 MB. Max. memory is 7.1 GB. [2019-12-27 21:44:08,657 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.27 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 766.35 ms. Allocated memory was 145.8 MB in the beginning and 205.0 MB in the end (delta: 59.2 MB). Free memory was 101.6 MB in the beginning and 159.1 MB in the end (delta: -57.5 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 68.89 ms. Allocated memory is still 205.0 MB. Free memory was 158.4 MB in the beginning and 155.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.49 ms. Allocated memory is still 205.0 MB. Free memory was 155.8 MB in the beginning and 153.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 791.12 ms. Allocated memory is still 205.0 MB. Free memory was 153.2 MB in the beginning and 107.1 MB in the end (delta: 46.1 MB). Peak memory consumption was 46.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 16863.38 ms. Allocated memory was 205.0 MB in the beginning and 895.0 MB in the end (delta: 690.0 MB). Free memory was 106.4 MB in the beginning and 617.2 MB in the end (delta: -510.8 MB). Peak memory consumption was 179.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.5s, 162 ProgramPointsBefore, 86 ProgramPointsAfterwards, 193 TransitionsBefore, 97 TransitionsAfterwards, 11490 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 24 ChoiceCompositions, 3760 VarBasedMoverChecksPositive, 156 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 51676 CheckedPairsTotal, 106 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L800] FCALL, FORK 0 pthread_create(&t1507, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L802] FCALL, FORK 0 pthread_create(&t1508, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L804] FCALL, FORK 0 pthread_create(&t1509, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L767] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L768] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L769] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L770] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L771] 3 y$r_buff0_thd3 = (_Bool)1 [L774] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L777] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L742] 2 x = 2 [L745] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L777] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L748] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L749] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L750] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L751] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L778] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L779] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L810] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L811] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L812] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L813] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L814] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L817] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L818] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L819] 0 y$flush_delayed = weak$$choice2 [L820] 0 y$mem_tmp = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L821] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L821] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L822] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L823] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L823] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L824] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L824] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L825] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L825] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L827] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L827] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L828] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 153 locations, 2 error locations. Result: UNSAFE, OverallTime: 16.5s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 5.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1367 SDtfs, 1772 SDslu, 3624 SDs, 0 SdLazy, 1996 SolverSat, 195 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 151 GetRequests, 36 SyntacticMatches, 18 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25418occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 4279 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 576 NumberOfCodeBlocks, 576 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 506 ConstructedInterpolants, 0 QuantifiedInterpolants, 114513 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...