/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix047_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 17:37:08,726 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 17:37:08,729 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 17:37:08,749 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 17:37:08,749 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 17:37:08,751 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 17:37:08,753 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 17:37:08,763 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 17:37:08,768 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 17:37:08,770 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 17:37:08,773 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 17:37:08,774 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 17:37:08,775 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 17:37:08,776 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 17:37:08,779 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 17:37:08,780 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 17:37:08,782 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 17:37:08,783 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 17:37:08,784 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 17:37:08,789 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 17:37:08,793 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 17:37:08,797 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 17:37:08,798 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 17:37:08,799 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 17:37:08,801 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 17:37:08,801 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 17:37:08,802 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 17:37:08,803 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 17:37:08,805 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 17:37:08,806 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 17:37:08,806 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 17:37:08,807 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 17:37:08,808 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 17:37:08,809 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 17:37:08,810 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 17:37:08,811 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 17:37:08,811 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 17:37:08,811 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 17:37:08,812 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 17:37:08,812 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 17:37:08,814 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 17:37:08,815 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-18 17:37:08,848 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 17:37:08,848 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 17:37:08,853 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 17:37:08,853 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 17:37:08,853 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 17:37:08,853 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 17:37:08,854 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 17:37:08,854 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 17:37:08,854 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 17:37:08,854 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 17:37:08,854 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 17:37:08,855 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 17:37:08,856 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 17:37:08,856 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 17:37:08,856 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 17:37:08,856 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 17:37:08,856 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 17:37:08,857 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 17:37:08,857 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 17:37:08,857 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 17:37:08,857 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 17:37:08,858 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 17:37:08,858 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 17:37:08,858 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 17:37:08,858 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 17:37:08,858 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 17:37:08,859 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 17:37:08,859 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 17:37:08,859 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 17:37:09,165 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 17:37:09,179 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 17:37:09,182 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 17:37:09,184 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 17:37:09,184 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 17:37:09,185 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix047_rmo.opt.i [2019-12-18 17:37:09,263 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/328883792/b883c307e8f7414f924d40d3e5f16658/FLAGcf238a651 [2019-12-18 17:37:09,793 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 17:37:09,795 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix047_rmo.opt.i [2019-12-18 17:37:09,819 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/328883792/b883c307e8f7414f924d40d3e5f16658/FLAGcf238a651 [2019-12-18 17:37:10,092 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/328883792/b883c307e8f7414f924d40d3e5f16658 [2019-12-18 17:37:10,105 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 17:37:10,107 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 17:37:10,110 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 17:37:10,110 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 17:37:10,114 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 17:37:10,115 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 05:37:10" (1/1) ... [2019-12-18 17:37:10,118 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1570dfe8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:37:10, skipping insertion in model container [2019-12-18 17:37:10,119 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 05:37:10" (1/1) ... [2019-12-18 17:37:10,126 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 17:37:10,189 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 17:37:10,728 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 17:37:10,741 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 17:37:10,833 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 17:37:10,913 INFO L208 MainTranslator]: Completed translation [2019-12-18 17:37:10,914 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:37:10 WrapperNode [2019-12-18 17:37:10,914 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 17:37:10,915 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 17:37:10,915 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 17:37:10,915 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 17:37:10,924 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:37:10" (1/1) ... [2019-12-18 17:37:10,945 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:37:10" (1/1) ... [2019-12-18 17:37:11,001 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 17:37:11,002 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 17:37:11,002 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 17:37:11,002 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 17:37:11,010 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:37:10" (1/1) ... [2019-12-18 17:37:11,010 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:37:10" (1/1) ... [2019-12-18 17:37:11,015 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:37:10" (1/1) ... [2019-12-18 17:37:11,016 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:37:10" (1/1) ... [2019-12-18 17:37:11,027 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:37:10" (1/1) ... [2019-12-18 17:37:11,031 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:37:10" (1/1) ... [2019-12-18 17:37:11,035 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:37:10" (1/1) ... [2019-12-18 17:37:11,041 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 17:37:11,041 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 17:37:11,041 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 17:37:11,042 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 17:37:11,043 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:37:10" (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-18 17:37:11,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 17:37:11,125 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 17:37:11,125 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 17:37:11,125 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 17:37:11,125 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 17:37:11,125 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 17:37:11,125 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 17:37:11,126 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 17:37:11,126 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 17:37:11,126 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 17:37:11,126 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-18 17:37:11,126 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-18 17:37:11,127 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 17:37:11,127 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 17:37:11,127 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 17:37:11,129 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 17:37:11,916 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 17:37:11,916 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 17:37:11,918 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 05:37:11 BoogieIcfgContainer [2019-12-18 17:37:11,918 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 17:37:11,919 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 17:37:11,919 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 17:37:11,922 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 17:37:11,923 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 05:37:10" (1/3) ... [2019-12-18 17:37:11,924 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5176ca4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 05:37:11, skipping insertion in model container [2019-12-18 17:37:11,924 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:37:10" (2/3) ... [2019-12-18 17:37:11,924 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5176ca4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 05:37:11, skipping insertion in model container [2019-12-18 17:37:11,924 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 05:37:11" (3/3) ... [2019-12-18 17:37:11,926 INFO L109 eAbstractionObserver]: Analyzing ICFG mix047_rmo.opt.i [2019-12-18 17:37:11,936 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 17:37:11,937 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 17:37:11,944 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 17:37:11,945 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 17:37:11,995 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:37:11,995 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:37:11,996 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:37:11,996 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:37:11,996 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:37:11,997 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:37:11,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:37:11,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:37:11,997 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:37:11,998 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:37:11,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:37:11,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:37:11,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:37:11,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:37:12,000 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:37:12,000 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:37:12,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:37:12,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:37:12,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:37:12,001 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:37:12,001 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:37:12,001 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:37:12,001 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:37:12,002 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:37:12,002 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:37:12,002 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:37:12,002 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:37:12,003 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:37:12,003 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:37:12,004 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:37:12,004 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:37:12,004 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:37:12,004 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:37:12,005 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:37:12,005 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:37:12,006 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:37:12,006 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:37:12,007 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:37:12,008 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:37:12,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:37:12,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:37:12,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:37:12,015 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:37:12,015 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:37:12,016 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:37:12,016 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:37:12,016 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:37:12,016 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:37:12,017 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:37:12,017 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:37:12,017 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:37:12,017 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:37:12,017 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:37:12,018 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:37:12,018 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:37:12,018 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:37:12,018 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:37:12,019 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:37:12,019 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:37:12,019 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:37:12,019 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:37:12,020 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:37:12,020 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:37:12,020 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:37:12,020 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:37:12,021 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:37:12,021 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:37:12,021 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:37:12,021 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:37:12,022 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:37:12,022 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:37:12,022 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:37:12,022 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:37:12,023 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:37:12,023 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:37:12,023 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:37:12,027 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:37:12,027 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:37:12,028 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:37:12,028 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:37:12,030 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:37:12,031 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:37:12,031 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:37:12,031 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:37:12,034 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:37:12,034 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:37:12,034 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:37:12,035 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:37:12,035 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:37:12,035 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:37:12,036 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:37:12,036 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:37:12,036 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:37:12,036 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:37:12,044 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:37:12,045 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:37:12,045 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:37:12,045 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:37:12,045 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:37:12,046 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:37:12,046 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:37:12,046 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:37:12,046 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:37:12,047 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:37:12,047 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:37:12,047 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:37:12,063 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-18 17:37:12,101 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 17:37:12,101 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 17:37:12,101 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 17:37:12,101 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 17:37:12,102 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 17:37:12,102 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 17:37:12,102 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 17:37:12,102 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 17:37:12,121 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 180 places, 208 transitions [2019-12-18 17:37:12,123 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 208 transitions [2019-12-18 17:37:12,233 INFO L126 PetriNetUnfolder]: 41/204 cut-off events. [2019-12-18 17:37:12,233 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 17:37:12,250 INFO L76 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 204 events. 41/204 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 267 event pairs. 12/173 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 17:37:12,274 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 208 transitions [2019-12-18 17:37:12,319 INFO L126 PetriNetUnfolder]: 41/204 cut-off events. [2019-12-18 17:37:12,319 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 17:37:12,328 INFO L76 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 204 events. 41/204 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 267 event pairs. 12/173 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 17:37:12,346 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12668 [2019-12-18 17:37:12,348 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 17:37:17,757 WARN L192 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-18 17:37:17,976 WARN L192 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-12-18 17:37:18,040 INFO L206 etLargeBlockEncoding]: Checked pairs total: 49999 [2019-12-18 17:37:18,041 INFO L214 etLargeBlockEncoding]: Total number of compositions: 122 [2019-12-18 17:37:18,044 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 89 places, 95 transitions [2019-12-18 17:37:20,885 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34566 states. [2019-12-18 17:37:20,886 INFO L276 IsEmpty]: Start isEmpty. Operand 34566 states. [2019-12-18 17:37:20,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 17:37:20,894 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:37:20,895 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:37:20,896 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:37:20,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:37:20,902 INFO L82 PathProgramCache]: Analyzing trace with hash -1471654446, now seen corresponding path program 1 times [2019-12-18 17:37:20,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:37:20,912 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6261463] [2019-12-18 17:37:20,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:37:21,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:37:21,201 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-18 17:37:21,201 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6261463] [2019-12-18 17:37:21,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:37:21,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 17:37:21,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780583664] [2019-12-18 17:37:21,211 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:37:21,211 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:37:21,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:37:21,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:37:21,229 INFO L87 Difference]: Start difference. First operand 34566 states. Second operand 3 states. [2019-12-18 17:37:22,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:37:22,014 INFO L93 Difference]: Finished difference Result 34366 states and 145616 transitions. [2019-12-18 17:37:22,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:37:22,016 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-18 17:37:22,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:37:22,673 INFO L225 Difference]: With dead ends: 34366 [2019-12-18 17:37:22,673 INFO L226 Difference]: Without dead ends: 33638 [2019-12-18 17:37:22,674 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-18 17:37:23,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33638 states. [2019-12-18 17:37:24,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33638 to 33638. [2019-12-18 17:37:24,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33638 states. [2019-12-18 17:37:24,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33638 states to 33638 states and 142648 transitions. [2019-12-18 17:37:24,352 INFO L78 Accepts]: Start accepts. Automaton has 33638 states and 142648 transitions. Word has length 9 [2019-12-18 17:37:24,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:37:24,353 INFO L462 AbstractCegarLoop]: Abstraction has 33638 states and 142648 transitions. [2019-12-18 17:37:24,354 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:37:24,354 INFO L276 IsEmpty]: Start isEmpty. Operand 33638 states and 142648 transitions. [2019-12-18 17:37:24,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 17:37:24,361 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:37:24,362 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:37:24,362 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:37:24,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:37:24,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1198985017, now seen corresponding path program 1 times [2019-12-18 17:37:24,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:37:24,363 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891698073] [2019-12-18 17:37:24,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:37:24,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:37:24,470 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-18 17:37:24,471 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891698073] [2019-12-18 17:37:24,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:37:24,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:37:24,472 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524989110] [2019-12-18 17:37:24,473 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:37:24,473 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:37:24,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:37:24,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:37:24,474 INFO L87 Difference]: Start difference. First operand 33638 states and 142648 transitions. Second operand 4 states. [2019-12-18 17:37:26,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:37:26,829 INFO L93 Difference]: Finished difference Result 52350 states and 214824 transitions. [2019-12-18 17:37:26,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:37:26,829 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-18 17:37:26,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:37:27,099 INFO L225 Difference]: With dead ends: 52350 [2019-12-18 17:37:27,099 INFO L226 Difference]: Without dead ends: 52322 [2019-12-18 17:37:27,100 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:37:27,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52322 states. [2019-12-18 17:37:28,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52322 to 47746. [2019-12-18 17:37:28,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47746 states. [2019-12-18 17:37:28,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47746 states to 47746 states and 197744 transitions. [2019-12-18 17:37:28,984 INFO L78 Accepts]: Start accepts. Automaton has 47746 states and 197744 transitions. Word has length 15 [2019-12-18 17:37:28,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:37:28,985 INFO L462 AbstractCegarLoop]: Abstraction has 47746 states and 197744 transitions. [2019-12-18 17:37:28,985 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:37:28,985 INFO L276 IsEmpty]: Start isEmpty. Operand 47746 states and 197744 transitions. [2019-12-18 17:37:28,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 17:37:28,988 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:37:28,989 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:37:28,989 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:37:28,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:37:28,989 INFO L82 PathProgramCache]: Analyzing trace with hash -633584, now seen corresponding path program 1 times [2019-12-18 17:37:28,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:37:28,990 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869263914] [2019-12-18 17:37:28,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:37:30,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:37:30,905 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-18 17:37:30,905 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869263914] [2019-12-18 17:37:30,905 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:37:30,908 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:37:30,909 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499383803] [2019-12-18 17:37:30,909 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:37:30,909 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:37:30,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:37:30,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:37:30,910 INFO L87 Difference]: Start difference. First operand 47746 states and 197744 transitions. Second operand 3 states. [2019-12-18 17:37:31,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:37:31,072 INFO L93 Difference]: Finished difference Result 37462 states and 143322 transitions. [2019-12-18 17:37:31,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:37:31,078 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-18 17:37:31,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:37:31,294 INFO L225 Difference]: With dead ends: 37462 [2019-12-18 17:37:31,294 INFO L226 Difference]: Without dead ends: 37462 [2019-12-18 17:37:31,294 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-18 17:37:31,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37462 states. [2019-12-18 17:37:32,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37462 to 37462. [2019-12-18 17:37:32,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37462 states. [2019-12-18 17:37:32,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37462 states to 37462 states and 143322 transitions. [2019-12-18 17:37:32,510 INFO L78 Accepts]: Start accepts. Automaton has 37462 states and 143322 transitions. Word has length 15 [2019-12-18 17:37:32,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:37:32,510 INFO L462 AbstractCegarLoop]: Abstraction has 37462 states and 143322 transitions. [2019-12-18 17:37:32,510 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:37:32,510 INFO L276 IsEmpty]: Start isEmpty. Operand 37462 states and 143322 transitions. [2019-12-18 17:37:32,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 17:37:32,513 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:37:32,513 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:37:32,513 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:37:32,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:37:32,513 INFO L82 PathProgramCache]: Analyzing trace with hash -375525237, now seen corresponding path program 1 times [2019-12-18 17:37:32,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:37:32,514 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019839873] [2019-12-18 17:37:32,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:37:32,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:37:32,571 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-18 17:37:32,572 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019839873] [2019-12-18 17:37:32,572 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:37:32,572 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:37:32,572 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175937197] [2019-12-18 17:37:32,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:37:32,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:37:32,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:37:32,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:37:32,573 INFO L87 Difference]: Start difference. First operand 37462 states and 143322 transitions. Second operand 4 states. [2019-12-18 17:37:32,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:37:32,639 INFO L93 Difference]: Finished difference Result 15610 states and 49514 transitions. [2019-12-18 17:37:32,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 17:37:32,640 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 17:37:32,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:37:32,663 INFO L225 Difference]: With dead ends: 15610 [2019-12-18 17:37:32,663 INFO L226 Difference]: Without dead ends: 15610 [2019-12-18 17:37:32,663 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:37:32,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15610 states. [2019-12-18 17:37:32,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15610 to 15610. [2019-12-18 17:37:32,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15610 states. [2019-12-18 17:37:32,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15610 states to 15610 states and 49514 transitions. [2019-12-18 17:37:32,939 INFO L78 Accepts]: Start accepts. Automaton has 15610 states and 49514 transitions. Word has length 16 [2019-12-18 17:37:32,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:37:32,939 INFO L462 AbstractCegarLoop]: Abstraction has 15610 states and 49514 transitions. [2019-12-18 17:37:32,939 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:37:32,940 INFO L276 IsEmpty]: Start isEmpty. Operand 15610 states and 49514 transitions. [2019-12-18 17:37:32,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 17:37:32,941 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:37:32,942 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:37:32,942 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:37:32,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:37:32,942 INFO L82 PathProgramCache]: Analyzing trace with hash 680326116, now seen corresponding path program 1 times [2019-12-18 17:37:32,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:37:32,942 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391362498] [2019-12-18 17:37:32,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:37:32,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:37:33,004 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-18 17:37:33,004 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391362498] [2019-12-18 17:37:33,004 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:37:33,005 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 17:37:33,005 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69915781] [2019-12-18 17:37:33,005 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:37:33,005 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:37:33,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:37:33,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:37:33,006 INFO L87 Difference]: Start difference. First operand 15610 states and 49514 transitions. Second operand 5 states. [2019-12-18 17:37:33,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:37:33,067 INFO L93 Difference]: Finished difference Result 2718 states and 7032 transitions. [2019-12-18 17:37:33,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:37:33,067 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-18 17:37:33,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:37:33,071 INFO L225 Difference]: With dead ends: 2718 [2019-12-18 17:37:33,071 INFO L226 Difference]: Without dead ends: 2718 [2019-12-18 17:37:33,072 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:37:33,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2718 states. [2019-12-18 17:37:33,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2718 to 2718. [2019-12-18 17:37:33,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2718 states. [2019-12-18 17:37:33,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2718 states to 2718 states and 7032 transitions. [2019-12-18 17:37:33,103 INFO L78 Accepts]: Start accepts. Automaton has 2718 states and 7032 transitions. Word has length 17 [2019-12-18 17:37:33,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:37:33,104 INFO L462 AbstractCegarLoop]: Abstraction has 2718 states and 7032 transitions. [2019-12-18 17:37:33,104 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:37:33,104 INFO L276 IsEmpty]: Start isEmpty. Operand 2718 states and 7032 transitions. [2019-12-18 17:37:33,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-18 17:37:33,109 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:37:33,109 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] [2019-12-18 17:37:33,109 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:37:33,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:37:33,109 INFO L82 PathProgramCache]: Analyzing trace with hash 794969432, now seen corresponding path program 1 times [2019-12-18 17:37:33,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:37:33,110 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709154994] [2019-12-18 17:37:33,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:37:33,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:37:33,241 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-18 17:37:33,241 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709154994] [2019-12-18 17:37:33,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:37:33,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 17:37:33,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405428790] [2019-12-18 17:37:33,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:37:33,242 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:37:33,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:37:33,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:37:33,243 INFO L87 Difference]: Start difference. First operand 2718 states and 7032 transitions. Second operand 6 states. [2019-12-18 17:37:33,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:37:33,288 INFO L93 Difference]: Finished difference Result 1354 states and 3884 transitions. [2019-12-18 17:37:33,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 17:37:33,289 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-12-18 17:37:33,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:37:33,291 INFO L225 Difference]: With dead ends: 1354 [2019-12-18 17:37:33,291 INFO L226 Difference]: Without dead ends: 1354 [2019-12-18 17:37:33,292 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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-18 17:37:33,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2019-12-18 17:37:33,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1214. [2019-12-18 17:37:33,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1214 states. [2019-12-18 17:37:33,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1214 states to 1214 states and 3484 transitions. [2019-12-18 17:37:33,312 INFO L78 Accepts]: Start accepts. Automaton has 1214 states and 3484 transitions. Word has length 29 [2019-12-18 17:37:33,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:37:33,312 INFO L462 AbstractCegarLoop]: Abstraction has 1214 states and 3484 transitions. [2019-12-18 17:37:33,313 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:37:33,313 INFO L276 IsEmpty]: Start isEmpty. Operand 1214 states and 3484 transitions. [2019-12-18 17:37:33,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 17:37:33,316 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:37:33,317 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, 1] [2019-12-18 17:37:33,317 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:37:33,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:37:33,317 INFO L82 PathProgramCache]: Analyzing trace with hash 593702588, now seen corresponding path program 1 times [2019-12-18 17:37:33,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:37:33,318 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456092202] [2019-12-18 17:37:33,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:37:33,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:37:33,439 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-18 17:37:33,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456092202] [2019-12-18 17:37:33,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:37:33,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:37:33,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894780336] [2019-12-18 17:37:33,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:37:33,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:37:33,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:37:33,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:37:33,442 INFO L87 Difference]: Start difference. First operand 1214 states and 3484 transitions. Second operand 3 states. [2019-12-18 17:37:33,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:37:33,484 INFO L93 Difference]: Finished difference Result 1222 states and 3492 transitions. [2019-12-18 17:37:33,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:37:33,485 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-18 17:37:33,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:37:33,487 INFO L225 Difference]: With dead ends: 1222 [2019-12-18 17:37:33,487 INFO L226 Difference]: Without dead ends: 1222 [2019-12-18 17:37:33,488 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-18 17:37:33,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1222 states. [2019-12-18 17:37:33,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1222 to 1217. [2019-12-18 17:37:33,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1217 states. [2019-12-18 17:37:33,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 1217 states and 3487 transitions. [2019-12-18 17:37:33,511 INFO L78 Accepts]: Start accepts. Automaton has 1217 states and 3487 transitions. Word has length 58 [2019-12-18 17:37:33,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:37:33,513 INFO L462 AbstractCegarLoop]: Abstraction has 1217 states and 3487 transitions. [2019-12-18 17:37:33,514 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:37:33,514 INFO L276 IsEmpty]: Start isEmpty. Operand 1217 states and 3487 transitions. [2019-12-18 17:37:33,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 17:37:33,517 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:37:33,517 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, 1] [2019-12-18 17:37:33,518 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:37:33,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:37:33,518 INFO L82 PathProgramCache]: Analyzing trace with hash -1128085639, now seen corresponding path program 1 times [2019-12-18 17:37:33,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:37:33,519 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777523700] [2019-12-18 17:37:33,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:37:33,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:37:33,643 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-18 17:37:33,644 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777523700] [2019-12-18 17:37:33,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:37:33,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 17:37:33,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464254300] [2019-12-18 17:37:33,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:37:33,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:37:33,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:37:33,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:37:33,645 INFO L87 Difference]: Start difference. First operand 1217 states and 3487 transitions. Second operand 5 states. [2019-12-18 17:37:33,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:37:33,880 INFO L93 Difference]: Finished difference Result 1758 states and 5009 transitions. [2019-12-18 17:37:33,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 17:37:33,881 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-12-18 17:37:33,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:37:33,884 INFO L225 Difference]: With dead ends: 1758 [2019-12-18 17:37:33,885 INFO L226 Difference]: Without dead ends: 1758 [2019-12-18 17:37:33,886 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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-18 17:37:33,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1758 states. [2019-12-18 17:37:33,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1758 to 1413. [2019-12-18 17:37:33,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1413 states. [2019-12-18 17:37:33,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1413 states to 1413 states and 4063 transitions. [2019-12-18 17:37:33,917 INFO L78 Accepts]: Start accepts. Automaton has 1413 states and 4063 transitions. Word has length 58 [2019-12-18 17:37:33,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:37:33,917 INFO L462 AbstractCegarLoop]: Abstraction has 1413 states and 4063 transitions. [2019-12-18 17:37:33,918 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:37:33,918 INFO L276 IsEmpty]: Start isEmpty. Operand 1413 states and 4063 transitions. [2019-12-18 17:37:33,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 17:37:33,922 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:37:33,923 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, 1] [2019-12-18 17:37:33,923 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:37:33,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:37:33,923 INFO L82 PathProgramCache]: Analyzing trace with hash -2139138521, now seen corresponding path program 2 times [2019-12-18 17:37:33,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:37:33,924 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659648522] [2019-12-18 17:37:33,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:37:33,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:37:34,072 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-18 17:37:34,073 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659648522] [2019-12-18 17:37:34,073 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:37:34,073 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 17:37:34,073 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203524380] [2019-12-18 17:37:34,074 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:37:34,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:37:34,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:37:34,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:37:34,075 INFO L87 Difference]: Start difference. First operand 1413 states and 4063 transitions. Second operand 6 states. [2019-12-18 17:37:34,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:37:34,472 INFO L93 Difference]: Finished difference Result 2360 states and 6721 transitions. [2019-12-18 17:37:34,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 17:37:34,473 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-12-18 17:37:34,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:37:34,478 INFO L225 Difference]: With dead ends: 2360 [2019-12-18 17:37:34,478 INFO L226 Difference]: Without dead ends: 2360 [2019-12-18 17:37:34,479 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-18 17:37:34,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2360 states. [2019-12-18 17:37:34,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2360 to 1497. [2019-12-18 17:37:34,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1497 states. [2019-12-18 17:37:34,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1497 states to 1497 states and 4311 transitions. [2019-12-18 17:37:34,508 INFO L78 Accepts]: Start accepts. Automaton has 1497 states and 4311 transitions. Word has length 58 [2019-12-18 17:37:34,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:37:34,509 INFO L462 AbstractCegarLoop]: Abstraction has 1497 states and 4311 transitions. [2019-12-18 17:37:34,509 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:37:34,509 INFO L276 IsEmpty]: Start isEmpty. Operand 1497 states and 4311 transitions. [2019-12-18 17:37:34,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 17:37:34,513 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:37:34,513 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, 1] [2019-12-18 17:37:34,514 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:37:34,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:37:34,514 INFO L82 PathProgramCache]: Analyzing trace with hash -1500936233, now seen corresponding path program 3 times [2019-12-18 17:37:34,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:37:34,514 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319706984] [2019-12-18 17:37:34,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:37:34,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:37:34,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-18 17:37:34,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319706984] [2019-12-18 17:37:34,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:37:34,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:37:34,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166614468] [2019-12-18 17:37:34,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:37:34,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:37:34,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:37:34,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:37:34,587 INFO L87 Difference]: Start difference. First operand 1497 states and 4311 transitions. Second operand 3 states. [2019-12-18 17:37:34,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:37:34,647 INFO L93 Difference]: Finished difference Result 1497 states and 4310 transitions. [2019-12-18 17:37:34,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:37:34,648 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-18 17:37:34,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:37:34,651 INFO L225 Difference]: With dead ends: 1497 [2019-12-18 17:37:34,652 INFO L226 Difference]: Without dead ends: 1497 [2019-12-18 17:37:34,652 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-18 17:37:34,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1497 states. [2019-12-18 17:37:34,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1497 to 1076. [2019-12-18 17:37:34,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1076 states. [2019-12-18 17:37:34,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1076 states to 1076 states and 3124 transitions. [2019-12-18 17:37:34,677 INFO L78 Accepts]: Start accepts. Automaton has 1076 states and 3124 transitions. Word has length 58 [2019-12-18 17:37:34,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:37:34,678 INFO L462 AbstractCegarLoop]: Abstraction has 1076 states and 3124 transitions. [2019-12-18 17:37:34,678 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:37:34,678 INFO L276 IsEmpty]: Start isEmpty. Operand 1076 states and 3124 transitions. [2019-12-18 17:37:34,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 17:37:34,681 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:37:34,681 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, 1, 1] [2019-12-18 17:37:34,682 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:37:34,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:37:34,682 INFO L82 PathProgramCache]: Analyzing trace with hash -248733535, now seen corresponding path program 1 times [2019-12-18 17:37:34,682 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:37:34,683 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962800373] [2019-12-18 17:37:34,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:37:34,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:37:34,986 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-18 17:37:34,987 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962800373] [2019-12-18 17:37:34,987 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:37:34,987 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 17:37:34,988 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013328163] [2019-12-18 17:37:34,988 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 17:37:34,989 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:37:34,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 17:37:34,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-12-18 17:37:34,991 INFO L87 Difference]: Start difference. First operand 1076 states and 3124 transitions. Second operand 12 states. [2019-12-18 17:37:35,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:37:35,757 INFO L93 Difference]: Finished difference Result 2599 states and 6928 transitions. [2019-12-18 17:37:35,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 17:37:35,758 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 59 [2019-12-18 17:37:35,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:37:35,760 INFO L225 Difference]: With dead ends: 2599 [2019-12-18 17:37:35,760 INFO L226 Difference]: Without dead ends: 1589 [2019-12-18 17:37:35,761 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=173, Invalid=427, Unknown=0, NotChecked=0, Total=600 [2019-12-18 17:37:35,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1589 states. [2019-12-18 17:37:35,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1589 to 946. [2019-12-18 17:37:35,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 946 states. [2019-12-18 17:37:35,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 946 states to 946 states and 2684 transitions. [2019-12-18 17:37:35,775 INFO L78 Accepts]: Start accepts. Automaton has 946 states and 2684 transitions. Word has length 59 [2019-12-18 17:37:35,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:37:35,775 INFO L462 AbstractCegarLoop]: Abstraction has 946 states and 2684 transitions. [2019-12-18 17:37:35,775 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 17:37:35,776 INFO L276 IsEmpty]: Start isEmpty. Operand 946 states and 2684 transitions. [2019-12-18 17:37:35,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 17:37:35,778 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:37:35,778 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, 1, 1] [2019-12-18 17:37:35,778 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:37:35,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:37:35,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1360237091, now seen corresponding path program 2 times [2019-12-18 17:37:35,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:37:35,779 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225540672] [2019-12-18 17:37:35,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:37:35,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:37:35,938 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-18 17:37:35,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225540672] [2019-12-18 17:37:35,939 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:37:35,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 17:37:35,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257051648] [2019-12-18 17:37:35,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:37:35,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:37:35,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:37:35,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:37:35,940 INFO L87 Difference]: Start difference. First operand 946 states and 2684 transitions. Second operand 6 states. [2019-12-18 17:37:36,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:37:36,025 INFO L93 Difference]: Finished difference Result 1650 states and 4366 transitions. [2019-12-18 17:37:36,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 17:37:36,025 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-12-18 17:37:36,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:37:36,027 INFO L225 Difference]: With dead ends: 1650 [2019-12-18 17:37:36,028 INFO L226 Difference]: Without dead ends: 921 [2019-12-18 17:37:36,028 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-18 17:37:36,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2019-12-18 17:37:36,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 689. [2019-12-18 17:37:36,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 689 states. [2019-12-18 17:37:36,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 1725 transitions. [2019-12-18 17:37:36,040 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 1725 transitions. Word has length 59 [2019-12-18 17:37:36,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:37:36,041 INFO L462 AbstractCegarLoop]: Abstraction has 689 states and 1725 transitions. [2019-12-18 17:37:36,041 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:37:36,041 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 1725 transitions. [2019-12-18 17:37:36,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 17:37:36,043 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:37:36,043 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, 1, 1] [2019-12-18 17:37:36,043 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:37:36,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:37:36,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1505400511, now seen corresponding path program 3 times [2019-12-18 17:37:36,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:37:36,044 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076219573] [2019-12-18 17:37:36,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:37:36,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:37:36,145 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-18 17:37:36,146 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076219573] [2019-12-18 17:37:36,146 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:37:36,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:37:36,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132508696] [2019-12-18 17:37:36,147 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:37:36,148 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:37:36,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:37:36,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:37:36,149 INFO L87 Difference]: Start difference. First operand 689 states and 1725 transitions. Second operand 3 states. [2019-12-18 17:37:36,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:37:36,167 INFO L93 Difference]: Finished difference Result 648 states and 1571 transitions. [2019-12-18 17:37:36,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:37:36,168 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-18 17:37:36,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:37:36,169 INFO L225 Difference]: With dead ends: 648 [2019-12-18 17:37:36,169 INFO L226 Difference]: Without dead ends: 648 [2019-12-18 17:37:36,169 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-18 17:37:36,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2019-12-18 17:37:36,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 600. [2019-12-18 17:37:36,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2019-12-18 17:37:36,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 1449 transitions. [2019-12-18 17:37:36,184 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 1449 transitions. Word has length 59 [2019-12-18 17:37:36,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:37:36,186 INFO L462 AbstractCegarLoop]: Abstraction has 600 states and 1449 transitions. [2019-12-18 17:37:36,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:37:36,186 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 1449 transitions. [2019-12-18 17:37:36,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 17:37:36,189 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:37:36,189 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, 1, 1, 1] [2019-12-18 17:37:36,189 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:37:36,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:37:36,190 INFO L82 PathProgramCache]: Analyzing trace with hash -665728346, now seen corresponding path program 1 times [2019-12-18 17:37:36,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:37:36,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331487484] [2019-12-18 17:37:36,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:37:36,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:37:36,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:37:36,353 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331487484] [2019-12-18 17:37:36,353 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:37:36,353 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 17:37:36,354 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477213906] [2019-12-18 17:37:36,354 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:37:36,355 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:37:36,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:37:36,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:37:36,355 INFO L87 Difference]: Start difference. First operand 600 states and 1449 transitions. Second operand 5 states. [2019-12-18 17:37:36,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:37:36,404 INFO L93 Difference]: Finished difference Result 785 states and 1776 transitions. [2019-12-18 17:37:36,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:37:36,405 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2019-12-18 17:37:36,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:37:36,405 INFO L225 Difference]: With dead ends: 785 [2019-12-18 17:37:36,405 INFO L226 Difference]: Without dead ends: 232 [2019-12-18 17:37:36,406 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:37:36,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2019-12-18 17:37:36,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2019-12-18 17:37:36,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-12-18 17:37:36,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 410 transitions. [2019-12-18 17:37:36,410 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 410 transitions. Word has length 60 [2019-12-18 17:37:36,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:37:36,411 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 410 transitions. [2019-12-18 17:37:36,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:37:36,411 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 410 transitions. [2019-12-18 17:37:36,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 17:37:36,412 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:37:36,412 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, 1, 1, 1] [2019-12-18 17:37:36,412 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:37:36,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:37:36,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1097199394, now seen corresponding path program 2 times [2019-12-18 17:37:36,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:37:36,413 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098954593] [2019-12-18 17:37:36,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:37:36,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:37:37,189 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-18 17:37:37,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098954593] [2019-12-18 17:37:37,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:37:37,190 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-12-18 17:37:37,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280108581] [2019-12-18 17:37:37,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-18 17:37:37,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:37:37,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-18 17:37:37,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2019-12-18 17:37:37,191 INFO L87 Difference]: Start difference. First operand 232 states and 410 transitions. Second operand 21 states. [2019-12-18 17:37:38,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:37:38,791 INFO L93 Difference]: Finished difference Result 478 states and 833 transitions. [2019-12-18 17:37:38,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 17:37:38,792 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 60 [2019-12-18 17:37:38,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:37:38,792 INFO L225 Difference]: With dead ends: 478 [2019-12-18 17:37:38,792 INFO L226 Difference]: Without dead ends: 450 [2019-12-18 17:37:38,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=197, Invalid=925, Unknown=0, NotChecked=0, Total=1122 [2019-12-18 17:37:38,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2019-12-18 17:37:38,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 302. [2019-12-18 17:37:38,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2019-12-18 17:37:38,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 526 transitions. [2019-12-18 17:37:38,797 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 526 transitions. Word has length 60 [2019-12-18 17:37:38,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:37:38,798 INFO L462 AbstractCegarLoop]: Abstraction has 302 states and 526 transitions. [2019-12-18 17:37:38,798 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-18 17:37:38,798 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 526 transitions. [2019-12-18 17:37:38,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 17:37:38,799 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:37:38,799 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, 1, 1, 1] [2019-12-18 17:37:38,799 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:37:38,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:37:38,799 INFO L82 PathProgramCache]: Analyzing trace with hash -354201650, now seen corresponding path program 3 times [2019-12-18 17:37:38,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:37:38,800 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272393225] [2019-12-18 17:37:38,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:37:38,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:37:39,053 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-18 17:37:39,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272393225] [2019-12-18 17:37:39,056 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:37:39,056 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 17:37:39,057 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809647435] [2019-12-18 17:37:39,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 17:37:39,057 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:37:39,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 17:37:39,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-12-18 17:37:39,058 INFO L87 Difference]: Start difference. First operand 302 states and 526 transitions. Second operand 13 states. [2019-12-18 17:37:39,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:37:39,604 INFO L93 Difference]: Finished difference Result 464 states and 793 transitions. [2019-12-18 17:37:39,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 17:37:39,604 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 60 [2019-12-18 17:37:39,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:37:39,605 INFO L225 Difference]: With dead ends: 464 [2019-12-18 17:37:39,605 INFO L226 Difference]: Without dead ends: 436 [2019-12-18 17:37:39,606 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2019-12-18 17:37:39,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2019-12-18 17:37:39,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 332. [2019-12-18 17:37:39,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2019-12-18 17:37:39,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 581 transitions. [2019-12-18 17:37:39,610 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 581 transitions. Word has length 60 [2019-12-18 17:37:39,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:37:39,611 INFO L462 AbstractCegarLoop]: Abstraction has 332 states and 581 transitions. [2019-12-18 17:37:39,611 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 17:37:39,611 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 581 transitions. [2019-12-18 17:37:39,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 17:37:39,611 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:37:39,612 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, 1, 1, 1] [2019-12-18 17:37:39,612 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:37:39,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:37:39,612 INFO L82 PathProgramCache]: Analyzing trace with hash -2140500766, now seen corresponding path program 4 times [2019-12-18 17:37:39,612 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:37:39,612 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530106425] [2019-12-18 17:37:39,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:37:39,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:37:39,882 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-18 17:37:39,883 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530106425] [2019-12-18 17:37:39,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:37:39,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 17:37:39,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233581936] [2019-12-18 17:37:39,886 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 17:37:39,886 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:37:39,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 17:37:39,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-12-18 17:37:39,887 INFO L87 Difference]: Start difference. First operand 332 states and 581 transitions. Second operand 13 states. [2019-12-18 17:37:40,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:37:40,377 INFO L93 Difference]: Finished difference Result 446 states and 758 transitions. [2019-12-18 17:37:40,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 17:37:40,377 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 60 [2019-12-18 17:37:40,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:37:40,378 INFO L225 Difference]: With dead ends: 446 [2019-12-18 17:37:40,379 INFO L226 Difference]: Without dead ends: 418 [2019-12-18 17:37:40,379 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=372, Unknown=0, NotChecked=0, Total=462 [2019-12-18 17:37:40,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2019-12-18 17:37:40,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 340. [2019-12-18 17:37:40,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2019-12-18 17:37:40,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 595 transitions. [2019-12-18 17:37:40,385 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 595 transitions. Word has length 60 [2019-12-18 17:37:40,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:37:40,385 INFO L462 AbstractCegarLoop]: Abstraction has 340 states and 595 transitions. [2019-12-18 17:37:40,386 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 17:37:40,386 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 595 transitions. [2019-12-18 17:37:40,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 17:37:40,387 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:37:40,387 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, 1, 1, 1] [2019-12-18 17:37:40,387 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:37:40,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:37:40,387 INFO L82 PathProgramCache]: Analyzing trace with hash -1858118138, now seen corresponding path program 5 times [2019-12-18 17:37:40,388 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:37:40,388 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456228429] [2019-12-18 17:37:40,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:37:40,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 17:37:40,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 17:37:40,497 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 17:37:40,497 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 17:37:40,501 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] ULTIMATE.startENTRY-->L831: Formula: (let ((.cse0 (store |v_#valid_75| 0 0))) (and (= 0 v_~z$flush_delayed~0_54) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1269~0.base_21| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1269~0.base_21|) |v_ULTIMATE.start_main_~#t1269~0.offset_17| 0)) |v_#memory_int_23|) (= |v_#NULL.offset_7| 0) (= v_~z$w_buff1_used~0_609 0) (= 0 v_~z$r_buff1_thd3~0_278) (= v_~z$w_buff0_used~0_830 0) (= v_~z$r_buff0_thd1~0_77 0) (= v_~x~0_53 0) (< 0 |v_#StackHeapBarrier_21|) (= v_~z$w_buff0~0_376 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1269~0.base_21| 1) |v_#valid_73|) (= v_~z$r_buff0_thd0~0_415 0) (= v_~z$read_delayed~0_5 0) (= 0 v_~weak$$choice0~0_32) (= v_~z$read_delayed_var~0.base_5 0) (= v_~z$w_buff1~0_367 0) (< |v_#StackHeapBarrier_21| |v_ULTIMATE.start_main_~#t1269~0.base_21|) (= v_~weak$$choice2~0_172 0) (= v_~z$r_buff1_thd2~0_207 0) (= v_~z$r_buff1_thd1~0_207 0) (= v_~z$read_delayed_var~0.offset_5 0) (= v_~y~0_52 0) (= 0 v_~z$r_buff1_thd4~0_260) (= v_~z$mem_tmp~0_37 0) (= 0 v_~z$r_buff0_thd3~0_189) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1269~0.base_21|)) (= v_~__unbuffered_cnt~0_145 0) (= 0 |v_#NULL.base_7|) (= v_~main$tmp_guard0~0_21 0) (= v_~z~0_157 0) (= v_~a~0_207 0) (= 0 v_~z$r_buff0_thd4~0_332) (= 0 v_~__unbuffered_p3_EBX~0_219) (= v_~z$r_buff0_thd2~0_78 0) (= v_~main$tmp_guard1~0_24 0) (= v_~z$r_buff1_thd0~0_431 0) (= v_~b~0_98 0) (= |v_ULTIMATE.start_main_~#t1269~0.offset_17| 0) (= v_~__unbuffered_p3_EAX~0_219 0) (= (store |v_#length_30| |v_ULTIMATE.start_main_~#t1269~0.base_21| 4) |v_#length_29|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_21|, #valid=|v_#valid_75|, #memory_int=|v_#memory_int_24|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_~#t1271~0.base=|v_ULTIMATE.start_main_~#t1271~0.base_22|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_42|, ULTIMATE.start_main_~#t1270~0.offset=|v_ULTIMATE.start_main_~#t1270~0.offset_18|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_207, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_72|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_33|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_40|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_35|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_134|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_39|, ~a~0=v_~a~0_207, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_415, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_332, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_219, #length=|v_#length_29|, ~z$mem_tmp~0=v_~z$mem_tmp~0_37, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_66|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_41|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_609, ULTIMATE.start_main_~#t1270~0.base=|v_ULTIMATE.start_main_~#t1270~0.base_23|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_40|, ~z$flush_delayed~0=v_~z$flush_delayed~0_54, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_52|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_76|, ~weak$$choice0~0=v_~weak$$choice0~0_32, #StackHeapBarrier=|v_#StackHeapBarrier_21|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_40|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_207, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_9|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_5, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_189, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_145, ~x~0=v_~x~0_53, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_260, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_36|, ~z$read_delayed~0=v_~z$read_delayed~0_5, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_42|, ~z$w_buff1~0=v_~z$w_buff1~0_367, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_24, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_30|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_5, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_44|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_34|, ULTIMATE.start_main_~#t1269~0.base=|v_ULTIMATE.start_main_~#t1269~0.base_21|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_36|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_42|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_48|, ULTIMATE.start_main_~#t1272~0.base=|v_ULTIMATE.start_main_~#t1272~0.base_23|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_431, ULTIMATE.start_main_#t~nondet26=|v_ULTIMATE.start_main_#t~nondet26_56|, ULTIMATE.start_main_~#t1272~0.offset=|v_ULTIMATE.start_main_~#t1272~0.offset_18|, ~y~0=v_~y~0_52, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_78, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_830, ~z$w_buff0~0=v_~z$w_buff0~0_376, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_30|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_56|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_278, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_53|, ULTIMATE.start_main_~#t1269~0.offset=|v_ULTIMATE.start_main_~#t1269~0.offset_17|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_82|, ULTIMATE.start_main_~#t1271~0.offset=|v_ULTIMATE.start_main_~#t1271~0.offset_18|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_219, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_55|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_70|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_34|, ~b~0=v_~b~0_98, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, #valid=|v_#valid_73|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_9|, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_20|, ~z~0=v_~z~0_157, ~weak$$choice2~0=v_~weak$$choice2~0_172, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_77} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1271~0.base, ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_~#t1270~0.offset, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~a~0, ~z$r_buff0_thd0~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ~z$w_buff1_used~0, ULTIMATE.start_main_~#t1270~0.base, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ULTIMATE.start_main_#t~nondet15, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~ite29, ~z$read_delayed~0, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_~#t1269~0.base, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_~#t1272~0.base, ~z$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet26, ULTIMATE.start_main_~#t1272~0.offset, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_~#t1269~0.offset, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_~#t1271~0.offset, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_#t~ite41, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_#t~nondet18, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 17:37:40,502 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L831-1-->L833: Formula: (and (= (store |v_#valid_45| |v_ULTIMATE.start_main_~#t1270~0.base_13| 1) |v_#valid_44|) (not (= |v_ULTIMATE.start_main_~#t1270~0.base_13| 0)) (= (select |v_#valid_45| |v_ULTIMATE.start_main_~#t1270~0.base_13|) 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1270~0.base_13|) (= |v_ULTIMATE.start_main_~#t1270~0.offset_11| 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1270~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1270~0.base_13|) |v_ULTIMATE.start_main_~#t1270~0.offset_11| 1)) |v_#memory_int_15|) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1270~0.base_13| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_16|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t1270~0.offset=|v_ULTIMATE.start_main_~#t1270~0.offset_11|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_6|, ULTIMATE.start_main_~#t1270~0.base=|v_ULTIMATE.start_main_~#t1270~0.base_13|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1270~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_~#t1270~0.base, #length] because there is no mapped edge [2019-12-18 17:37:40,503 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L833-1-->L835: Formula: (and (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1271~0.base_11|)) (= |v_ULTIMATE.start_main_~#t1271~0.offset_10| 0) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1271~0.base_11| 4)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1271~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1271~0.base_11|) |v_ULTIMATE.start_main_~#t1271~0.offset_10| 2)) |v_#memory_int_13|) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1271~0.base_11| 1)) (not (= |v_ULTIMATE.start_main_~#t1271~0.base_11| 0)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1271~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_14|, #length=|v_#length_20|} OutVars{ULTIMATE.start_main_~#t1271~0.base=|v_ULTIMATE.start_main_~#t1271~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_6|, #length=|v_#length_19|, ULTIMATE.start_main_~#t1271~0.offset=|v_ULTIMATE.start_main_~#t1271~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1271~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, #length, ULTIMATE.start_main_~#t1271~0.offset] because there is no mapped edge [2019-12-18 17:37:40,503 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L835-1-->L837: Formula: (and (= (store |v_#valid_47| |v_ULTIMATE.start_main_~#t1272~0.base_13| 1) |v_#valid_46|) (not (= 0 |v_ULTIMATE.start_main_~#t1272~0.base_13|)) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1272~0.base_13| 4)) (= |v_ULTIMATE.start_main_~#t1272~0.offset_11| 0) (= (select |v_#valid_47| |v_ULTIMATE.start_main_~#t1272~0.base_13|) 0) (= |v_#memory_int_17| (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1272~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1272~0.base_13|) |v_ULTIMATE.start_main_~#t1272~0.offset_11| 3))) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1272~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_18|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_~#t1272~0.base=|v_ULTIMATE.start_main_~#t1272~0.base_13|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t1272~0.offset=|v_ULTIMATE.start_main_~#t1272~0.offset_11|, #length=|v_#length_23|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1272~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t1272~0.offset, #length, ULTIMATE.start_main_#t~nondet17] because there is no mapped edge [2019-12-18 17:37:40,504 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L4-->L808: Formula: (and (= v_~z$r_buff0_thd4~0_36 1) (= v_~z$r_buff1_thd2~0_8 v_~z$r_buff0_thd2~0_7) (= v_~z$r_buff0_thd0~0_114 v_~z$r_buff1_thd0~0_75) (= 1 v_~a~0_7) (= v_~z$r_buff0_thd4~0_37 v_~z$r_buff1_thd4~0_34) (not (= v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_18 0)) (= v_~__unbuffered_p3_EAX~0_8 v_~a~0_7) (= v_~z$r_buff1_thd1~0_8 v_~z$r_buff0_thd1~0_7) (= v_~z$r_buff0_thd3~0_42 v_~z$r_buff1_thd3~0_34) (= v_~b~0_17 v_~__unbuffered_p3_EBX~0_8)) InVars {P3Thread1of1ForFork3___VERIFIER_assert_~expression=v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_18, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_114, ~b~0=v_~b~0_17, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_37, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_42, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_7, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_7} OutVars{P3Thread1of1ForFork3___VERIFIER_assert_~expression=v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_18, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_34, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_34, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_8, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_8, ~a~0=v_~a~0_7, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_114, ~b~0=v_~b~0_17, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_75, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_8, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_8, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_36, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_42, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_7, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_7} AuxVars[] AssignedVars[~a~0, ~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EBX~0] because there is no mapped edge [2019-12-18 17:37:40,505 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork0_~arg.offset_21 |v_P0Thread1of1ForFork0_#in~arg.offset_21|) (= v_~b~0_62 1) (= v_P0Thread1of1ForFork0_~arg.base_21 |v_P0Thread1of1ForFork0_#in~arg.base_21|) (= |v_P0Thread1of1ForFork0_#res.base_11| 0) (= 0 |v_P0Thread1of1ForFork0_#res.offset_11|) (= v_~__unbuffered_cnt~0_119 (+ v_~__unbuffered_cnt~0_120 1)) (= v_~x~0_42 1)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_21|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_21|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_120} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_21|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_11|, ~b~0=v_~b~0_62, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_21|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_119, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_21, ~x~0=v_~x~0_42, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_21} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, ~b~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, ~x~0, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-18 17:37:40,505 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] P1ENTRY-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= |v_P1Thread1of1ForFork1_#in~arg.offset_14| v_P1Thread1of1ForFork1_~arg.offset_14) (= v_P1Thread1of1ForFork1_~arg.base_14 |v_P1Thread1of1ForFork1_#in~arg.base_14|) (= v_~y~0_33 1) (= v_~x~0_29 2) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_84 1) v_~__unbuffered_cnt~0_83)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_14|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_14|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_14, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_14, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_14|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_14|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83, ~y~0=v_~y~0_33, ~x~0=v_~x~0_29, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_~arg.base, ~__unbuffered_cnt~0, ~y~0, ~x~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 17:37:40,506 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L809-->L809-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In639555285 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In639555285 256)))) (or (and (= ~z$w_buff0_used~0_In639555285 |P3Thread1of1ForFork3_#t~ite11_Out639555285|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |P3Thread1of1ForFork3_#t~ite11_Out639555285|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In639555285, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In639555285} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In639555285, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In639555285, P3Thread1of1ForFork3_#t~ite11=|P3Thread1of1ForFork3_#t~ite11_Out639555285|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite11] because there is no mapped edge [2019-12-18 17:37:40,507 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L810-->L810-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff0_thd4~0_In1554956019 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In1554956019 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In1554956019 256))) (.cse1 (= (mod ~z$r_buff1_thd4~0_In1554956019 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In1554956019 |P3Thread1of1ForFork3_#t~ite12_Out1554956019|)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |P3Thread1of1ForFork3_#t~ite12_Out1554956019|)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1554956019, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1554956019, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1554956019, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1554956019} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1554956019, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1554956019, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1554956019, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1554956019, P3Thread1of1ForFork3_#t~ite12=|P3Thread1of1ForFork3_#t~ite12_Out1554956019|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite12] because there is no mapped edge [2019-12-18 17:37:40,507 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L772-2-->L772-4: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd3~0_In-792992816 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-792992816 256)))) (or (and (not .cse0) (= ~z$w_buff1~0_In-792992816 |P2Thread1of1ForFork2_#t~ite3_Out-792992816|) (not .cse1)) (and (= ~z~0_In-792992816 |P2Thread1of1ForFork2_#t~ite3_Out-792992816|) (or .cse1 .cse0)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-792992816, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-792992816, ~z$w_buff1~0=~z$w_buff1~0_In-792992816, ~z~0=~z~0_In-792992816} OutVars{P2Thread1of1ForFork2_#t~ite3=|P2Thread1of1ForFork2_#t~ite3_Out-792992816|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-792992816, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-792992816, ~z$w_buff1~0=~z$w_buff1~0_In-792992816, ~z~0=~z~0_In-792992816} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-18 17:37:40,508 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [663] [663] L772-4-->L773: Formula: (= |v_P2Thread1of1ForFork2_#t~ite3_10| v_~z~0_32) InVars {P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_10|} OutVars{P2Thread1of1ForFork2_#t~ite4=|v_P2Thread1of1ForFork2_#t~ite4_15|, P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_9|, ~z~0=v_~z~0_32} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite4, P2Thread1of1ForFork2_#t~ite3, ~z~0] because there is no mapped edge [2019-12-18 17:37:40,508 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L773-->L773-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In-470187236 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-470187236 256) 0))) (or (and (= ~z$w_buff0_used~0_In-470187236 |P2Thread1of1ForFork2_#t~ite5_Out-470187236|) (or .cse0 .cse1)) (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite5_Out-470187236| 0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-470187236, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-470187236} OutVars{P2Thread1of1ForFork2_#t~ite5=|P2Thread1of1ForFork2_#t~ite5_Out-470187236|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-470187236, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-470187236} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-18 17:37:40,508 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L774-->L774-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd3~0_In1896174220 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In1896174220 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In1896174220 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1896174220 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite6_Out1896174220| 0)) (and (= |P2Thread1of1ForFork2_#t~ite6_Out1896174220| ~z$w_buff1_used~0_In1896174220) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1896174220, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1896174220, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1896174220, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1896174220} OutVars{P2Thread1of1ForFork2_#t~ite6=|P2Thread1of1ForFork2_#t~ite6_Out1896174220|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1896174220, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1896174220, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1896174220, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1896174220} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-18 17:37:40,509 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L775-->L775-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1121613852 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1121613852 256)))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite7_Out-1121613852|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork2_#t~ite7_Out-1121613852| ~z$r_buff0_thd3~0_In-1121613852)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1121613852, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1121613852} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1121613852, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1121613852, P2Thread1of1ForFork2_#t~ite7=|P2Thread1of1ForFork2_#t~ite7_Out-1121613852|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-18 17:37:40,510 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L776-->L776-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In2141109936 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd3~0_In2141109936 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In2141109936 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd3~0_In2141109936 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd3~0_In2141109936 |P2Thread1of1ForFork2_#t~ite8_Out2141109936|)) (and (= 0 |P2Thread1of1ForFork2_#t~ite8_Out2141109936|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2141109936, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2141109936, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2141109936, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2141109936} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2141109936, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2141109936, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2141109936, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2141109936, P2Thread1of1ForFork2_#t~ite8=|P2Thread1of1ForFork2_#t~ite8_Out2141109936|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 17:37:40,510 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L776-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#t~ite8_36| v_~z$r_buff1_thd3~0_64) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_77 (+ v_~__unbuffered_cnt~0_78 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_36|} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_64, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_35|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset, P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 17:37:40,510 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L811-->L812: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd4~0_In432755265 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In432755265 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd4~0_In432755265 ~z$r_buff0_thd4~0_Out432755265)) (and (not .cse1) (not .cse0) (= 0 ~z$r_buff0_thd4~0_Out432755265)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In432755265, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In432755265} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In432755265, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out432755265, P3Thread1of1ForFork3_#t~ite13=|P3Thread1of1ForFork3_#t~ite13_Out432755265|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~ite13] because there is no mapped edge [2019-12-18 17:37:40,510 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L812-->L812-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In-1558117430 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd4~0_In-1558117430 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-1558117430 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-1558117430 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P3Thread1of1ForFork3_#t~ite14_Out-1558117430|)) (and (= ~z$r_buff1_thd4~0_In-1558117430 |P3Thread1of1ForFork3_#t~ite14_Out-1558117430|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1558117430, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1558117430, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1558117430, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1558117430} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1558117430, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1558117430, P3Thread1of1ForFork3_#t~ite14=|P3Thread1of1ForFork3_#t~ite14_Out-1558117430|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1558117430, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1558117430} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite14] because there is no mapped edge [2019-12-18 17:37:40,511 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L812-2-->P3EXIT: Formula: (and (= v_~__unbuffered_cnt~0_107 (+ v_~__unbuffered_cnt~0_108 1)) (= |v_P3Thread1of1ForFork3_#t~ite14_46| v_~z$r_buff1_thd4~0_75) (= 0 |v_P3Thread1of1ForFork3_#res.offset_5|) (= 0 |v_P3Thread1of1ForFork3_#res.base_5|)) InVars {P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_46|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_108} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_75, P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_45|, P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107, P3Thread1of1ForFork3_#res.offset=|v_P3Thread1of1ForFork3_#res.offset_5|} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, P3Thread1of1ForFork3_#t~ite14, P3Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-18 17:37:40,511 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L837-1-->L843: Formula: (and (= 4 v_~__unbuffered_cnt~0_62) (= v_~main$tmp_guard0~0_8 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_8|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet18] because there is no mapped edge [2019-12-18 17:37:40,511 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L843-2-->L843-5: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-1829542989 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1829542989 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite20_Out-1829542989| |ULTIMATE.start_main_#t~ite19_Out-1829542989|))) (or (and (= ~z~0_In-1829542989 |ULTIMATE.start_main_#t~ite19_Out-1829542989|) (or .cse0 .cse1) .cse2) (and (= ~z$w_buff1~0_In-1829542989 |ULTIMATE.start_main_#t~ite19_Out-1829542989|) (not .cse0) (not .cse1) .cse2))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1829542989, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1829542989, ~z$w_buff1~0=~z$w_buff1~0_In-1829542989, ~z~0=~z~0_In-1829542989} OutVars{ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-1829542989|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1829542989, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1829542989, ~z$w_buff1~0=~z$w_buff1~0_In-1829542989, ~z~0=~z~0_In-1829542989, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-1829542989|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-18 17:37:40,512 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L844-->L844-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1418978547 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In1418978547 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite21_Out1418978547| ~z$w_buff0_used~0_In1418978547)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite21_Out1418978547| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1418978547, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1418978547} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1418978547, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1418978547, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out1418978547|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-18 17:37:40,513 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L845-->L845-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In488969963 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In488969963 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In488969963 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In488969963 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite22_Out488969963|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In488969963 |ULTIMATE.start_main_#t~ite22_Out488969963|) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In488969963, ~z$w_buff0_used~0=~z$w_buff0_used~0_In488969963, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In488969963, ~z$w_buff1_used~0=~z$w_buff1_used~0_In488969963} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In488969963, ~z$w_buff0_used~0=~z$w_buff0_used~0_In488969963, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In488969963, ~z$w_buff1_used~0=~z$w_buff1_used~0_In488969963, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out488969963|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-18 17:37:40,513 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L846-->L846-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-2139967602 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-2139967602 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite23_Out-2139967602| ~z$r_buff0_thd0~0_In-2139967602) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite23_Out-2139967602| 0) (not .cse1) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2139967602, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2139967602} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2139967602, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2139967602, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-2139967602|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-18 17:37:40,514 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L847-->L847-2: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd0~0_In-902698343 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-902698343 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In-902698343 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In-902698343 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite24_Out-902698343|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$r_buff1_thd0~0_In-902698343 |ULTIMATE.start_main_#t~ite24_Out-902698343|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-902698343, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-902698343, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-902698343, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-902698343} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-902698343, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-902698343, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-902698343, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-902698343|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-902698343} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24] because there is no mapped edge [2019-12-18 17:37:40,515 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L855-->L855-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-194689700 256)))) (or (and (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-194689700 256)))) (or (and .cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-194689700 256))) (and .cse0 (= 0 (mod ~z$w_buff1_used~0_In-194689700 256))) (= (mod ~z$w_buff0_used~0_In-194689700 256) 0))) (= |ULTIMATE.start_main_#t~ite30_Out-194689700| |ULTIMATE.start_main_#t~ite31_Out-194689700|) .cse1 (= |ULTIMATE.start_main_#t~ite30_Out-194689700| ~z$w_buff0~0_In-194689700)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite30_In-194689700| |ULTIMATE.start_main_#t~ite30_Out-194689700|) (= ~z$w_buff0~0_In-194689700 |ULTIMATE.start_main_#t~ite31_Out-194689700|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-194689700, ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_In-194689700|, ~z$w_buff0~0=~z$w_buff0~0_In-194689700, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-194689700, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-194689700, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-194689700, ~weak$$choice2~0=~weak$$choice2~0_In-194689700} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-194689700, ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_Out-194689700|, ~z$w_buff0~0=~z$w_buff0~0_In-194689700, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-194689700, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-194689700, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-194689700, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_Out-194689700|, ~weak$$choice2~0=~weak$$choice2~0_In-194689700} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_#t~ite31] because there is no mapped edge [2019-12-18 17:37:40,516 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L856-->L856-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-661507632 256)))) (or (and .cse0 (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-661507632 256) 0))) (or (= (mod ~z$w_buff0_used~0_In-661507632 256) 0) (and .cse1 (= (mod ~z$r_buff1_thd0~0_In-661507632 256) 0)) (and (= (mod ~z$w_buff1_used~0_In-661507632 256) 0) .cse1))) (= ~z$w_buff1~0_In-661507632 |ULTIMATE.start_main_#t~ite33_Out-661507632|) (= |ULTIMATE.start_main_#t~ite33_Out-661507632| |ULTIMATE.start_main_#t~ite34_Out-661507632|)) (and (= |ULTIMATE.start_main_#t~ite33_In-661507632| |ULTIMATE.start_main_#t~ite33_Out-661507632|) (not .cse0) (= ~z$w_buff1~0_In-661507632 |ULTIMATE.start_main_#t~ite34_Out-661507632|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-661507632, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-661507632, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-661507632, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-661507632, ~z$w_buff1~0=~z$w_buff1~0_In-661507632, ~weak$$choice2~0=~weak$$choice2~0_In-661507632, ULTIMATE.start_main_#t~ite33=|ULTIMATE.start_main_#t~ite33_In-661507632|} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-661507632, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-661507632, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-661507632, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-661507632, ~z$w_buff1~0=~z$w_buff1~0_In-661507632, ~weak$$choice2~0=~weak$$choice2~0_In-661507632, ULTIMATE.start_main_#t~ite33=|ULTIMATE.start_main_#t~ite33_Out-661507632|, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out-661507632|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite33, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-18 17:37:40,518 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L859-->L860: Formula: (and (= v_~z$r_buff0_thd0~0_108 v_~z$r_buff0_thd0~0_107) (not (= 0 (mod v_~weak$$choice2~0_33 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_108, ~weak$$choice2~0=v_~weak$$choice2~0_33} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_8|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_107, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_9|, ~weak$$choice2~0=v_~weak$$choice2~0_33, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 17:37:40,519 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L860-->L860-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-2089803881 256)))) (or (and .cse0 (= |ULTIMATE.start_main_#t~ite46_Out-2089803881| |ULTIMATE.start_main_#t~ite45_Out-2089803881|) (= |ULTIMATE.start_main_#t~ite45_Out-2089803881| ~z$r_buff1_thd0~0_In-2089803881) (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-2089803881 256) 0))) (or (= 0 (mod ~z$w_buff0_used~0_In-2089803881 256)) (and (= (mod ~z$r_buff1_thd0~0_In-2089803881 256) 0) .cse1) (and (= (mod ~z$w_buff1_used~0_In-2089803881 256) 0) .cse1)))) (and (= |ULTIMATE.start_main_#t~ite45_In-2089803881| |ULTIMATE.start_main_#t~ite45_Out-2089803881|) (not .cse0) (= |ULTIMATE.start_main_#t~ite46_Out-2089803881| ~z$r_buff1_thd0~0_In-2089803881)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2089803881, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2089803881, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2089803881, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2089803881, ~weak$$choice2~0=~weak$$choice2~0_In-2089803881, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_In-2089803881|} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2089803881, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2089803881, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2089803881, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2089803881, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-2089803881|, ~weak$$choice2~0=~weak$$choice2~0_In-2089803881, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-2089803881|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 17:37:40,519 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L862-->L4: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5| (mod v_~main$tmp_guard1~0_8 256)) (not (= 0 (mod v_~z$flush_delayed~0_30 256))) (= v_~z$mem_tmp~0_20 v_~z~0_83) (= 0 v_~z$flush_delayed~0_29)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_20, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~z$flush_delayed~0=v_~z$flush_delayed~0_30} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_20, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_9, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_17|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~z$flush_delayed~0=v_~z$flush_delayed~0_29, ~z~0=v_~z~0_83, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~z$flush_delayed~0, ~z~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 17:37:40,519 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 17:37:40,624 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 05:37:40 BasicIcfg [2019-12-18 17:37:40,624 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 17:37:40,626 INFO L168 Benchmark]: Toolchain (without parser) took 30519.89 ms. Allocated memory was 142.6 MB in the beginning and 1.6 GB in the end (delta: 1.4 GB). Free memory was 97.7 MB in the beginning and 761.1 MB in the end (delta: -663.4 MB). Peak memory consumption was 776.8 MB. Max. memory is 7.1 GB. [2019-12-18 17:37:40,627 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 142.6 MB. Free memory was 117.6 MB in the beginning and 117.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 17:37:40,628 INFO L168 Benchmark]: CACSL2BoogieTranslator took 804.53 ms. Allocated memory was 142.6 MB in the beginning and 200.3 MB in the end (delta: 57.7 MB). Free memory was 97.3 MB in the beginning and 153.9 MB in the end (delta: -56.6 MB). Peak memory consumption was 20.9 MB. Max. memory is 7.1 GB. [2019-12-18 17:37:40,628 INFO L168 Benchmark]: Boogie Procedure Inliner took 86.69 ms. Allocated memory is still 200.3 MB. Free memory was 153.2 MB in the beginning and 150.4 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-18 17:37:40,629 INFO L168 Benchmark]: Boogie Preprocessor took 38.98 ms. Allocated memory is still 200.3 MB. Free memory was 150.4 MB in the beginning and 148.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-18 17:37:40,630 INFO L168 Benchmark]: RCFGBuilder took 876.85 ms. Allocated memory is still 200.3 MB. Free memory was 148.3 MB in the beginning and 98.6 MB in the end (delta: 49.7 MB). Peak memory consumption was 49.7 MB. Max. memory is 7.1 GB. [2019-12-18 17:37:40,637 INFO L168 Benchmark]: TraceAbstraction took 28705.23 ms. Allocated memory was 200.3 MB in the beginning and 1.6 GB in the end (delta: 1.4 GB). Free memory was 98.6 MB in the beginning and 761.1 MB in the end (delta: -662.6 MB). Peak memory consumption was 720.0 MB. Max. memory is 7.1 GB. [2019-12-18 17:37:40,643 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.23 ms. Allocated memory is still 142.6 MB. Free memory was 117.6 MB in the beginning and 117.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 804.53 ms. Allocated memory was 142.6 MB in the beginning and 200.3 MB in the end (delta: 57.7 MB). Free memory was 97.3 MB in the beginning and 153.9 MB in the end (delta: -56.6 MB). Peak memory consumption was 20.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 86.69 ms. Allocated memory is still 200.3 MB. Free memory was 153.2 MB in the beginning and 150.4 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.98 ms. Allocated memory is still 200.3 MB. Free memory was 150.4 MB in the beginning and 148.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 876.85 ms. Allocated memory is still 200.3 MB. Free memory was 148.3 MB in the beginning and 98.6 MB in the end (delta: 49.7 MB). Peak memory consumption was 49.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 28705.23 ms. Allocated memory was 200.3 MB in the beginning and 1.6 GB in the end (delta: 1.4 GB). Free memory was 98.6 MB in the beginning and 761.1 MB in the end (delta: -662.6 MB). Peak memory consumption was 720.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.9s, 180 ProgramPointsBefore, 89 ProgramPointsAfterwards, 208 TransitionsBefore, 95 TransitionsAfterwards, 12668 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 36 ConcurrentYvCompositions, 27 ChoiceCompositions, 5121 VarBasedMoverChecksPositive, 269 VarBasedMoverChecksNegative, 136 SemBasedMoverChecksPositive, 198 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.6s, 0 MoverChecksTotal, 49999 CheckedPairsTotal, 122 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L831] FCALL, FORK 0 pthread_create(&t1269, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L833] FCALL, FORK 0 pthread_create(&t1270, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L835] FCALL, FORK 0 pthread_create(&t1271, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L837] FCALL, FORK 0 pthread_create(&t1272, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L786] 4 z$w_buff1 = z$w_buff0 [L787] 4 z$w_buff0 = 2 [L788] 4 z$w_buff1_used = z$w_buff0_used [L789] 4 z$w_buff0_used = (_Bool)1 [L808] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 3 y = 2 [L769] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L808] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L772] 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L809] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L773] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L774] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L775] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L810] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L843] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L843] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L844] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L845] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L846] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L847] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L850] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L851] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L852] 0 z$flush_delayed = weak$$choice2 [L853] 0 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L854] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L854] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L855] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L856] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L857] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L857] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L858] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L858] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L860] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L861] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 168 locations, 2 error locations. Result: UNSAFE, OverallTime: 28.3s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 9.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1761 SDtfs, 2207 SDslu, 4797 SDs, 0 SdLazy, 3014 SolverSat, 184 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 171 GetRequests, 23 SyntacticMatches, 13 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 454 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=47746occurred 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: 5.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 7603 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 2.3s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 810 NumberOfCodeBlocks, 810 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 733 ConstructedInterpolants, 0 QuantifiedInterpolants, 194331 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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...