/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix016_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 16:01:36,827 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 16:01:36,829 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 16:01:36,841 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 16:01:36,841 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 16:01:36,842 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 16:01:36,844 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 16:01:36,846 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 16:01:36,848 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 16:01:36,849 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 16:01:36,850 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 16:01:36,851 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 16:01:36,852 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 16:01:36,853 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 16:01:36,854 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 16:01:36,855 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 16:01:36,856 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 16:01:36,857 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 16:01:36,859 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 16:01:36,861 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 16:01:36,862 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 16:01:36,864 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 16:01:36,865 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 16:01:36,866 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 16:01:36,868 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 16:01:36,868 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 16:01:36,869 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 16:01:36,870 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 16:01:36,870 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 16:01:36,871 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 16:01:36,872 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 16:01:36,873 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 16:01:36,874 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 16:01:36,875 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 16:01:36,876 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 16:01:36,876 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 16:01:36,877 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 16:01:36,877 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 16:01:36,877 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 16:01:36,878 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 16:01:36,879 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 16:01:36,880 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf [2019-12-27 16:01:36,895 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 16:01:36,895 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 16:01:36,896 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 16:01:36,896 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 16:01:36,896 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 16:01:36,897 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 16:01:36,897 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 16:01:36,897 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 16:01:36,897 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 16:01:36,898 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 16:01:36,898 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 16:01:36,898 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 16:01:36,898 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 16:01:36,898 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 16:01:36,898 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 16:01:36,899 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 16:01:36,899 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 16:01:36,899 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 16:01:36,899 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 16:01:36,900 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 16:01:36,900 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 16:01:36,900 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 16:01:36,900 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 16:01:36,900 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 16:01:36,901 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 16:01:36,901 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 16:01:36,901 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 16:01:36,901 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 16:01:36,902 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 16:01:36,902 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 16:01:36,902 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 16:01:37,235 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 16:01:37,248 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 16:01:37,252 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 16:01:37,253 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 16:01:37,254 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 16:01:37,254 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix016_power.oepc.i [2019-12-27 16:01:37,333 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15a8d9607/4ab98892332a401691219dce190ee830/FLAG0c4d6b526 [2019-12-27 16:01:37,846 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 16:01:37,847 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix016_power.oepc.i [2019-12-27 16:01:37,861 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15a8d9607/4ab98892332a401691219dce190ee830/FLAG0c4d6b526 [2019-12-27 16:01:38,156 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15a8d9607/4ab98892332a401691219dce190ee830 [2019-12-27 16:01:38,166 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 16:01:38,168 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 16:01:38,169 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 16:01:38,169 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 16:01:38,173 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 16:01:38,174 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:01:38" (1/1) ... [2019-12-27 16:01:38,176 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a1e95ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:01:38, skipping insertion in model container [2019-12-27 16:01:38,177 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:01:38" (1/1) ... [2019-12-27 16:01:38,184 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 16:01:38,242 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 16:01:38,775 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 16:01:38,791 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 16:01:38,905 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 16:01:38,992 INFO L208 MainTranslator]: Completed translation [2019-12-27 16:01:38,992 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:01:38 WrapperNode [2019-12-27 16:01:38,992 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 16:01:38,994 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 16:01:38,994 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 16:01:38,994 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 16:01:39,005 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:01:38" (1/1) ... [2019-12-27 16:01:39,029 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:01:38" (1/1) ... [2019-12-27 16:01:39,059 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 16:01:39,059 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 16:01:39,059 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 16:01:39,059 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 16:01:39,070 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:01:38" (1/1) ... [2019-12-27 16:01:39,070 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:01:38" (1/1) ... [2019-12-27 16:01:39,075 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:01:38" (1/1) ... [2019-12-27 16:01:39,075 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:01:38" (1/1) ... [2019-12-27 16:01:39,086 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:01:38" (1/1) ... [2019-12-27 16:01:39,090 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:01:38" (1/1) ... [2019-12-27 16:01:39,094 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:01:38" (1/1) ... [2019-12-27 16:01:39,099 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 16:01:39,100 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 16:01:39,100 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 16:01:39,100 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 16:01:39,101 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:01:38" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 16:01:39,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 16:01:39,174 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 16:01:39,174 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 16:01:39,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 16:01:39,175 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 16:01:39,175 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 16:01:39,176 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 16:01:39,176 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 16:01:39,177 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 16:01:39,177 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 16:01:39,177 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 16:01:39,178 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 16:01:39,178 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 16:01:39,180 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 16:01:40,002 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 16:01:40,003 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 16:01:40,004 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:01:40 BoogieIcfgContainer [2019-12-27 16:01:40,005 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 16:01:40,006 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 16:01:40,006 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 16:01:40,010 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 16:01:40,011 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 04:01:38" (1/3) ... [2019-12-27 16:01:40,011 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18259b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:01:40, skipping insertion in model container [2019-12-27 16:01:40,012 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:01:38" (2/3) ... [2019-12-27 16:01:40,012 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18259b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:01:40, skipping insertion in model container [2019-12-27 16:01:40,012 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:01:40" (3/3) ... [2019-12-27 16:01:40,014 INFO L109 eAbstractionObserver]: Analyzing ICFG mix016_power.oepc.i [2019-12-27 16:01:40,026 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 16:01:40,026 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 16:01:40,034 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 16:01:40,035 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 16:01:40,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,081 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,081 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,081 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,082 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,082 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,083 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,083 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,084 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,084 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,084 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,084 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,085 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,085 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,085 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,085 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,086 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,086 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,086 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,086 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,087 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,087 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,087 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,087 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,088 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,088 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,088 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,088 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,089 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,090 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,091 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,092 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,095 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,095 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,122 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,135 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,136 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,136 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,136 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,136 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,136 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,137 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,137 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,138 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,138 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,138 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,138 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,138 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,139 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,139 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,140 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,140 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,140 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,140 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,141 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,141 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,142 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,142 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,142 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,142 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,143 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,143 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,143 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,143 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,143 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,143 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,147 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,149 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,149 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,149 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,149 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,149 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,149 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,151 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,151 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,151 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,151 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,151 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,151 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,151 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,152 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,157 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,157 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,157 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,157 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,172 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,172 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,172 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,173 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,173 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,173 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,173 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,173 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,173 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,174 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,174 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,174 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,174 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,174 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,175 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,175 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,175 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,175 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,175 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,175 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,176 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,176 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,176 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,176 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,176 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,176 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,177 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,177 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,177 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,177 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,177 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,178 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,178 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,181 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,181 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,181 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,182 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,182 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,182 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,182 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,182 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,183 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,183 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,183 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,183 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,189 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,189 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,189 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,189 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,190 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,190 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,190 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,190 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,190 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,191 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:01:40,215 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 16:01:40,238 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 16:01:40,238 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 16:01:40,238 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 16:01:40,238 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 16:01:40,239 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 16:01:40,239 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 16:01:40,239 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 16:01:40,239 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 16:01:40,258 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 177 places, 214 transitions [2019-12-27 16:01:40,260 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-27 16:01:40,400 INFO L132 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-27 16:01:40,400 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 16:01:40,417 INFO L76 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 211 events. 47/211 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 436 event pairs. 0/162 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 16:01:40,440 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-27 16:01:40,527 INFO L132 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-27 16:01:40,528 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 16:01:40,537 INFO L76 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 211 events. 47/211 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 436 event pairs. 0/162 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 16:01:40,559 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 16:01:40,560 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 16:01:45,610 WARN L192 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 84 [2019-12-27 16:01:45,736 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2019-12-27 16:01:45,974 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-27 16:01:46,108 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-27 16:01:46,138 INFO L206 etLargeBlockEncoding]: Checked pairs total: 89688 [2019-12-27 16:01:46,138 INFO L214 etLargeBlockEncoding]: Total number of compositions: 119 [2019-12-27 16:01:46,142 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 92 places, 101 transitions [2019-12-27 16:02:02,711 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 106864 states. [2019-12-27 16:02:02,713 INFO L276 IsEmpty]: Start isEmpty. Operand 106864 states. [2019-12-27 16:02:02,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 16:02:02,719 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:02:02,720 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 16:02:02,721 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:02:02,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:02:02,725 INFO L82 PathProgramCache]: Analyzing trace with hash 921701, now seen corresponding path program 1 times [2019-12-27 16:02:02,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:02:02,735 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665378720] [2019-12-27 16:02:02,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:02:02,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:02:02,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:02:02,975 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665378720] [2019-12-27 16:02:02,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:02:02,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 16:02:02,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [319926168] [2019-12-27 16:02:02,979 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:02:02,985 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:02:02,999 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 16:02:03,000 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:02:03,004 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:02:03,005 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:02:03,005 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:02:03,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:02:03,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:02:03,023 INFO L87 Difference]: Start difference. First operand 106864 states. Second operand 3 states. [2019-12-27 16:02:06,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:02:06,112 INFO L93 Difference]: Finished difference Result 106034 states and 453004 transitions. [2019-12-27 16:02:06,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:02:06,114 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 16:02:06,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:02:06,713 INFO L225 Difference]: With dead ends: 106034 [2019-12-27 16:02:06,713 INFO L226 Difference]: Without dead ends: 99950 [2019-12-27 16:02:06,714 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:02:10,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99950 states. [2019-12-27 16:02:13,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99950 to 99950. [2019-12-27 16:02:13,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99950 states. [2019-12-27 16:02:17,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99950 states to 99950 states and 426445 transitions. [2019-12-27 16:02:17,015 INFO L78 Accepts]: Start accepts. Automaton has 99950 states and 426445 transitions. Word has length 3 [2019-12-27 16:02:17,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:02:17,015 INFO L462 AbstractCegarLoop]: Abstraction has 99950 states and 426445 transitions. [2019-12-27 16:02:17,015 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:02:17,015 INFO L276 IsEmpty]: Start isEmpty. Operand 99950 states and 426445 transitions. [2019-12-27 16:02:17,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 16:02:17,022 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:02:17,025 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:02:17,025 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:02:17,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:02:17,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1680645281, now seen corresponding path program 1 times [2019-12-27 16:02:17,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:02:17,026 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28025229] [2019-12-27 16:02:17,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:02:17,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:02:17,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:02:17,201 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28025229] [2019-12-27 16:02:17,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:02:17,201 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:02:17,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1354420014] [2019-12-27 16:02:17,202 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:02:17,203 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:02:17,207 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 16:02:17,207 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:02:17,208 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:02:17,209 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:02:17,209 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:02:17,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:02:17,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:02:17,210 INFO L87 Difference]: Start difference. First operand 99950 states and 426445 transitions. Second operand 4 states. [2019-12-27 16:02:23,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:02:23,055 INFO L93 Difference]: Finished difference Result 159384 states and 652094 transitions. [2019-12-27 16:02:23,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:02:23,056 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 16:02:23,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:02:23,742 INFO L225 Difference]: With dead ends: 159384 [2019-12-27 16:02:23,742 INFO L226 Difference]: Without dead ends: 159335 [2019-12-27 16:02:23,743 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:02:28,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159335 states. [2019-12-27 16:02:32,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159335 to 143879. [2019-12-27 16:02:32,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143879 states. [2019-12-27 16:02:32,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143879 states to 143879 states and 597281 transitions. [2019-12-27 16:02:32,482 INFO L78 Accepts]: Start accepts. Automaton has 143879 states and 597281 transitions. Word has length 11 [2019-12-27 16:02:32,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:02:32,483 INFO L462 AbstractCegarLoop]: Abstraction has 143879 states and 597281 transitions. [2019-12-27 16:02:32,483 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:02:32,483 INFO L276 IsEmpty]: Start isEmpty. Operand 143879 states and 597281 transitions. [2019-12-27 16:02:32,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 16:02:32,490 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:02:32,490 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:02:32,490 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:02:32,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:02:32,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1535099311, now seen corresponding path program 1 times [2019-12-27 16:02:32,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:02:32,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588263095] [2019-12-27 16:02:32,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:02:32,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:02:32,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:02:32,615 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588263095] [2019-12-27 16:02:32,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:02:32,615 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:02:32,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [415167064] [2019-12-27 16:02:32,616 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:02:32,617 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:02:32,619 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 16:02:32,619 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:02:32,619 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:02:32,619 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:02:32,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:02:32,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:02:32,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:02:32,620 INFO L87 Difference]: Start difference. First operand 143879 states and 597281 transitions. Second operand 4 states. [2019-12-27 16:02:37,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:02:37,154 INFO L93 Difference]: Finished difference Result 42595 states and 146341 transitions. [2019-12-27 16:02:37,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 16:02:37,155 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 16:02:37,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:02:37,216 INFO L225 Difference]: With dead ends: 42595 [2019-12-27 16:02:37,216 INFO L226 Difference]: Without dead ends: 32718 [2019-12-27 16:02:37,216 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:02:37,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32718 states. [2019-12-27 16:02:37,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32718 to 32622. [2019-12-27 16:02:37,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32622 states. [2019-12-27 16:02:37,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32622 states to 32622 states and 106518 transitions. [2019-12-27 16:02:37,831 INFO L78 Accepts]: Start accepts. Automaton has 32622 states and 106518 transitions. Word has length 13 [2019-12-27 16:02:37,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:02:37,832 INFO L462 AbstractCegarLoop]: Abstraction has 32622 states and 106518 transitions. [2019-12-27 16:02:37,832 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:02:37,832 INFO L276 IsEmpty]: Start isEmpty. Operand 32622 states and 106518 transitions. [2019-12-27 16:02:37,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 16:02:37,835 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:02:37,835 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:02:37,835 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:02:37,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:02:37,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1228744872, now seen corresponding path program 1 times [2019-12-27 16:02:37,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:02:37,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200169334] [2019-12-27 16:02:37,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:02:37,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:02:37,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:02:37,924 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200169334] [2019-12-27 16:02:37,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:02:37,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:02:37,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1457518025] [2019-12-27 16:02:37,925 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:02:37,927 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:02:37,930 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 16:02:37,930 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:02:37,931 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:02:37,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:02:37,931 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:02:37,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:02:37,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:02:37,932 INFO L87 Difference]: Start difference. First operand 32622 states and 106518 transitions. Second operand 4 states. [2019-12-27 16:02:38,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:02:38,373 INFO L93 Difference]: Finished difference Result 41342 states and 134101 transitions. [2019-12-27 16:02:38,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:02:38,374 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 16:02:38,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:02:38,473 INFO L225 Difference]: With dead ends: 41342 [2019-12-27 16:02:38,473 INFO L226 Difference]: Without dead ends: 41342 [2019-12-27 16:02:38,474 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:02:38,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41342 states. [2019-12-27 16:02:39,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41342 to 37015. [2019-12-27 16:02:39,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37015 states. [2019-12-27 16:02:39,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37015 states to 37015 states and 120557 transitions. [2019-12-27 16:02:39,546 INFO L78 Accepts]: Start accepts. Automaton has 37015 states and 120557 transitions. Word has length 16 [2019-12-27 16:02:39,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:02:39,547 INFO L462 AbstractCegarLoop]: Abstraction has 37015 states and 120557 transitions. [2019-12-27 16:02:39,547 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:02:39,547 INFO L276 IsEmpty]: Start isEmpty. Operand 37015 states and 120557 transitions. [2019-12-27 16:02:39,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 16:02:39,549 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:02:39,549 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:02:39,550 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:02:39,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:02:39,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1228651655, now seen corresponding path program 1 times [2019-12-27 16:02:39,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:02:39,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442134721] [2019-12-27 16:02:39,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:02:39,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:02:39,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:02:39,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442134721] [2019-12-27 16:02:39,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:02:39,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:02:39,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2041814450] [2019-12-27 16:02:39,634 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:02:39,636 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:02:39,638 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 16:02:39,639 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:02:39,639 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:02:39,639 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:02:39,639 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:02:39,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:02:39,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:02:39,640 INFO L87 Difference]: Start difference. First operand 37015 states and 120557 transitions. Second operand 4 states. [2019-12-27 16:02:39,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:02:39,981 INFO L93 Difference]: Finished difference Result 44892 states and 145334 transitions. [2019-12-27 16:02:39,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:02:39,982 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 16:02:39,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:02:40,052 INFO L225 Difference]: With dead ends: 44892 [2019-12-27 16:02:40,052 INFO L226 Difference]: Without dead ends: 44892 [2019-12-27 16:02:40,053 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:02:40,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44892 states. [2019-12-27 16:02:40,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44892 to 36810. [2019-12-27 16:02:40,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36810 states. [2019-12-27 16:02:40,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36810 states to 36810 states and 119696 transitions. [2019-12-27 16:02:40,731 INFO L78 Accepts]: Start accepts. Automaton has 36810 states and 119696 transitions. Word has length 16 [2019-12-27 16:02:40,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:02:40,732 INFO L462 AbstractCegarLoop]: Abstraction has 36810 states and 119696 transitions. [2019-12-27 16:02:40,732 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:02:40,732 INFO L276 IsEmpty]: Start isEmpty. Operand 36810 states and 119696 transitions. [2019-12-27 16:02:40,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 16:02:40,741 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:02:40,742 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] [2019-12-27 16:02:40,742 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:02:40,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:02:40,742 INFO L82 PathProgramCache]: Analyzing trace with hash -1838789338, now seen corresponding path program 1 times [2019-12-27 16:02:40,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:02:40,743 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579413309] [2019-12-27 16:02:40,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:02:40,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:02:40,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:02:40,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579413309] [2019-12-27 16:02:40,875 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:02:40,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:02:40,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [475927676] [2019-12-27 16:02:40,879 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:02:40,882 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:02:40,889 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 37 states and 50 transitions. [2019-12-27 16:02:40,890 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:02:40,891 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:02:40,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:02:40,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:02:40,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:02:40,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:02:40,892 INFO L87 Difference]: Start difference. First operand 36810 states and 119696 transitions. Second operand 5 states. [2019-12-27 16:02:41,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:02:41,760 INFO L93 Difference]: Finished difference Result 55448 states and 177239 transitions. [2019-12-27 16:02:41,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 16:02:41,760 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 16:02:41,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:02:41,850 INFO L225 Difference]: With dead ends: 55448 [2019-12-27 16:02:41,850 INFO L226 Difference]: Without dead ends: 55392 [2019-12-27 16:02:41,850 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 16:02:42,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55392 states. [2019-12-27 16:02:42,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55392 to 38696. [2019-12-27 16:02:42,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38696 states. [2019-12-27 16:02:42,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38696 states to 38696 states and 125822 transitions. [2019-12-27 16:02:42,622 INFO L78 Accepts]: Start accepts. Automaton has 38696 states and 125822 transitions. Word has length 22 [2019-12-27 16:02:42,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:02:42,622 INFO L462 AbstractCegarLoop]: Abstraction has 38696 states and 125822 transitions. [2019-12-27 16:02:42,622 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:02:42,622 INFO L276 IsEmpty]: Start isEmpty. Operand 38696 states and 125822 transitions. [2019-12-27 16:02:42,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 16:02:42,630 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:02:42,631 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] [2019-12-27 16:02:42,631 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:02:42,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:02:42,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1838882555, now seen corresponding path program 1 times [2019-12-27 16:02:42,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:02:42,632 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17895698] [2019-12-27 16:02:42,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:02:42,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:02:42,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:02:42,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17895698] [2019-12-27 16:02:42,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:02:42,718 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:02:42,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [465147063] [2019-12-27 16:02:42,719 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:02:42,722 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:02:42,729 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 37 states and 50 transitions. [2019-12-27 16:02:42,729 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:02:42,730 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:02:42,730 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:02:42,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:02:42,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:02:42,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:02:42,731 INFO L87 Difference]: Start difference. First operand 38696 states and 125822 transitions. Second operand 5 states. [2019-12-27 16:02:43,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:02:43,425 INFO L93 Difference]: Finished difference Result 57418 states and 182937 transitions. [2019-12-27 16:02:43,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 16:02:43,425 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 16:02:43,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:02:43,519 INFO L225 Difference]: With dead ends: 57418 [2019-12-27 16:02:43,519 INFO L226 Difference]: Without dead ends: 57362 [2019-12-27 16:02:43,520 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 16:02:44,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57362 states. [2019-12-27 16:02:44,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57362 to 36190. [2019-12-27 16:02:44,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36190 states. [2019-12-27 16:02:44,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36190 states to 36190 states and 117443 transitions. [2019-12-27 16:02:44,542 INFO L78 Accepts]: Start accepts. Automaton has 36190 states and 117443 transitions. Word has length 22 [2019-12-27 16:02:44,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:02:44,543 INFO L462 AbstractCegarLoop]: Abstraction has 36190 states and 117443 transitions. [2019-12-27 16:02:44,543 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:02:44,543 INFO L276 IsEmpty]: Start isEmpty. Operand 36190 states and 117443 transitions. [2019-12-27 16:02:44,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 16:02:44,555 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:02:44,555 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:02:44,555 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:02:44,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:02:44,556 INFO L82 PathProgramCache]: Analyzing trace with hash 320469370, now seen corresponding path program 1 times [2019-12-27 16:02:44,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:02:44,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213362295] [2019-12-27 16:02:44,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:02:44,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:02:44,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:02:44,628 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213362295] [2019-12-27 16:02:44,628 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:02:44,628 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 16:02:44,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2046442110] [2019-12-27 16:02:44,629 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:02:44,632 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:02:44,641 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 16:02:44,642 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:02:44,688 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 16:02:44,689 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 16:02:44,689 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:02:44,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 16:02:44,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:02:44,690 INFO L87 Difference]: Start difference. First operand 36190 states and 117443 transitions. Second operand 6 states. [2019-12-27 16:02:44,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:02:44,809 INFO L93 Difference]: Finished difference Result 16540 states and 50684 transitions. [2019-12-27 16:02:44,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:02:44,810 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-27 16:02:44,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:02:44,830 INFO L225 Difference]: With dead ends: 16540 [2019-12-27 16:02:44,831 INFO L226 Difference]: Without dead ends: 14450 [2019-12-27 16:02:44,831 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-27 16:02:44,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14450 states. [2019-12-27 16:02:45,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14450 to 14072. [2019-12-27 16:02:45,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14072 states. [2019-12-27 16:02:45,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14072 states to 14072 states and 43137 transitions. [2019-12-27 16:02:45,040 INFO L78 Accepts]: Start accepts. Automaton has 14072 states and 43137 transitions. Word has length 25 [2019-12-27 16:02:45,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:02:45,041 INFO L462 AbstractCegarLoop]: Abstraction has 14072 states and 43137 transitions. [2019-12-27 16:02:45,041 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 16:02:45,041 INFO L276 IsEmpty]: Start isEmpty. Operand 14072 states and 43137 transitions. [2019-12-27 16:02:45,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 16:02:45,050 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:02:45,050 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:02:45,051 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:02:45,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:02:45,051 INFO L82 PathProgramCache]: Analyzing trace with hash 270212897, now seen corresponding path program 1 times [2019-12-27 16:02:45,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:02:45,052 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968110875] [2019-12-27 16:02:45,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:02:45,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:02:45,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:02:45,088 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968110875] [2019-12-27 16:02:45,088 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:02:45,088 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:02:45,088 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [441412597] [2019-12-27 16:02:45,089 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:02:45,093 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:02:45,099 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 16:02:45,099 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:02:45,100 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:02:45,100 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:02:45,100 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:02:45,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:02:45,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:02:45,101 INFO L87 Difference]: Start difference. First operand 14072 states and 43137 transitions. Second operand 3 states. [2019-12-27 16:02:45,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:02:45,201 INFO L93 Difference]: Finished difference Result 21734 states and 66035 transitions. [2019-12-27 16:02:45,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:02:45,201 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-27 16:02:45,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:02:45,230 INFO L225 Difference]: With dead ends: 21734 [2019-12-27 16:02:45,230 INFO L226 Difference]: Without dead ends: 21734 [2019-12-27 16:02:45,230 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:02:45,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21734 states. [2019-12-27 16:02:45,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21734 to 16316. [2019-12-27 16:02:45,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16316 states. [2019-12-27 16:02:45,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16316 states to 16316 states and 50294 transitions. [2019-12-27 16:02:45,509 INFO L78 Accepts]: Start accepts. Automaton has 16316 states and 50294 transitions. Word has length 27 [2019-12-27 16:02:45,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:02:45,509 INFO L462 AbstractCegarLoop]: Abstraction has 16316 states and 50294 transitions. [2019-12-27 16:02:45,510 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:02:45,510 INFO L276 IsEmpty]: Start isEmpty. Operand 16316 states and 50294 transitions. [2019-12-27 16:02:45,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 16:02:45,521 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:02:45,521 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:02:45,521 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:02:45,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:02:45,522 INFO L82 PathProgramCache]: Analyzing trace with hash 2064759266, now seen corresponding path program 1 times [2019-12-27 16:02:45,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:02:45,522 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657211442] [2019-12-27 16:02:45,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:02:45,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:02:45,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:02:45,564 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657211442] [2019-12-27 16:02:45,565 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:02:45,565 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:02:45,565 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [110507076] [2019-12-27 16:02:45,565 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:02:45,569 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:02:45,575 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 16:02:45,575 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:02:45,575 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:02:45,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:02:45,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:02:45,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:02:45,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:02:45,576 INFO L87 Difference]: Start difference. First operand 16316 states and 50294 transitions. Second operand 3 states. [2019-12-27 16:02:45,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:02:45,823 INFO L93 Difference]: Finished difference Result 21734 states and 64509 transitions. [2019-12-27 16:02:45,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:02:45,823 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-27 16:02:45,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:02:45,869 INFO L225 Difference]: With dead ends: 21734 [2019-12-27 16:02:45,870 INFO L226 Difference]: Without dead ends: 21734 [2019-12-27 16:02:45,870 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:02:46,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21734 states. [2019-12-27 16:02:46,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21734 to 16316. [2019-12-27 16:02:46,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16316 states. [2019-12-27 16:02:46,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16316 states to 16316 states and 48768 transitions. [2019-12-27 16:02:46,324 INFO L78 Accepts]: Start accepts. Automaton has 16316 states and 48768 transitions. Word has length 27 [2019-12-27 16:02:46,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:02:46,324 INFO L462 AbstractCegarLoop]: Abstraction has 16316 states and 48768 transitions. [2019-12-27 16:02:46,324 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:02:46,324 INFO L276 IsEmpty]: Start isEmpty. Operand 16316 states and 48768 transitions. [2019-12-27 16:02:46,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 16:02:46,341 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:02:46,341 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:02:46,341 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:02:46,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:02:46,342 INFO L82 PathProgramCache]: Analyzing trace with hash 2010439622, now seen corresponding path program 1 times [2019-12-27 16:02:46,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:02:46,342 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962621908] [2019-12-27 16:02:46,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:02:46,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:02:46,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-27 16:02:46,439 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962621908] [2019-12-27 16:02:46,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:02:46,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:02:46,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [658496686] [2019-12-27 16:02:46,440 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:02:46,444 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:02:46,449 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 16:02:46,449 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:02:46,450 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:02:46,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:02:46,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:02:46,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:02:46,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:02:46,451 INFO L87 Difference]: Start difference. First operand 16316 states and 48768 transitions. Second operand 5 states. [2019-12-27 16:02:46,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:02:46,795 INFO L93 Difference]: Finished difference Result 20324 states and 59872 transitions. [2019-12-27 16:02:46,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 16:02:46,796 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-27 16:02:46,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:02:46,822 INFO L225 Difference]: With dead ends: 20324 [2019-12-27 16:02:46,823 INFO L226 Difference]: Without dead ends: 20169 [2019-12-27 16:02:46,823 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:02:46,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20169 states. [2019-12-27 16:02:47,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20169 to 18915. [2019-12-27 16:02:47,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18915 states. [2019-12-27 16:02:47,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18915 states to 18915 states and 56307 transitions. [2019-12-27 16:02:47,100 INFO L78 Accepts]: Start accepts. Automaton has 18915 states and 56307 transitions. Word has length 27 [2019-12-27 16:02:47,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:02:47,100 INFO L462 AbstractCegarLoop]: Abstraction has 18915 states and 56307 transitions. [2019-12-27 16:02:47,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:02:47,100 INFO L276 IsEmpty]: Start isEmpty. Operand 18915 states and 56307 transitions. [2019-12-27 16:02:47,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 16:02:47,112 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:02:47,112 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:02:47,112 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:02:47,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:02:47,113 INFO L82 PathProgramCache]: Analyzing trace with hash 773295241, now seen corresponding path program 1 times [2019-12-27 16:02:47,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:02:47,113 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199834124] [2019-12-27 16:02:47,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:02:47,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:02:47,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:02:47,214 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199834124] [2019-12-27 16:02:47,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:02:47,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:02:47,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1048485633] [2019-12-27 16:02:47,214 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:02:47,219 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:02:47,226 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 29 states and 28 transitions. [2019-12-27 16:02:47,226 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:02:47,226 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:02:47,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 16:02:47,227 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:02:47,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 16:02:47,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:02:47,227 INFO L87 Difference]: Start difference. First operand 18915 states and 56307 transitions. Second operand 6 states. [2019-12-27 16:02:47,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:02:47,388 INFO L93 Difference]: Finished difference Result 24824 states and 72826 transitions. [2019-12-27 16:02:47,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 16:02:47,389 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-27 16:02:47,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:02:47,438 INFO L225 Difference]: With dead ends: 24824 [2019-12-27 16:02:47,438 INFO L226 Difference]: Without dead ends: 24824 [2019-12-27 16:02:47,438 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:02:47,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24824 states. [2019-12-27 16:02:47,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24824 to 19207. [2019-12-27 16:02:47,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19207 states. [2019-12-27 16:02:47,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19207 states to 19207 states and 57041 transitions. [2019-12-27 16:02:47,887 INFO L78 Accepts]: Start accepts. Automaton has 19207 states and 57041 transitions. Word has length 28 [2019-12-27 16:02:47,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:02:47,888 INFO L462 AbstractCegarLoop]: Abstraction has 19207 states and 57041 transitions. [2019-12-27 16:02:47,888 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 16:02:47,888 INFO L276 IsEmpty]: Start isEmpty. Operand 19207 states and 57041 transitions. [2019-12-27 16:02:47,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 16:02:47,902 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:02:47,902 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-27 16:02:47,903 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:02:47,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:02:47,903 INFO L82 PathProgramCache]: Analyzing trace with hash -1192824778, now seen corresponding path program 1 times [2019-12-27 16:02:47,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:02:47,904 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429910649] [2019-12-27 16:02:47,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:02:47,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:02:47,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:02:47,995 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429910649] [2019-12-27 16:02:47,995 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:02:47,995 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:02:47,995 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [260081441] [2019-12-27 16:02:47,995 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:02:48,000 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:02:48,008 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 30 states and 29 transitions. [2019-12-27 16:02:48,008 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:02:48,008 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:02:48,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:02:48,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:02:48,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:02:48,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:02:48,009 INFO L87 Difference]: Start difference. First operand 19207 states and 57041 transitions. Second operand 5 states. [2019-12-27 16:02:48,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:02:48,409 INFO L93 Difference]: Finished difference Result 22495 states and 65751 transitions. [2019-12-27 16:02:48,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 16:02:48,409 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-12-27 16:02:48,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:02:48,446 INFO L225 Difference]: With dead ends: 22495 [2019-12-27 16:02:48,446 INFO L226 Difference]: Without dead ends: 22333 [2019-12-27 16:02:48,447 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:02:48,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22333 states. [2019-12-27 16:02:48,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22333 to 19265. [2019-12-27 16:02:48,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19265 states. [2019-12-27 16:02:48,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19265 states to 19265 states and 57047 transitions. [2019-12-27 16:02:48,888 INFO L78 Accepts]: Start accepts. Automaton has 19265 states and 57047 transitions. Word has length 29 [2019-12-27 16:02:48,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:02:48,888 INFO L462 AbstractCegarLoop]: Abstraction has 19265 states and 57047 transitions. [2019-12-27 16:02:48,888 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:02:48,888 INFO L276 IsEmpty]: Start isEmpty. Operand 19265 states and 57047 transitions. [2019-12-27 16:02:48,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 16:02:48,907 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:02:48,907 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] [2019-12-27 16:02:48,907 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:02:48,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:02:48,908 INFO L82 PathProgramCache]: Analyzing trace with hash -809721720, now seen corresponding path program 1 times [2019-12-27 16:02:48,908 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:02:48,908 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046976730] [2019-12-27 16:02:48,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:02:48,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:02:48,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:02:48,999 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046976730] [2019-12-27 16:02:48,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:02:48,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 16:02:48,999 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [813177071] [2019-12-27 16:02:49,000 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:02:49,005 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:02:49,017 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 48 states and 61 transitions. [2019-12-27 16:02:49,017 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:02:49,018 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:02:49,018 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 16:02:49,018 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:02:49,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 16:02:49,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:02:49,019 INFO L87 Difference]: Start difference. First operand 19265 states and 57047 transitions. Second operand 6 states. [2019-12-27 16:02:49,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:02:49,711 INFO L93 Difference]: Finished difference Result 25686 states and 74651 transitions. [2019-12-27 16:02:49,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 16:02:49,712 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-12-27 16:02:49,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:02:49,745 INFO L225 Difference]: With dead ends: 25686 [2019-12-27 16:02:49,745 INFO L226 Difference]: Without dead ends: 25365 [2019-12-27 16:02:49,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-27 16:02:49,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25365 states. [2019-12-27 16:02:50,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25365 to 19973. [2019-12-27 16:02:50,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19973 states. [2019-12-27 16:02:50,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19973 states to 19973 states and 59056 transitions. [2019-12-27 16:02:50,062 INFO L78 Accepts]: Start accepts. Automaton has 19973 states and 59056 transitions. Word has length 33 [2019-12-27 16:02:50,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:02:50,062 INFO L462 AbstractCegarLoop]: Abstraction has 19973 states and 59056 transitions. [2019-12-27 16:02:50,062 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 16:02:50,062 INFO L276 IsEmpty]: Start isEmpty. Operand 19973 states and 59056 transitions. [2019-12-27 16:02:50,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-27 16:02:50,077 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:02:50,078 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] [2019-12-27 16:02:50,078 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:02:50,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:02:50,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1243510664, now seen corresponding path program 1 times [2019-12-27 16:02:50,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:02:50,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421633272] [2019-12-27 16:02:50,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:02:50,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:02:50,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:02:50,181 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421633272] [2019-12-27 16:02:50,181 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:02:50,181 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 16:02:50,181 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1584290754] [2019-12-27 16:02:50,182 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:02:50,188 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:02:50,203 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 63 transitions. [2019-12-27 16:02:50,204 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:02:50,204 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:02:50,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 16:02:50,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:02:50,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 16:02:50,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:02:50,205 INFO L87 Difference]: Start difference. First operand 19973 states and 59056 transitions. Second operand 6 states. [2019-12-27 16:02:50,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:02:50,853 INFO L93 Difference]: Finished difference Result 24467 states and 71282 transitions. [2019-12-27 16:02:50,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 16:02:50,853 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2019-12-27 16:02:50,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:02:50,884 INFO L225 Difference]: With dead ends: 24467 [2019-12-27 16:02:50,884 INFO L226 Difference]: Without dead ends: 24092 [2019-12-27 16:02:50,884 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-27 16:02:50,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24092 states. [2019-12-27 16:02:51,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24092 to 16867. [2019-12-27 16:02:51,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16867 states. [2019-12-27 16:02:51,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16867 states to 16867 states and 50179 transitions. [2019-12-27 16:02:51,173 INFO L78 Accepts]: Start accepts. Automaton has 16867 states and 50179 transitions. Word has length 35 [2019-12-27 16:02:51,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:02:51,173 INFO L462 AbstractCegarLoop]: Abstraction has 16867 states and 50179 transitions. [2019-12-27 16:02:51,173 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 16:02:51,174 INFO L276 IsEmpty]: Start isEmpty. Operand 16867 states and 50179 transitions. [2019-12-27 16:02:51,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 16:02:51,189 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:02:51,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] [2019-12-27 16:02:51,189 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:02:51,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:02:51,189 INFO L82 PathProgramCache]: Analyzing trace with hash 849737024, now seen corresponding path program 1 times [2019-12-27 16:02:51,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:02:51,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614442654] [2019-12-27 16:02:51,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:02:51,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:02:51,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:02:51,243 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614442654] [2019-12-27 16:02:51,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:02:51,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 16:02:51,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2004845779] [2019-12-27 16:02:51,243 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:02:51,251 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:02:51,306 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 151 states and 303 transitions. [2019-12-27 16:02:51,306 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:02:51,308 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:02:51,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:02:51,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:02:51,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:02:51,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:02:51,309 INFO L87 Difference]: Start difference. First operand 16867 states and 50179 transitions. Second operand 3 states. [2019-12-27 16:02:51,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:02:51,379 INFO L93 Difference]: Finished difference Result 16866 states and 50177 transitions. [2019-12-27 16:02:51,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:02:51,380 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 16:02:51,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:02:51,414 INFO L225 Difference]: With dead ends: 16866 [2019-12-27 16:02:51,414 INFO L226 Difference]: Without dead ends: 16866 [2019-12-27 16:02:51,415 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:02:51,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16866 states. [2019-12-27 16:02:51,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16866 to 16866. [2019-12-27 16:02:51,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16866 states. [2019-12-27 16:02:51,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16866 states to 16866 states and 50177 transitions. [2019-12-27 16:02:51,997 INFO L78 Accepts]: Start accepts. Automaton has 16866 states and 50177 transitions. Word has length 39 [2019-12-27 16:02:51,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:02:51,998 INFO L462 AbstractCegarLoop]: Abstraction has 16866 states and 50177 transitions. [2019-12-27 16:02:51,998 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:02:51,998 INFO L276 IsEmpty]: Start isEmpty. Operand 16866 states and 50177 transitions. [2019-12-27 16:02:52,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 16:02:52,016 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:02:52,016 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] [2019-12-27 16:02:52,016 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:02:52,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:02:52,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1856434077, now seen corresponding path program 1 times [2019-12-27 16:02:52,017 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:02:52,017 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700585575] [2019-12-27 16:02:52,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:02:52,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:02:52,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:02:52,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700585575] [2019-12-27 16:02:52,086 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:02:52,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 16:02:52,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [914311064] [2019-12-27 16:02:52,087 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:02:52,095 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:02:52,133 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 109 states and 188 transitions. [2019-12-27 16:02:52,134 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:02:52,177 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 16:02:52,177 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 16:02:52,177 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:02:52,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 16:02:52,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:02:52,178 INFO L87 Difference]: Start difference. First operand 16866 states and 50177 transitions. Second operand 6 states. [2019-12-27 16:02:52,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:02:52,922 INFO L93 Difference]: Finished difference Result 27746 states and 81281 transitions. [2019-12-27 16:02:52,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 16:02:52,923 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-27 16:02:52,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:02:52,958 INFO L225 Difference]: With dead ends: 27746 [2019-12-27 16:02:52,958 INFO L226 Difference]: Without dead ends: 27746 [2019-12-27 16:02:52,959 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 5 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 16:02:53,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27746 states. [2019-12-27 16:02:53,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27746 to 22005. [2019-12-27 16:02:53,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22005 states. [2019-12-27 16:02:53,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22005 states to 22005 states and 65365 transitions. [2019-12-27 16:02:53,301 INFO L78 Accepts]: Start accepts. Automaton has 22005 states and 65365 transitions. Word has length 40 [2019-12-27 16:02:53,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:02:53,302 INFO L462 AbstractCegarLoop]: Abstraction has 22005 states and 65365 transitions. [2019-12-27 16:02:53,302 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 16:02:53,302 INFO L276 IsEmpty]: Start isEmpty. Operand 22005 states and 65365 transitions. [2019-12-27 16:02:53,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 16:02:53,331 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:02:53,331 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] [2019-12-27 16:02:53,331 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:02:53,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:02:53,332 INFO L82 PathProgramCache]: Analyzing trace with hash 380188601, now seen corresponding path program 2 times [2019-12-27 16:02:53,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:02:53,332 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721087983] [2019-12-27 16:02:53,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:02:53,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:02:53,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:02:53,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721087983] [2019-12-27 16:02:53,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:02:53,416 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:02:53,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [687416478] [2019-12-27 16:02:53,416 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:02:53,425 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:02:53,490 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 193 states and 371 transitions. [2019-12-27 16:02:53,490 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:02:53,849 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 28 times. [2019-12-27 16:02:53,849 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 16:02:53,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:02:53,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 16:02:53,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2019-12-27 16:02:53,850 INFO L87 Difference]: Start difference. First operand 22005 states and 65365 transitions. Second operand 15 states. [2019-12-27 16:02:57,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:02:57,953 INFO L93 Difference]: Finished difference Result 55675 states and 163073 transitions. [2019-12-27 16:02:57,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 16:02:57,954 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 40 [2019-12-27 16:02:57,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:02:58,028 INFO L225 Difference]: With dead ends: 55675 [2019-12-27 16:02:58,028 INFO L226 Difference]: Without dead ends: 55675 [2019-12-27 16:02:58,028 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 25 SyntacticMatches, 6 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=164, Invalid=388, Unknown=0, NotChecked=0, Total=552 [2019-12-27 16:02:58,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55675 states. [2019-12-27 16:02:58,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55675 to 26571. [2019-12-27 16:02:58,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26571 states. [2019-12-27 16:02:58,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26571 states to 26571 states and 78477 transitions. [2019-12-27 16:02:58,604 INFO L78 Accepts]: Start accepts. Automaton has 26571 states and 78477 transitions. Word has length 40 [2019-12-27 16:02:58,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:02:58,604 INFO L462 AbstractCegarLoop]: Abstraction has 26571 states and 78477 transitions. [2019-12-27 16:02:58,604 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 16:02:58,604 INFO L276 IsEmpty]: Start isEmpty. Operand 26571 states and 78477 transitions. [2019-12-27 16:02:58,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 16:02:58,626 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:02:58,626 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] [2019-12-27 16:02:58,627 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:02:58,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:02:58,627 INFO L82 PathProgramCache]: Analyzing trace with hash -1689924949, now seen corresponding path program 3 times [2019-12-27 16:02:58,628 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:02:58,628 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011685432] [2019-12-27 16:02:58,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:02:58,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:02:58,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:02:58,686 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011685432] [2019-12-27 16:02:58,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:02:58,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:02:58,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1859871396] [2019-12-27 16:02:58,686 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:02:58,694 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:02:58,775 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 182 states and 345 transitions. [2019-12-27 16:02:58,776 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:02:58,777 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 16:02:58,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:02:58,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:02:58,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:02:58,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:02:58,778 INFO L87 Difference]: Start difference. First operand 26571 states and 78477 transitions. Second operand 3 states. [2019-12-27 16:02:58,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:02:58,868 INFO L93 Difference]: Finished difference Result 26483 states and 78207 transitions. [2019-12-27 16:02:58,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:02:58,869 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-27 16:02:58,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:02:58,903 INFO L225 Difference]: With dead ends: 26483 [2019-12-27 16:02:58,903 INFO L226 Difference]: Without dead ends: 26483 [2019-12-27 16:02:58,903 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:02:58,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26483 states. [2019-12-27 16:02:59,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26483 to 21195. [2019-12-27 16:02:59,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21195 states. [2019-12-27 16:02:59,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21195 states to 21195 states and 63250 transitions. [2019-12-27 16:02:59,252 INFO L78 Accepts]: Start accepts. Automaton has 21195 states and 63250 transitions. Word has length 40 [2019-12-27 16:02:59,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:02:59,252 INFO L462 AbstractCegarLoop]: Abstraction has 21195 states and 63250 transitions. [2019-12-27 16:02:59,252 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:02:59,252 INFO L276 IsEmpty]: Start isEmpty. Operand 21195 states and 63250 transitions. [2019-12-27 16:02:59,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 16:02:59,272 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:02:59,272 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] [2019-12-27 16:02:59,273 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:02:59,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:02:59,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1472692188, now seen corresponding path program 1 times [2019-12-27 16:02:59,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:02:59,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775035917] [2019-12-27 16:02:59,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:02:59,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:02:59,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:02:59,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775035917] [2019-12-27 16:02:59,324 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:02:59,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:02:59,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [74546032] [2019-12-27 16:02:59,324 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:02:59,333 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:02:59,377 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 108 states and 187 transitions. [2019-12-27 16:02:59,377 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:02:59,378 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:02:59,378 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:02:59,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:02:59,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:02:59,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:02:59,379 INFO L87 Difference]: Start difference. First operand 21195 states and 63250 transitions. Second operand 3 states. [2019-12-27 16:02:59,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:02:59,454 INFO L93 Difference]: Finished difference Result 19020 states and 55979 transitions. [2019-12-27 16:02:59,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:02:59,455 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-27 16:02:59,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:02:59,477 INFO L225 Difference]: With dead ends: 19020 [2019-12-27 16:02:59,477 INFO L226 Difference]: Without dead ends: 19020 [2019-12-27 16:02:59,478 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:02:59,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19020 states. [2019-12-27 16:02:59,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19020 to 18584. [2019-12-27 16:02:59,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18584 states. [2019-12-27 16:02:59,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18584 states to 18584 states and 54705 transitions. [2019-12-27 16:02:59,886 INFO L78 Accepts]: Start accepts. Automaton has 18584 states and 54705 transitions. Word has length 41 [2019-12-27 16:02:59,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:02:59,886 INFO L462 AbstractCegarLoop]: Abstraction has 18584 states and 54705 transitions. [2019-12-27 16:02:59,886 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:02:59,886 INFO L276 IsEmpty]: Start isEmpty. Operand 18584 states and 54705 transitions. [2019-12-27 16:02:59,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 16:02:59,903 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:02:59,903 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] [2019-12-27 16:02:59,903 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:02:59,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:02:59,903 INFO L82 PathProgramCache]: Analyzing trace with hash -1875088873, now seen corresponding path program 1 times [2019-12-27 16:02:59,904 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:02:59,904 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377433395] [2019-12-27 16:02:59,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:02:59,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:02:59,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:02:59,973 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377433395] [2019-12-27 16:02:59,973 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:02:59,973 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 16:02:59,973 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [762851717] [2019-12-27 16:02:59,973 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:02:59,982 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:03:00,028 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 113 states and 194 transitions. [2019-12-27 16:03:00,028 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:03:00,029 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 16:03:00,029 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 16:03:00,029 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:03:00,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 16:03:00,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:03:00,030 INFO L87 Difference]: Start difference. First operand 18584 states and 54705 transitions. Second operand 6 states. [2019-12-27 16:03:00,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:03:00,141 INFO L93 Difference]: Finished difference Result 17458 states and 52267 transitions. [2019-12-27 16:03:00,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 16:03:00,141 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2019-12-27 16:03:00,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:03:00,164 INFO L225 Difference]: With dead ends: 17458 [2019-12-27 16:03:00,165 INFO L226 Difference]: Without dead ends: 17333 [2019-12-27 16:03:00,165 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-27 16:03:00,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17333 states. [2019-12-27 16:03:00,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17333 to 17333. [2019-12-27 16:03:00,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17333 states. [2019-12-27 16:03:00,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17333 states to 17333 states and 52004 transitions. [2019-12-27 16:03:00,416 INFO L78 Accepts]: Start accepts. Automaton has 17333 states and 52004 transitions. Word has length 42 [2019-12-27 16:03:00,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:03:00,416 INFO L462 AbstractCegarLoop]: Abstraction has 17333 states and 52004 transitions. [2019-12-27 16:03:00,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 16:03:00,416 INFO L276 IsEmpty]: Start isEmpty. Operand 17333 states and 52004 transitions. [2019-12-27 16:03:00,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 16:03:00,432 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:03:00,432 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, 1, 1, 1, 1, 1, 1] [2019-12-27 16:03:00,432 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:03:00,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:03:00,433 INFO L82 PathProgramCache]: Analyzing trace with hash 208708978, now seen corresponding path program 1 times [2019-12-27 16:03:00,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:03:00,433 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264396702] [2019-12-27 16:03:00,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:03:00,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:03:00,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:03:00,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264396702] [2019-12-27 16:03:00,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:03:00,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:03:00,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [964451271] [2019-12-27 16:03:00,510 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:03:00,532 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:03:00,870 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 232 states and 430 transitions. [2019-12-27 16:03:00,871 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:03:00,872 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:03:00,872 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:03:00,873 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:03:00,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:03:00,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:03:00,873 INFO L87 Difference]: Start difference. First operand 17333 states and 52004 transitions. Second operand 3 states. [2019-12-27 16:03:01,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:03:01,027 INFO L93 Difference]: Finished difference Result 20131 states and 60171 transitions. [2019-12-27 16:03:01,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:03:01,028 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 16:03:01,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:03:01,068 INFO L225 Difference]: With dead ends: 20131 [2019-12-27 16:03:01,069 INFO L226 Difference]: Without dead ends: 20131 [2019-12-27 16:03:01,069 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:03:01,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20131 states. [2019-12-27 16:03:01,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20131 to 16015. [2019-12-27 16:03:01,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16015 states. [2019-12-27 16:03:01,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16015 states to 16015 states and 48057 transitions. [2019-12-27 16:03:01,408 INFO L78 Accepts]: Start accepts. Automaton has 16015 states and 48057 transitions. Word has length 66 [2019-12-27 16:03:01,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:03:01,409 INFO L462 AbstractCegarLoop]: Abstraction has 16015 states and 48057 transitions. [2019-12-27 16:03:01,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:03:01,409 INFO L276 IsEmpty]: Start isEmpty. Operand 16015 states and 48057 transitions. [2019-12-27 16:03:01,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 16:03:01,425 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:03:01,425 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:03:01,426 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:03:01,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:03:01,426 INFO L82 PathProgramCache]: Analyzing trace with hash 817808390, now seen corresponding path program 1 times [2019-12-27 16:03:01,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:03:01,427 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900630855] [2019-12-27 16:03:01,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:03:01,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 16:03:01,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 16:03:01,540 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 16:03:01,541 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 16:03:01,545 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [903] [903] ULTIMATE.startENTRY-->L827: Formula: (let ((.cse0 (store |v_#valid_73| 0 0))) (and (= 0 v_~z$flush_delayed~0_27) (= v_~z$r_buff1_thd1~0_114 0) (= v_~main$tmp_guard1~0_44 0) (= v_~z$read_delayed_var~0.offset_6 0) (= 0 v_~z$r_buff0_thd3~0_325) (= v_~z$mem_tmp~0_16 0) (= 0 v_~z$r_buff1_thd3~0_218) (= |v_#NULL.offset_3| 0) (= v_~z$read_delayed~0_8 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t409~0.base_44| 4)) (= 0 v_~weak$$choice0~0_15) (= v_~z$w_buff1~0_167 0) (= v_~z$r_buff0_thd0~0_136 0) (= v_~x~0_84 0) (= v_~z$r_buff0_thd1~0_185 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~z$read_delayed_var~0.base_6 0) (= 0 v_~__unbuffered_p2_EAX~0_46) (= 0 v_~weak$$choice2~0_93) (= 0 v_~__unbuffered_p1_EAX~0_60) (= v_~z$w_buff0~0_229 0) (= 0 v_~__unbuffered_p0_EAX~0_95) (= 0 v_~__unbuffered_cnt~0_63) (= v_~z$r_buff0_thd2~0_132 0) (= v_~z~0_167 0) (= |v_#valid_71| (store .cse0 |v_ULTIMATE.start_main_~#t409~0.base_44| 1)) (= v_~main$tmp_guard0~0_44 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t409~0.base_44| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t409~0.base_44|) |v_ULTIMATE.start_main_~#t409~0.offset_30| 0)) |v_#memory_int_21|) (= v_~y~0_39 0) (= v_~z$w_buff1_used~0_386 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t409~0.base_44|) (= (select .cse0 |v_ULTIMATE.start_main_~#t409~0.base_44|) 0) (= v_~__unbuffered_p2_EBX~0_54 0) (= v_~z$r_buff1_thd0~0_148 0) (= 0 |v_#NULL.base_3|) (= v_~z$w_buff0_used~0_680 0) (= v_~z$r_buff1_thd2~0_108 0) (= 0 |v_ULTIMATE.start_main_~#t409~0.offset_30|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_73|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t411~0.base=|v_ULTIMATE.start_main_~#t411~0.base_24|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_108, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_86|, #NULL.offset=|v_#NULL.offset_3|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_44|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_140|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_82|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_136, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_95, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_60, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_46, ~z$mem_tmp~0=v_~z$mem_tmp~0_16, ULTIMATE.start_main_~#t410~0.offset=|v_ULTIMATE.start_main_~#t410~0.offset_30|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_54, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_11|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_386, ~z$flush_delayed~0=v_~z$flush_delayed~0_27, ~weak$$choice0~0=v_~weak$$choice0~0_15, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_~#t410~0.base=|v_ULTIMATE.start_main_~#t410~0.base_44|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_114, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_325, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, ~x~0=v_~x~0_84, ULTIMATE.start_main_~#t409~0.base=|v_ULTIMATE.start_main_~#t409~0.base_44|, ~z$read_delayed~0=v_~z$read_delayed~0_8, ~z$w_buff1~0=v_~z$w_buff1~0_167, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_44, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_103|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_42|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_148, ULTIMATE.start_main_~#t409~0.offset=|v_ULTIMATE.start_main_~#t409~0.offset_30|, ULTIMATE.start_main_~#t411~0.offset=|v_ULTIMATE.start_main_~#t411~0.offset_19|, ~y~0=v_~y~0_39, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_132, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_27|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_680, ~z$w_buff0~0=v_~z$w_buff0~0_229, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_10|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_218, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_44, #NULL.base=|v_#NULL.base_3|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_27|, #valid=|v_#valid_71|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_167, ~weak$$choice2~0=v_~weak$$choice2~0_93, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_185} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t411~0.base, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_~#t410~0.offset, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_~#t410~0.base, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t409~0.base, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t409~0.offset, ULTIMATE.start_main_~#t411~0.offset, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 16:03:01,547 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [881] [881] L4-->L748: Formula: (and (= 1 ~z$r_buff0_thd1~0_Out1835512072) (= ~z$r_buff1_thd2~0_Out1835512072 ~z$r_buff0_thd2~0_In1835512072) (= ~x~0_In1835512072 ~__unbuffered_p0_EAX~0_Out1835512072) (= ~z$r_buff1_thd3~0_Out1835512072 ~z$r_buff0_thd3~0_In1835512072) (= ~z$r_buff0_thd1~0_In1835512072 ~z$r_buff1_thd1~0_Out1835512072) (not (= P0Thread1of1ForFork1___VERIFIER_assert_~expression_In1835512072 0)) (= ~z$r_buff0_thd0~0_In1835512072 ~z$r_buff1_thd0~0_Out1835512072)) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1835512072, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1835512072, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In1835512072, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1835512072, ~x~0=~x~0_In1835512072, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1835512072} OutVars{~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out1835512072, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1835512072, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out1835512072, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out1835512072, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out1835512072, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out1835512072, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1835512072, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In1835512072, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out1835512072, ~x~0=~x~0_In1835512072, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1835512072} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 16:03:01,547 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L827-1-->L829: Formula: (and (= (select |v_#valid_37| |v_ULTIMATE.start_main_~#t410~0.base_13|) 0) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t410~0.base_13| 1)) (not (= |v_ULTIMATE.start_main_~#t410~0.base_13| 0)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t410~0.base_13| 4)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t410~0.base_13|) (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t410~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t410~0.base_13|) |v_ULTIMATE.start_main_~#t410~0.offset_11| 1))) (= |v_ULTIMATE.start_main_~#t410~0.offset_11| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t410~0.offset=|v_ULTIMATE.start_main_~#t410~0.offset_11|, ULTIMATE.start_main_~#t410~0.base=|v_ULTIMATE.start_main_~#t410~0.base_13|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t410~0.offset, ULTIMATE.start_main_~#t410~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 16:03:01,550 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L768-2-->L768-5: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In1602146246 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In1602146246 256))) (.cse1 (= |P1Thread1of1ForFork2_#t~ite10_Out1602146246| |P1Thread1of1ForFork2_#t~ite9_Out1602146246|))) (or (and (not .cse0) .cse1 (= ~z$w_buff1~0_In1602146246 |P1Thread1of1ForFork2_#t~ite9_Out1602146246|) (not .cse2)) (and (or .cse2 .cse0) .cse1 (= ~z~0_In1602146246 |P1Thread1of1ForFork2_#t~ite9_Out1602146246|)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1602146246, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1602146246, ~z$w_buff1~0=~z$w_buff1~0_In1602146246, ~z~0=~z~0_In1602146246} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out1602146246|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1602146246, P1Thread1of1ForFork2_#t~ite10=|P1Thread1of1ForFork2_#t~ite10_Out1602146246|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1602146246, ~z$w_buff1~0=~z$w_buff1~0_In1602146246, ~z~0=~z~0_In1602146246} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-27 16:03:01,551 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L769-->L769-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In736534969 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In736534969 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite11_Out736534969| ~z$w_buff0_used~0_In736534969)) (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite11_Out736534969| 0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In736534969, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In736534969} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In736534969, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out736534969|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In736534969} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 16:03:01,552 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L770-->L770-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff0_used~0_In443878647 256))) (.cse2 (= (mod ~z$r_buff0_thd2~0_In443878647 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In443878647 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In443878647 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite12_Out443878647| 0)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |P1Thread1of1ForFork2_#t~ite12_Out443878647| ~z$w_buff1_used~0_In443878647)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In443878647, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In443878647, ~z$w_buff1_used~0=~z$w_buff1_used~0_In443878647, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In443878647} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In443878647, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In443878647, ~z$w_buff1_used~0=~z$w_buff1_used~0_In443878647, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out443878647|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In443878647} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-27 16:03:01,552 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [860] [860] L829-1-->L831: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t411~0.base_10|)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t411~0.base_10|) (= |v_#valid_32| (store |v_#valid_33| |v_ULTIMATE.start_main_~#t411~0.base_10| 1)) (= (select |v_#valid_33| |v_ULTIMATE.start_main_~#t411~0.base_10|) 0) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t411~0.base_10| 4) |v_#length_13|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t411~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t411~0.base_10|) |v_ULTIMATE.start_main_~#t411~0.offset_9| 2)) |v_#memory_int_11|) (= |v_ULTIMATE.start_main_~#t411~0.offset_9| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t411~0.base=|v_ULTIMATE.start_main_~#t411~0.base_10|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t411~0.offset=|v_ULTIMATE.start_main_~#t411~0.offset_9|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t411~0.base, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t411~0.offset, #length] because there is no mapped edge [2019-12-27 16:03:01,556 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L793-->L793-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In602115030 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite21_Out602115030| ~z$w_buff0~0_In602115030) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite20_In602115030| |P2Thread1of1ForFork0_#t~ite20_Out602115030|)) (and .cse0 (= |P2Thread1of1ForFork0_#t~ite20_Out602115030| ~z$w_buff0~0_In602115030) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In602115030 256)))) (or (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In602115030 256))) (= (mod ~z$w_buff0_used~0_In602115030 256) 0) (and .cse1 (= 0 (mod ~z$r_buff1_thd3~0_In602115030 256))))) (= |P2Thread1of1ForFork0_#t~ite21_Out602115030| |P2Thread1of1ForFork0_#t~ite20_Out602115030|)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In602115030, ~z$w_buff0_used~0=~z$w_buff0_used~0_In602115030, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In602115030, ~z$w_buff1_used~0=~z$w_buff1_used~0_In602115030, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In602115030, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In602115030|, ~weak$$choice2~0=~weak$$choice2~0_In602115030} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out602115030|, ~z$w_buff0~0=~z$w_buff0~0_In602115030, ~z$w_buff0_used~0=~z$w_buff0_used~0_In602115030, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In602115030, ~z$w_buff1_used~0=~z$w_buff1_used~0_In602115030, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In602115030, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out602115030|, ~weak$$choice2~0=~weak$$choice2~0_In602115030} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-27 16:03:01,557 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L794-->L794-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1416241349 256)))) (or (and (= ~z$w_buff1~0_In1416241349 |P2Thread1of1ForFork0_#t~ite23_Out1416241349|) .cse0 (= |P2Thread1of1ForFork0_#t~ite23_Out1416241349| |P2Thread1of1ForFork0_#t~ite24_Out1416241349|) (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In1416241349 256) 0))) (or (and .cse1 (= (mod ~z$r_buff1_thd3~0_In1416241349 256) 0)) (= (mod ~z$w_buff0_used~0_In1416241349 256) 0) (and .cse1 (= (mod ~z$w_buff1_used~0_In1416241349 256) 0))))) (and (not .cse0) (= ~z$w_buff1~0_In1416241349 |P2Thread1of1ForFork0_#t~ite24_Out1416241349|) (= |P2Thread1of1ForFork0_#t~ite23_In1416241349| |P2Thread1of1ForFork0_#t~ite23_Out1416241349|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1416241349, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1416241349, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_In1416241349|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1416241349, ~z$w_buff1~0=~z$w_buff1~0_In1416241349, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1416241349, ~weak$$choice2~0=~weak$$choice2~0_In1416241349} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1416241349, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_Out1416241349|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1416241349, P2Thread1of1ForFork0_#t~ite24=|P2Thread1of1ForFork0_#t~ite24_Out1416241349|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1416241349, ~z$w_buff1~0=~z$w_buff1~0_In1416241349, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1416241349, ~weak$$choice2~0=~weak$$choice2~0_In1416241349} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24] because there is no mapped edge [2019-12-27 16:03:01,563 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L797-->L798: Formula: (and (not (= (mod v_~weak$$choice2~0_37 256) 0)) (= v_~z$r_buff0_thd3~0_160 v_~z$r_buff0_thd3~0_161)) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_161, ~weak$$choice2~0=v_~weak$$choice2~0_37} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_8|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_160, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_12|, ~weak$$choice2~0=v_~weak$$choice2~0_37} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 16:03:01,565 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L800-->L804: Formula: (and (= v_~z~0_54 v_~z$mem_tmp~0_7) (not (= 0 (mod v_~z$flush_delayed~0_10 256))) (= 0 v_~z$flush_delayed~0_9)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_10} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~z$mem_tmp~0=v_~z$mem_tmp~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_9, ~z~0=v_~z~0_54} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-27 16:03:01,566 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L804-2-->L804-4: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd3~0_In-88199484 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In-88199484 256) 0))) (or (and (or .cse0 .cse1) (= ~z~0_In-88199484 |P2Thread1of1ForFork0_#t~ite38_Out-88199484|)) (and (not .cse1) (= ~z$w_buff1~0_In-88199484 |P2Thread1of1ForFork0_#t~ite38_Out-88199484|) (not .cse0)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-88199484, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-88199484, ~z$w_buff1~0=~z$w_buff1~0_In-88199484, ~z~0=~z~0_In-88199484} OutVars{P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out-88199484|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-88199484, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-88199484, ~z$w_buff1~0=~z$w_buff1~0_In-88199484, ~z~0=~z~0_In-88199484} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 16:03:01,566 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L804-4-->L805: Formula: (= v_~z~0_30 |v_P2Thread1of1ForFork0_#t~ite38_10|) InVars {P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_10|} OutVars{P2Thread1of1ForFork0_#t~ite39=|v_P2Thread1of1ForFork0_#t~ite39_13|, P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_9|, ~z~0=v_~z~0_30} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38, ~z~0] because there is no mapped edge [2019-12-27 16:03:01,566 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] L805-->L805-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-491581007 256))) (.cse0 (= (mod ~z$r_buff0_thd3~0_In-491581007 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite40_Out-491581007| 0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$w_buff0_used~0_In-491581007 |P2Thread1of1ForFork0_#t~ite40_Out-491581007|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-491581007, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-491581007} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-491581007, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out-491581007|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-491581007} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-27 16:03:01,568 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L771-->L771-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-2044505109 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-2044505109 256) 0))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork2_#t~ite13_Out-2044505109|) (not .cse1)) (and (= ~z$r_buff0_thd2~0_In-2044505109 |P1Thread1of1ForFork2_#t~ite13_Out-2044505109|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2044505109, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-2044505109} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2044505109, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-2044505109|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-2044505109} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-27 16:03:01,571 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L749-->L749-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd1~0_In2120318635 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In2120318635 256) 0))) (or (and (= ~z$w_buff0_used~0_In2120318635 |P0Thread1of1ForFork1_#t~ite5_Out2120318635|) (or .cse0 .cse1)) (and (= |P0Thread1of1ForFork1_#t~ite5_Out2120318635| 0) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2120318635, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In2120318635} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out2120318635|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2120318635, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In2120318635} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-27 16:03:01,572 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L750-->L750-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd1~0_In-1002797458 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In-1002797458 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd1~0_In-1002797458 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1002797458 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork1_#t~ite6_Out-1002797458|)) (and (= |P0Thread1of1ForFork1_#t~ite6_Out-1002797458| ~z$w_buff1_used~0_In-1002797458) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1002797458, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1002797458, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1002797458, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1002797458} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1002797458, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-1002797458|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1002797458, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1002797458, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1002797458} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 16:03:01,573 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L751-->L752: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1749079058 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In1749079058 256)))) (or (and (not .cse0) (not .cse1) (= ~z$r_buff0_thd1~0_Out1749079058 0)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd1~0_Out1749079058 ~z$r_buff0_thd1~0_In1749079058)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1749079058, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1749079058} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1749079058, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out1749079058|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out1749079058} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 16:03:01,573 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L752-->L752-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In463533007 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd1~0_In463533007 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In463533007 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd1~0_In463533007 256) 0))) (or (and (= |P0Thread1of1ForFork1_#t~ite8_Out463533007| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= |P0Thread1of1ForFork1_#t~ite8_Out463533007| ~z$r_buff1_thd1~0_In463533007) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In463533007, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In463533007, ~z$w_buff1_used~0=~z$w_buff1_used~0_In463533007, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In463533007} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out463533007|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In463533007, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In463533007, ~z$w_buff1_used~0=~z$w_buff1_used~0_In463533007, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In463533007} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 16:03:01,574 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L752-2-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_46 1) v_~__unbuffered_cnt~0_45) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~z$r_buff1_thd1~0_77 |v_P0Thread1of1ForFork1_#t~ite8_24|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_24|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_46} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_23|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_77, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 16:03:01,575 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L806-->L806-2: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd3~0_In-1874283540 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In-1874283540 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1874283540 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd3~0_In-1874283540 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite41_Out-1874283540| ~z$w_buff1_used~0_In-1874283540) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork0_#t~ite41_Out-1874283540|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1874283540, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1874283540, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1874283540, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1874283540} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1874283540, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1874283540, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1874283540, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1874283540, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-1874283540|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-27 16:03:01,576 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L807-->L807-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In2093877464 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In2093877464 256)))) (or (and (= ~z$r_buff0_thd3~0_In2093877464 |P2Thread1of1ForFork0_#t~ite42_Out2093877464|) (or .cse0 .cse1)) (and (= 0 |P2Thread1of1ForFork0_#t~ite42_Out2093877464|) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2093877464, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2093877464} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2093877464, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2093877464, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out2093877464|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 16:03:01,577 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L808-->L808-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In1451567527 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In1451567527 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In1451567527 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In1451567527 256)))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite43_Out1451567527|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$r_buff1_thd3~0_In1451567527 |P2Thread1of1ForFork0_#t~ite43_Out1451567527|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1451567527, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1451567527, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1451567527, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1451567527} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out1451567527|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1451567527, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1451567527, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1451567527, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1451567527} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-27 16:03:01,577 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L808-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_39 1) v_~__unbuffered_cnt~0_38) (= v_~z$r_buff1_thd3~0_131 |v_P2Thread1of1ForFork0_#t~ite43_26|) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_25|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_131, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 16:03:01,578 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L772-->L772-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In952974901 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In952974901 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In952974901 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd2~0_In952974901 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite14_Out952974901| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~z$r_buff1_thd2~0_In952974901 |P1Thread1of1ForFork2_#t~ite14_Out952974901|) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In952974901, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In952974901, ~z$w_buff1_used~0=~z$w_buff1_used~0_In952974901, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In952974901} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In952974901, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In952974901, ~z$w_buff1_used~0=~z$w_buff1_used~0_In952974901, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out952974901|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In952974901} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 16:03:01,578 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [867] [867] L772-2-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_32 (+ v_~__unbuffered_cnt~0_33 1)) (= |v_P1Thread1of1ForFork2_#t~ite14_26| v_~z$r_buff1_thd2~0_56) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_26|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_56, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_25|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 16:03:01,579 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] L835-->L837-2: Formula: (and (or (= 0 (mod v_~z$r_buff0_thd0~0_51 256)) (= 0 (mod v_~z$w_buff0_used~0_293 256))) (not (= (mod v_~main$tmp_guard0~0_8 256) 0))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_51, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_293, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_51, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_293, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 16:03:01,579 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L837-2-->L837-4: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd0~0_In-2007070453 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In-2007070453 256) 0))) (or (and (not .cse0) (= ~z$w_buff1~0_In-2007070453 |ULTIMATE.start_main_#t~ite47_Out-2007070453|) (not .cse1)) (and (= ~z~0_In-2007070453 |ULTIMATE.start_main_#t~ite47_Out-2007070453|) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2007070453, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2007070453, ~z$w_buff1~0=~z$w_buff1~0_In-2007070453, ~z~0=~z~0_In-2007070453} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2007070453, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-2007070453|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2007070453, ~z$w_buff1~0=~z$w_buff1~0_In-2007070453, ~z~0=~z~0_In-2007070453} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-27 16:03:01,579 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L837-4-->L838: Formula: (= v_~z~0_20 |v_ULTIMATE.start_main_#t~ite47_11|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_11|} OutVars{ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_10|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_14|, ~z~0=v_~z~0_20} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48, ~z~0] because there is no mapped edge [2019-12-27 16:03:01,580 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L838-->L838-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1364343136 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1364343136 256)))) (or (and (= |ULTIMATE.start_main_#t~ite49_Out-1364343136| ~z$w_buff0_used~0_In-1364343136) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite49_Out-1364343136| 0) (not .cse0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1364343136, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1364343136} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1364343136, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1364343136, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-1364343136|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 16:03:01,581 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L839-->L839-2: Formula: (let ((.cse2 (= (mod ~z$r_buff0_thd0~0_In707898043 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In707898043 256))) (.cse1 (= (mod ~z$r_buff1_thd0~0_In707898043 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In707898043 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite50_Out707898043| 0)) (and (= |ULTIMATE.start_main_#t~ite50_Out707898043| ~z$w_buff1_used~0_In707898043) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In707898043, ~z$w_buff0_used~0=~z$w_buff0_used~0_In707898043, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In707898043, ~z$w_buff1_used~0=~z$w_buff1_used~0_In707898043} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out707898043|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In707898043, ~z$w_buff0_used~0=~z$w_buff0_used~0_In707898043, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In707898043, ~z$w_buff1_used~0=~z$w_buff1_used~0_In707898043} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 16:03:01,582 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L840-->L840-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1426899968 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1426899968 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In1426899968 |ULTIMATE.start_main_#t~ite51_Out1426899968|)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite51_Out1426899968|) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1426899968, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1426899968} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1426899968, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out1426899968|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1426899968} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 16:03:01,583 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L841-->L841-2: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In-1537533854 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-1537533854 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In-1537533854 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-1537533854 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite52_Out-1537533854|)) (and (= ~z$r_buff1_thd0~0_In-1537533854 |ULTIMATE.start_main_#t~ite52_Out-1537533854|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1537533854, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1537533854, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1537533854, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1537533854} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-1537533854|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1537533854, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1537533854, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1537533854, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1537533854} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 16:03:01,584 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [896] [896] L841-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 0 v_~__unbuffered_p0_EAX~0_72) (= v_~z$r_buff1_thd0~0_123 |v_ULTIMATE.start_main_#t~ite52_43|) (= v_~__unbuffered_p2_EBX~0_32 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= 0 v_~__unbuffered_p1_EAX~0_34) (= v_~main$tmp_guard1~0_23 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 0) (= 1 v_~__unbuffered_p2_EAX~0_25)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_72, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_43|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_32, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_34, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_25} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_72, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_42|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_19, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_32, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_34, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_123, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_25, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 16:03:01,695 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 04:03:01 BasicIcfg [2019-12-27 16:03:01,695 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 16:03:01,697 INFO L168 Benchmark]: Toolchain (without parser) took 83529.44 ms. Allocated memory was 145.8 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 101.5 MB in the beginning and 1.0 GB in the end (delta: -902.0 MB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2019-12-27 16:03:01,698 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-27 16:03:01,698 INFO L168 Benchmark]: CACSL2BoogieTranslator took 823.83 ms. Allocated memory was 145.8 MB in the beginning and 202.4 MB in the end (delta: 56.6 MB). Free memory was 101.3 MB in the beginning and 155.7 MB in the end (delta: -54.4 MB). Peak memory consumption was 22.1 MB. Max. memory is 7.1 GB. [2019-12-27 16:03:01,699 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.41 ms. Allocated memory is still 202.4 MB. Free memory was 155.7 MB in the beginning and 153.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 16:03:01,699 INFO L168 Benchmark]: Boogie Preprocessor took 40.08 ms. Allocated memory is still 202.4 MB. Free memory was 153.0 MB in the beginning and 150.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 16:03:01,699 INFO L168 Benchmark]: RCFGBuilder took 905.35 ms. Allocated memory is still 202.4 MB. Free memory was 150.4 MB in the beginning and 100.0 MB in the end (delta: 50.4 MB). Peak memory consumption was 50.4 MB. Max. memory is 7.1 GB. [2019-12-27 16:03:01,704 INFO L168 Benchmark]: TraceAbstraction took 81689.28 ms. Allocated memory was 202.4 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 100.0 MB in the beginning and 1.0 GB in the end (delta: -903.6 MB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2019-12-27 16:03:01,709 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.20 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 823.83 ms. Allocated memory was 145.8 MB in the beginning and 202.4 MB in the end (delta: 56.6 MB). Free memory was 101.3 MB in the beginning and 155.7 MB in the end (delta: -54.4 MB). Peak memory consumption was 22.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 65.41 ms. Allocated memory is still 202.4 MB. Free memory was 155.7 MB in the beginning and 153.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.08 ms. Allocated memory is still 202.4 MB. Free memory was 153.0 MB in the beginning and 150.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 905.35 ms. Allocated memory is still 202.4 MB. Free memory was 150.4 MB in the beginning and 100.0 MB in the end (delta: 50.4 MB). Peak memory consumption was 50.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 81689.28 ms. Allocated memory was 202.4 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 100.0 MB in the beginning and 1.0 GB in the end (delta: -903.6 MB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.8s, 177 ProgramPointsBefore, 92 ProgramPointsAfterwards, 214 TransitionsBefore, 101 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 8 FixpointIterations, 34 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 32 ChoiceCompositions, 7082 VarBasedMoverChecksPositive, 219 VarBasedMoverChecksNegative, 19 SemBasedMoverChecksPositive, 262 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.6s, 0 MoverChecksTotal, 89688 CheckedPairsTotal, 119 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L827] FCALL, FORK 0 pthread_create(&t409, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L733] 1 z$w_buff1 = z$w_buff0 [L734] 1 z$w_buff0 = 1 [L735] 1 z$w_buff1_used = z$w_buff0_used [L736] 1 z$w_buff0_used = (_Bool)1 [L829] FCALL, FORK 0 pthread_create(&t410, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0: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=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L762] 2 x = 1 [L765] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L769] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L831] FCALL, FORK 0 pthread_create(&t411, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L782] 3 y = 1 [L785] 3 __unbuffered_p2_EAX = y [L788] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L789] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L790] 3 z$flush_delayed = weak$$choice2 [L791] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L792] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L792] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L793] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L794] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L795] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L795] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L796] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L796] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L798] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L798] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L799] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L804] 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 [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L771] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L748] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L748] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L749] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L750] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L805] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L806] 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 [L807] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L833] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L838] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L839] 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 [L840] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 168 locations, 2 error locations. Result: UNSAFE, OverallTime: 81.3s, OverallIterations: 23, TraceHistogramMax: 1, AutomataDifference: 26.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3782 SDtfs, 4822 SDslu, 8587 SDs, 0 SdLazy, 6276 SolverSat, 240 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 196 GetRequests, 65 SyntacticMatches, 20 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=143879occurred 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: 28.7s AutomataMinimizationTime, 22 MinimizatonAttempts, 144284 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 709 NumberOfCodeBlocks, 709 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 620 ConstructedInterpolants, 0 QuantifiedInterpolants, 76078 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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...