/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix042_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 06:29:56,804 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 06:29:56,807 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 06:29:56,826 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 06:29:56,826 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 06:29:56,828 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 06:29:56,830 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 06:29:56,843 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 06:29:56,844 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 06:29:56,847 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 06:29:56,849 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 06:29:56,850 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 06:29:56,850 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 06:29:56,852 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 06:29:56,855 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 06:29:56,856 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 06:29:56,858 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 06:29:56,860 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 06:29:56,862 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 06:29:56,864 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 06:29:56,865 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 06:29:56,866 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 06:29:56,867 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 06:29:56,868 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 06:29:56,870 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 06:29:56,870 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 06:29:56,870 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 06:29:56,871 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 06:29:56,871 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 06:29:56,872 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 06:29:56,872 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 06:29:56,873 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 06:29:56,874 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 06:29:56,875 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 06:29:56,875 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 06:29:56,876 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 06:29:56,876 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 06:29:56,876 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 06:29:56,877 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 06:29:56,877 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 06:29:56,878 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 06:29:56,879 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-27 06:29:56,893 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 06:29:56,893 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 06:29:56,894 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 06:29:56,894 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 06:29:56,894 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 06:29:56,895 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 06:29:56,895 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 06:29:56,895 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 06:29:56,895 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 06:29:56,895 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 06:29:56,896 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 06:29:56,896 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 06:29:56,896 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 06:29:56,896 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 06:29:56,896 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 06:29:56,897 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 06:29:56,897 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 06:29:56,897 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 06:29:56,897 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 06:29:56,897 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 06:29:56,898 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 06:29:56,898 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 06:29:56,898 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 06:29:56,898 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 06:29:56,898 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 06:29:56,899 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 06:29:56,899 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 06:29:56,899 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 06:29:56,899 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 06:29:56,899 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 06:29:57,178 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 06:29:57,191 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 06:29:57,194 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 06:29:57,195 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 06:29:57,196 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 06:29:57,197 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix042_tso.oepc.i [2019-12-27 06:29:57,270 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6c7f6788/3dcebcab5268454dadd032d671302a8a/FLAG077412d23 [2019-12-27 06:29:57,878 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 06:29:57,879 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix042_tso.oepc.i [2019-12-27 06:29:57,904 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6c7f6788/3dcebcab5268454dadd032d671302a8a/FLAG077412d23 [2019-12-27 06:29:58,124 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6c7f6788/3dcebcab5268454dadd032d671302a8a [2019-12-27 06:29:58,132 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 06:29:58,134 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 06:29:58,135 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 06:29:58,135 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 06:29:58,139 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 06:29:58,140 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:29:58" (1/1) ... [2019-12-27 06:29:58,143 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f106464 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:29:58, skipping insertion in model container [2019-12-27 06:29:58,143 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:29:58" (1/1) ... [2019-12-27 06:29:58,151 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 06:29:58,209 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 06:29:58,739 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:29:58,752 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 06:29:58,847 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:29:58,932 INFO L208 MainTranslator]: Completed translation [2019-12-27 06:29:58,932 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:29:58 WrapperNode [2019-12-27 06:29:58,933 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 06:29:58,933 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 06:29:58,933 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 06:29:58,934 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 06:29:58,940 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:29:58" (1/1) ... [2019-12-27 06:29:58,961 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:29:58" (1/1) ... [2019-12-27 06:29:58,989 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 06:29:58,990 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 06:29:58,990 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 06:29:58,990 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 06:29:58,999 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:29:58" (1/1) ... [2019-12-27 06:29:58,999 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:29:58" (1/1) ... [2019-12-27 06:29:59,004 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:29:58" (1/1) ... [2019-12-27 06:29:59,005 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:29:58" (1/1) ... [2019-12-27 06:29:59,015 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:29:58" (1/1) ... [2019-12-27 06:29:59,020 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:29:58" (1/1) ... [2019-12-27 06:29:59,023 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:29:58" (1/1) ... [2019-12-27 06:29:59,029 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 06:29:59,029 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 06:29:59,030 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 06:29:59,030 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 06:29:59,031 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:29:58" (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 06:29:59,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 06:29:59,100 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 06:29:59,101 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 06:29:59,101 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 06:29:59,101 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 06:29:59,101 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 06:29:59,101 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 06:29:59,102 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 06:29:59,102 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 06:29:59,102 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 06:29:59,102 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 06:29:59,103 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 06:29:59,103 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 06:29:59,105 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 06:29:59,839 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 06:29:59,839 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 06:29:59,841 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:29:59 BoogieIcfgContainer [2019-12-27 06:29:59,841 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 06:29:59,842 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 06:29:59,842 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 06:29:59,846 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 06:29:59,846 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 06:29:58" (1/3) ... [2019-12-27 06:29:59,847 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32858947 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:29:59, skipping insertion in model container [2019-12-27 06:29:59,847 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:29:58" (2/3) ... [2019-12-27 06:29:59,848 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32858947 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:29:59, skipping insertion in model container [2019-12-27 06:29:59,848 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:29:59" (3/3) ... [2019-12-27 06:29:59,850 INFO L109 eAbstractionObserver]: Analyzing ICFG mix042_tso.oepc.i [2019-12-27 06:29:59,861 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 06:29:59,862 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 06:29:59,870 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 06:29:59,871 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 06:29:59,916 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,916 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,917 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,918 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,918 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,918 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,919 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,919 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,920 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,920 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,920 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,920 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,921 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,921 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,921 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,922 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,922 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,922 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,922 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,923 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,923 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,923 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,924 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,924 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,924 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,925 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,925 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,925 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,925 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,925 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,928 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,928 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,928 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,929 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,931 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,932 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,962 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,962 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,963 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,963 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,963 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,963 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,964 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,964 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,965 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,965 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,965 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,965 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,965 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,966 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,966 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,966 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,967 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,967 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,967 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,967 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,968 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,969 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,969 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,969 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,969 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,970 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,970 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,970 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,970 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,970 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,970 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,971 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,971 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,971 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,971 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,972 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,972 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,973 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,976 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,977 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,977 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,978 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,981 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,981 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,993 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,993 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,993 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,993 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,993 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,994 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,994 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,994 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,994 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,994 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,995 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,995 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,995 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,995 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:59,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:00,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:00,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:00,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:00,001 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:00,001 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:00,001 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:00,001 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:00,001 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:00,002 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:00,002 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:00,002 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:00,002 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:00,002 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:00,003 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:00,003 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:00,003 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:00,003 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:00,003 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:00,003 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:00,004 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:00,004 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:00,004 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:00,004 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:00,004 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:00,005 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:00,005 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:00,005 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:00,005 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:00,005 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:00,005 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:00,006 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:00,006 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:00,006 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:00,010 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:00,010 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:00,010 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:00,011 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:00,011 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:00,011 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:00,011 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:00,011 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:00,012 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:00,012 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:00,012 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:00,012 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:00,014 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:00,014 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:00,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:00,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:00,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:00,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:00,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:00,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:00,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:00,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:00,033 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 06:30:00,055 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 06:30:00,055 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 06:30:00,055 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 06:30:00,055 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 06:30:00,055 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 06:30:00,055 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 06:30:00,055 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 06:30:00,056 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 06:30:00,072 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 177 places, 214 transitions [2019-12-27 06:30:00,074 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-27 06:30:00,181 INFO L132 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-27 06:30:00,181 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:30:00,200 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 435 event pairs. 0/162 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 06:30:00,228 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-27 06:30:00,285 INFO L132 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-27 06:30:00,286 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:30:00,295 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 435 event pairs. 0/162 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 06:30:00,321 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 06:30:00,322 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 06:30:03,027 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 31 [2019-12-27 06:30:03,980 WARN L192 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-27 06:30:04,137 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-27 06:30:04,161 INFO L206 etLargeBlockEncoding]: Checked pairs total: 80962 [2019-12-27 06:30:04,161 INFO L214 etLargeBlockEncoding]: Total number of compositions: 114 [2019-12-27 06:30:04,165 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 93 places, 102 transitions [2019-12-27 06:30:19,944 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 104862 states. [2019-12-27 06:30:19,946 INFO L276 IsEmpty]: Start isEmpty. Operand 104862 states. [2019-12-27 06:30:19,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 06:30:19,952 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:30:19,953 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 06:30:19,954 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 06:30:19,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:30:19,960 INFO L82 PathProgramCache]: Analyzing trace with hash 916881, now seen corresponding path program 1 times [2019-12-27 06:30:19,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:30:19,970 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86012090] [2019-12-27 06:30:19,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:30:20,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:30:20,181 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 06:30:20,183 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86012090] [2019-12-27 06:30:20,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:30:20,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 06:30:20,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145796111] [2019-12-27 06:30:20,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:30:20,193 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:30:20,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:30:20,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:30:20,211 INFO L87 Difference]: Start difference. First operand 104862 states. Second operand 3 states. [2019-12-27 06:30:21,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:30:21,471 INFO L93 Difference]: Finished difference Result 104092 states and 443334 transitions. [2019-12-27 06:30:21,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:30:21,473 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 06:30:21,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:30:21,974 INFO L225 Difference]: With dead ends: 104092 [2019-12-27 06:30:21,974 INFO L226 Difference]: Without dead ends: 97696 [2019-12-27 06:30:21,976 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 06:30:28,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97696 states. [2019-12-27 06:30:30,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97696 to 97696. [2019-12-27 06:30:30,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97696 states. [2019-12-27 06:30:31,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97696 states to 97696 states and 415501 transitions. [2019-12-27 06:30:31,537 INFO L78 Accepts]: Start accepts. Automaton has 97696 states and 415501 transitions. Word has length 3 [2019-12-27 06:30:31,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:30:31,538 INFO L462 AbstractCegarLoop]: Abstraction has 97696 states and 415501 transitions. [2019-12-27 06:30:31,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:30:31,538 INFO L276 IsEmpty]: Start isEmpty. Operand 97696 states and 415501 transitions. [2019-12-27 06:30:31,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 06:30:31,551 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:30:31,551 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:30:31,552 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 06:30:31,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:30:31,552 INFO L82 PathProgramCache]: Analyzing trace with hash -1566799458, now seen corresponding path program 1 times [2019-12-27 06:30:31,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:30:31,553 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777565541] [2019-12-27 06:30:31,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:30:31,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:30:31,673 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 06:30:31,674 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777565541] [2019-12-27 06:30:31,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:30:31,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:30:31,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880472591] [2019-12-27 06:30:31,677 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:30:31,677 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:30:31,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:30:31,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:30:31,678 INFO L87 Difference]: Start difference. First operand 97696 states and 415501 transitions. Second operand 4 states. [2019-12-27 06:30:36,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:30:36,523 INFO L93 Difference]: Finished difference Result 155904 states and 634680 transitions. [2019-12-27 06:30:36,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:30:36,524 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 06:30:36,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:30:37,085 INFO L225 Difference]: With dead ends: 155904 [2019-12-27 06:30:37,085 INFO L226 Difference]: Without dead ends: 155855 [2019-12-27 06:30:37,086 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 06:30:41,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155855 states. [2019-12-27 06:30:48,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155855 to 141665. [2019-12-27 06:30:48,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141665 states. [2019-12-27 06:30:49,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141665 states to 141665 states and 584468 transitions. [2019-12-27 06:30:49,141 INFO L78 Accepts]: Start accepts. Automaton has 141665 states and 584468 transitions. Word has length 11 [2019-12-27 06:30:49,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:30:49,141 INFO L462 AbstractCegarLoop]: Abstraction has 141665 states and 584468 transitions. [2019-12-27 06:30:49,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:30:49,141 INFO L276 IsEmpty]: Start isEmpty. Operand 141665 states and 584468 transitions. [2019-12-27 06:30:49,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 06:30:49,145 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:30:49,145 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:30:49,146 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 06:30:49,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:30:49,146 INFO L82 PathProgramCache]: Analyzing trace with hash 2120295885, now seen corresponding path program 1 times [2019-12-27 06:30:49,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:30:49,146 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321389309] [2019-12-27 06:30:49,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:30:49,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:30:49,203 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 06:30:49,204 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321389309] [2019-12-27 06:30:49,204 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:30:49,204 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:30:49,204 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442631279] [2019-12-27 06:30:49,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:30:49,205 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:30:49,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:30:49,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:30:49,206 INFO L87 Difference]: Start difference. First operand 141665 states and 584468 transitions. Second operand 3 states. [2019-12-27 06:30:49,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:30:49,331 INFO L93 Difference]: Finished difference Result 31684 states and 102658 transitions. [2019-12-27 06:30:49,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:30:49,332 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 06:30:49,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:30:49,410 INFO L225 Difference]: With dead ends: 31684 [2019-12-27 06:30:49,410 INFO L226 Difference]: Without dead ends: 31684 [2019-12-27 06:30:49,411 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:30:49,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31684 states. [2019-12-27 06:30:49,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31684 to 31684. [2019-12-27 06:30:49,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31684 states. [2019-12-27 06:30:50,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31684 states to 31684 states and 102658 transitions. [2019-12-27 06:30:50,006 INFO L78 Accepts]: Start accepts. Automaton has 31684 states and 102658 transitions. Word has length 13 [2019-12-27 06:30:50,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:30:50,006 INFO L462 AbstractCegarLoop]: Abstraction has 31684 states and 102658 transitions. [2019-12-27 06:30:50,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:30:50,006 INFO L276 IsEmpty]: Start isEmpty. Operand 31684 states and 102658 transitions. [2019-12-27 06:30:50,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 06:30:50,008 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:30:50,009 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:30:50,009 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 06:30:50,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:30:50,009 INFO L82 PathProgramCache]: Analyzing trace with hash -2058055416, now seen corresponding path program 1 times [2019-12-27 06:30:50,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:30:50,010 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194864677] [2019-12-27 06:30:50,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:30:50,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:30:50,089 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 06:30:50,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194864677] [2019-12-27 06:30:50,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:30:50,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:30:50,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847112127] [2019-12-27 06:30:50,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:30:50,091 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:30:50,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:30:50,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:30:50,092 INFO L87 Difference]: Start difference. First operand 31684 states and 102658 transitions. Second operand 4 states. [2019-12-27 06:30:52,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:30:52,531 INFO L93 Difference]: Finished difference Result 39269 states and 126736 transitions. [2019-12-27 06:30:52,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:30:52,532 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 06:30:52,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:30:52,596 INFO L225 Difference]: With dead ends: 39269 [2019-12-27 06:30:52,596 INFO L226 Difference]: Without dead ends: 39269 [2019-12-27 06:30:52,597 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 06:30:52,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39269 states. [2019-12-27 06:30:53,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39269 to 35204. [2019-12-27 06:30:53,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35204 states. [2019-12-27 06:30:53,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35204 states to 35204 states and 113989 transitions. [2019-12-27 06:30:53,213 INFO L78 Accepts]: Start accepts. Automaton has 35204 states and 113989 transitions. Word has length 16 [2019-12-27 06:30:53,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:30:53,214 INFO L462 AbstractCegarLoop]: Abstraction has 35204 states and 113989 transitions. [2019-12-27 06:30:53,214 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:30:53,214 INFO L276 IsEmpty]: Start isEmpty. Operand 35204 states and 113989 transitions. [2019-12-27 06:30:53,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 06:30:53,223 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:30:53,223 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:30:53,223 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 06:30:53,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:30:53,224 INFO L82 PathProgramCache]: Analyzing trace with hash -36065168, now seen corresponding path program 1 times [2019-12-27 06:30:53,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:30:53,224 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611648718] [2019-12-27 06:30:53,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:30:53,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:30:53,350 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 06:30:53,350 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611648718] [2019-12-27 06:30:53,351 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:30:53,351 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:30:53,352 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082153509] [2019-12-27 06:30:53,352 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:30:53,352 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:30:53,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:30:53,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:30:53,353 INFO L87 Difference]: Start difference. First operand 35204 states and 113989 transitions. Second operand 5 states. [2019-12-27 06:30:53,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:30:53,965 INFO L93 Difference]: Finished difference Result 45733 states and 145470 transitions. [2019-12-27 06:30:53,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 06:30:53,965 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 06:30:53,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:30:54,047 INFO L225 Difference]: With dead ends: 45733 [2019-12-27 06:30:54,047 INFO L226 Difference]: Without dead ends: 45726 [2019-12-27 06:30:54,048 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 06:30:54,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45726 states. [2019-12-27 06:30:54,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45726 to 34769. [2019-12-27 06:30:54,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34769 states. [2019-12-27 06:30:55,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34769 states to 34769 states and 112450 transitions. [2019-12-27 06:30:55,036 INFO L78 Accepts]: Start accepts. Automaton has 34769 states and 112450 transitions. Word has length 22 [2019-12-27 06:30:55,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:30:55,036 INFO L462 AbstractCegarLoop]: Abstraction has 34769 states and 112450 transitions. [2019-12-27 06:30:55,036 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:30:55,036 INFO L276 IsEmpty]: Start isEmpty. Operand 34769 states and 112450 transitions. [2019-12-27 06:30:55,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 06:30:55,048 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:30:55,048 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 06:30:55,048 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 06:30:55,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:30:55,048 INFO L82 PathProgramCache]: Analyzing trace with hash -74237997, now seen corresponding path program 1 times [2019-12-27 06:30:55,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:30:55,049 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256906500] [2019-12-27 06:30:55,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:30:55,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:30:55,141 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 06:30:55,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256906500] [2019-12-27 06:30:55,143 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:30:55,144 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:30:55,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372059896] [2019-12-27 06:30:55,144 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:30:55,144 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:30:55,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:30:55,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:30:55,146 INFO L87 Difference]: Start difference. First operand 34769 states and 112450 transitions. Second operand 4 states. [2019-12-27 06:30:55,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:30:55,218 INFO L93 Difference]: Finished difference Result 14037 states and 42756 transitions. [2019-12-27 06:30:55,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 06:30:55,218 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 06:30:55,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:30:55,244 INFO L225 Difference]: With dead ends: 14037 [2019-12-27 06:30:55,244 INFO L226 Difference]: Without dead ends: 14037 [2019-12-27 06:30:55,246 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:30:55,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14037 states. [2019-12-27 06:30:55,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14037 to 13737. [2019-12-27 06:30:55,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13737 states. [2019-12-27 06:30:55,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13737 states to 13737 states and 41900 transitions. [2019-12-27 06:30:55,456 INFO L78 Accepts]: Start accepts. Automaton has 13737 states and 41900 transitions. Word has length 25 [2019-12-27 06:30:55,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:30:55,457 INFO L462 AbstractCegarLoop]: Abstraction has 13737 states and 41900 transitions. [2019-12-27 06:30:55,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:30:55,457 INFO L276 IsEmpty]: Start isEmpty. Operand 13737 states and 41900 transitions. [2019-12-27 06:30:55,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 06:30:55,468 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:30:55,468 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 06:30:55,468 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 06:30:55,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:30:55,469 INFO L82 PathProgramCache]: Analyzing trace with hash -1416816819, now seen corresponding path program 1 times [2019-12-27 06:30:55,469 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:30:55,469 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356340664] [2019-12-27 06:30:55,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:30:55,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:30:55,528 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 06:30:55,529 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356340664] [2019-12-27 06:30:55,529 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:30:55,529 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:30:55,530 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614621542] [2019-12-27 06:30:55,531 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:30:55,531 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:30:55,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:30:55,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:30:55,531 INFO L87 Difference]: Start difference. First operand 13737 states and 41900 transitions. Second operand 3 states. [2019-12-27 06:30:55,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:30:55,615 INFO L93 Difference]: Finished difference Result 19578 states and 58726 transitions. [2019-12-27 06:30:55,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:30:55,616 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-27 06:30:55,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:30:55,641 INFO L225 Difference]: With dead ends: 19578 [2019-12-27 06:30:55,642 INFO L226 Difference]: Without dead ends: 19578 [2019-12-27 06:30:55,642 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 06:30:55,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19578 states. [2019-12-27 06:30:55,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19578 to 14483. [2019-12-27 06:30:55,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14483 states. [2019-12-27 06:30:55,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14483 states to 14483 states and 44038 transitions. [2019-12-27 06:30:55,894 INFO L78 Accepts]: Start accepts. Automaton has 14483 states and 44038 transitions. Word has length 27 [2019-12-27 06:30:55,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:30:55,895 INFO L462 AbstractCegarLoop]: Abstraction has 14483 states and 44038 transitions. [2019-12-27 06:30:55,895 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:30:55,895 INFO L276 IsEmpty]: Start isEmpty. Operand 14483 states and 44038 transitions. [2019-12-27 06:30:55,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 06:30:55,904 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:30:55,905 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 06:30:55,905 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 06:30:55,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:30:55,905 INFO L82 PathProgramCache]: Analyzing trace with hash -522150304, now seen corresponding path program 1 times [2019-12-27 06:30:55,905 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:30:55,905 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365114161] [2019-12-27 06:30:55,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:30:55,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:30:55,991 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 06:30:55,991 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365114161] [2019-12-27 06:30:55,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:30:55,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:30:55,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817002459] [2019-12-27 06:30:55,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:30:55,993 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:30:55,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:30:55,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:30:55,993 INFO L87 Difference]: Start difference. First operand 14483 states and 44038 transitions. Second operand 6 states. [2019-12-27 06:30:56,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:30:56,803 INFO L93 Difference]: Finished difference Result 37116 states and 111354 transitions. [2019-12-27 06:30:56,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 06:30:56,804 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 06:30:56,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:30:56,856 INFO L225 Difference]: With dead ends: 37116 [2019-12-27 06:30:56,857 INFO L226 Difference]: Without dead ends: 37116 [2019-12-27 06:30:56,857 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 06:30:56,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37116 states. [2019-12-27 06:30:57,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37116 to 20406. [2019-12-27 06:30:57,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20406 states. [2019-12-27 06:30:57,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20406 states to 20406 states and 62975 transitions. [2019-12-27 06:30:57,436 INFO L78 Accepts]: Start accepts. Automaton has 20406 states and 62975 transitions. Word has length 27 [2019-12-27 06:30:57,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:30:57,437 INFO L462 AbstractCegarLoop]: Abstraction has 20406 states and 62975 transitions. [2019-12-27 06:30:57,437 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:30:57,437 INFO L276 IsEmpty]: Start isEmpty. Operand 20406 states and 62975 transitions. [2019-12-27 06:30:57,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 06:30:57,453 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:30:57,453 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 06:30:57,453 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 06:30:57,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:30:57,453 INFO L82 PathProgramCache]: Analyzing trace with hash -624201971, now seen corresponding path program 1 times [2019-12-27 06:30:57,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:30:57,453 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140183071] [2019-12-27 06:30:57,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:30:57,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:30:57,527 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 06:30:57,528 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140183071] [2019-12-27 06:30:57,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:30:57,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:30:57,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600206771] [2019-12-27 06:30:57,529 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:30:57,529 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:30:57,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:30:57,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:30:57,530 INFO L87 Difference]: Start difference. First operand 20406 states and 62975 transitions. Second operand 6 states. [2019-12-27 06:30:58,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:30:58,316 INFO L93 Difference]: Finished difference Result 34406 states and 103090 transitions. [2019-12-27 06:30:58,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 06:30:58,317 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-27 06:30:58,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:30:58,366 INFO L225 Difference]: With dead ends: 34406 [2019-12-27 06:30:58,366 INFO L226 Difference]: Without dead ends: 34406 [2019-12-27 06:30:58,367 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 06:30:58,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34406 states. [2019-12-27 06:30:58,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34406 to 20168. [2019-12-27 06:30:58,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20168 states. [2019-12-27 06:30:58,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20168 states to 20168 states and 62360 transitions. [2019-12-27 06:30:58,779 INFO L78 Accepts]: Start accepts. Automaton has 20168 states and 62360 transitions. Word has length 28 [2019-12-27 06:30:58,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:30:58,779 INFO L462 AbstractCegarLoop]: Abstraction has 20168 states and 62360 transitions. [2019-12-27 06:30:58,779 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:30:58,779 INFO L276 IsEmpty]: Start isEmpty. Operand 20168 states and 62360 transitions. [2019-12-27 06:30:58,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 06:30:58,802 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:30:58,802 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 06:30:58,802 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 06:30:58,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:30:58,802 INFO L82 PathProgramCache]: Analyzing trace with hash -160608776, now seen corresponding path program 1 times [2019-12-27 06:30:58,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:30:58,803 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349008844] [2019-12-27 06:30:58,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:30:58,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:30:58,899 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 06:30:58,900 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349008844] [2019-12-27 06:30:58,900 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:30:58,900 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 06:30:58,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412941499] [2019-12-27 06:30:58,901 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:30:58,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:30:58,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:30:58,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:30:58,901 INFO L87 Difference]: Start difference. First operand 20168 states and 62360 transitions. Second operand 7 states. [2019-12-27 06:31:00,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:31:00,380 INFO L93 Difference]: Finished difference Result 46484 states and 138742 transitions. [2019-12-27 06:31:00,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 06:31:00,380 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-27 06:31:00,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:31:00,446 INFO L225 Difference]: With dead ends: 46484 [2019-12-27 06:31:00,446 INFO L226 Difference]: Without dead ends: 46484 [2019-12-27 06:31:00,447 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2019-12-27 06:31:00,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46484 states. [2019-12-27 06:31:01,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46484 to 21453. [2019-12-27 06:31:01,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21453 states. [2019-12-27 06:31:01,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21453 states to 21453 states and 66323 transitions. [2019-12-27 06:31:01,089 INFO L78 Accepts]: Start accepts. Automaton has 21453 states and 66323 transitions. Word has length 33 [2019-12-27 06:31:01,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:31:01,089 INFO L462 AbstractCegarLoop]: Abstraction has 21453 states and 66323 transitions. [2019-12-27 06:31:01,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:31:01,089 INFO L276 IsEmpty]: Start isEmpty. Operand 21453 states and 66323 transitions. [2019-12-27 06:31:01,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 06:31:01,111 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:31:01,111 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 06:31:01,111 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 06:31:01,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:31:01,111 INFO L82 PathProgramCache]: Analyzing trace with hash 88321435, now seen corresponding path program 1 times [2019-12-27 06:31:01,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:31:01,111 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514128799] [2019-12-27 06:31:01,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:31:01,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:31:01,158 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 06:31:01,158 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514128799] [2019-12-27 06:31:01,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:31:01,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:31:01,159 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504224179] [2019-12-27 06:31:01,159 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:31:01,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:31:01,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:31:01,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:31:01,160 INFO L87 Difference]: Start difference. First operand 21453 states and 66323 transitions. Second operand 3 states. [2019-12-27 06:31:01,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:31:01,263 INFO L93 Difference]: Finished difference Result 28695 states and 85797 transitions. [2019-12-27 06:31:01,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:31:01,263 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-12-27 06:31:01,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:31:01,302 INFO L225 Difference]: With dead ends: 28695 [2019-12-27 06:31:01,302 INFO L226 Difference]: Without dead ends: 28695 [2019-12-27 06:31:01,302 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 06:31:01,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28695 states. [2019-12-27 06:31:01,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28695 to 20429. [2019-12-27 06:31:01,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20429 states. [2019-12-27 06:31:01,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20429 states to 20429 states and 61176 transitions. [2019-12-27 06:31:01,646 INFO L78 Accepts]: Start accepts. Automaton has 20429 states and 61176 transitions. Word has length 33 [2019-12-27 06:31:01,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:31:01,646 INFO L462 AbstractCegarLoop]: Abstraction has 20429 states and 61176 transitions. [2019-12-27 06:31:01,646 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:31:01,646 INFO L276 IsEmpty]: Start isEmpty. Operand 20429 states and 61176 transitions. [2019-12-27 06:31:01,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 06:31:01,664 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:31:01,664 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 06:31:01,664 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 06:31:01,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:31:01,665 INFO L82 PathProgramCache]: Analyzing trace with hash 838482894, now seen corresponding path program 2 times [2019-12-27 06:31:01,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:31:01,665 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856011386] [2019-12-27 06:31:01,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:31:01,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:31:01,771 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 06:31:01,772 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856011386] [2019-12-27 06:31:01,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:31:01,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:31:01,773 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673515659] [2019-12-27 06:31:01,773 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 06:31:01,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:31:01,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 06:31:01,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 06:31:01,774 INFO L87 Difference]: Start difference. First operand 20429 states and 61176 transitions. Second operand 8 states. [2019-12-27 06:31:03,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:31:03,608 INFO L93 Difference]: Finished difference Result 45938 states and 134554 transitions. [2019-12-27 06:31:03,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 06:31:03,609 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-12-27 06:31:03,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:31:03,675 INFO L225 Difference]: With dead ends: 45938 [2019-12-27 06:31:03,676 INFO L226 Difference]: Without dead ends: 45938 [2019-12-27 06:31:03,676 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=161, Invalid=489, Unknown=0, NotChecked=0, Total=650 [2019-12-27 06:31:03,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45938 states. [2019-12-27 06:31:04,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45938 to 19869. [2019-12-27 06:31:04,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19869 states. [2019-12-27 06:31:04,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19869 states to 19869 states and 59508 transitions. [2019-12-27 06:31:04,343 INFO L78 Accepts]: Start accepts. Automaton has 19869 states and 59508 transitions. Word has length 33 [2019-12-27 06:31:04,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:31:04,343 INFO L462 AbstractCegarLoop]: Abstraction has 19869 states and 59508 transitions. [2019-12-27 06:31:04,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 06:31:04,343 INFO L276 IsEmpty]: Start isEmpty. Operand 19869 states and 59508 transitions. [2019-12-27 06:31:04,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 06:31:04,360 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:31:04,360 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] [2019-12-27 06:31:04,360 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 06:31:04,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:31:04,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1993650805, now seen corresponding path program 1 times [2019-12-27 06:31:04,360 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:31:04,361 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083448871] [2019-12-27 06:31:04,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:31:04,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:31:04,465 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 06:31:04,466 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083448871] [2019-12-27 06:31:04,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:31:04,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 06:31:04,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113600702] [2019-12-27 06:31:04,467 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:31:04,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:31:04,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:31:04,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:31:04,468 INFO L87 Difference]: Start difference. First operand 19869 states and 59508 transitions. Second operand 7 states. [2019-12-27 06:31:05,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:31:05,701 INFO L93 Difference]: Finished difference Result 35347 states and 103679 transitions. [2019-12-27 06:31:05,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 06:31:05,702 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-12-27 06:31:05,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:31:05,751 INFO L225 Difference]: With dead ends: 35347 [2019-12-27 06:31:05,751 INFO L226 Difference]: Without dead ends: 35347 [2019-12-27 06:31:05,752 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2019-12-27 06:31:05,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35347 states. [2019-12-27 06:31:06,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35347 to 18737. [2019-12-27 06:31:06,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18737 states. [2019-12-27 06:31:06,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18737 states to 18737 states and 56205 transitions. [2019-12-27 06:31:06,150 INFO L78 Accepts]: Start accepts. Automaton has 18737 states and 56205 transitions. Word has length 34 [2019-12-27 06:31:06,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:31:06,150 INFO L462 AbstractCegarLoop]: Abstraction has 18737 states and 56205 transitions. [2019-12-27 06:31:06,150 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:31:06,150 INFO L276 IsEmpty]: Start isEmpty. Operand 18737 states and 56205 transitions. [2019-12-27 06:31:06,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 06:31:06,167 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:31:06,167 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] [2019-12-27 06:31:06,167 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 06:31:06,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:31:06,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1065822653, now seen corresponding path program 2 times [2019-12-27 06:31:06,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:31:06,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470790592] [2019-12-27 06:31:06,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:31:06,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:31:06,274 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 06:31:06,274 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470790592] [2019-12-27 06:31:06,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:31:06,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:31:06,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980161782] [2019-12-27 06:31:06,275 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 06:31:06,275 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:31:06,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 06:31:06,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 06:31:06,276 INFO L87 Difference]: Start difference. First operand 18737 states and 56205 transitions. Second operand 8 states. [2019-12-27 06:31:07,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:31:07,924 INFO L93 Difference]: Finished difference Result 40218 states and 116663 transitions. [2019-12-27 06:31:07,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 06:31:07,925 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2019-12-27 06:31:07,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:31:08,017 INFO L225 Difference]: With dead ends: 40218 [2019-12-27 06:31:08,017 INFO L226 Difference]: Without dead ends: 40218 [2019-12-27 06:31:08,019 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=161, Invalid=489, Unknown=0, NotChecked=0, Total=650 [2019-12-27 06:31:08,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40218 states. [2019-12-27 06:31:08,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40218 to 16942. [2019-12-27 06:31:08,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16942 states. [2019-12-27 06:31:08,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16942 states to 16942 states and 50885 transitions. [2019-12-27 06:31:08,468 INFO L78 Accepts]: Start accepts. Automaton has 16942 states and 50885 transitions. Word has length 34 [2019-12-27 06:31:08,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:31:08,468 INFO L462 AbstractCegarLoop]: Abstraction has 16942 states and 50885 transitions. [2019-12-27 06:31:08,469 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 06:31:08,469 INFO L276 IsEmpty]: Start isEmpty. Operand 16942 states and 50885 transitions. [2019-12-27 06:31:08,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 06:31:08,489 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:31:08,490 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 06:31:08,490 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 06:31:08,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:31:08,490 INFO L82 PathProgramCache]: Analyzing trace with hash -903409010, now seen corresponding path program 1 times [2019-12-27 06:31:08,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:31:08,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590453066] [2019-12-27 06:31:08,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:31:08,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:31:08,549 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 06:31:08,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590453066] [2019-12-27 06:31:08,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:31:08,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:31:08,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227347614] [2019-12-27 06:31:08,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:31:08,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:31:08,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:31:08,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:31:08,550 INFO L87 Difference]: Start difference. First operand 16942 states and 50885 transitions. Second operand 4 states. [2019-12-27 06:31:08,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:31:08,786 INFO L93 Difference]: Finished difference Result 28675 states and 86465 transitions. [2019-12-27 06:31:08,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 06:31:08,786 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-12-27 06:31:08,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:31:08,812 INFO L225 Difference]: With dead ends: 28675 [2019-12-27 06:31:08,813 INFO L226 Difference]: Without dead ends: 14492 [2019-12-27 06:31:08,813 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 06:31:08,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14492 states. [2019-12-27 06:31:09,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14492 to 14412. [2019-12-27 06:31:09,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14412 states. [2019-12-27 06:31:09,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14412 states to 14412 states and 42566 transitions. [2019-12-27 06:31:09,153 INFO L78 Accepts]: Start accepts. Automaton has 14412 states and 42566 transitions. Word has length 39 [2019-12-27 06:31:09,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:31:09,153 INFO L462 AbstractCegarLoop]: Abstraction has 14412 states and 42566 transitions. [2019-12-27 06:31:09,153 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:31:09,154 INFO L276 IsEmpty]: Start isEmpty. Operand 14412 states and 42566 transitions. [2019-12-27 06:31:09,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 06:31:09,173 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:31:09,173 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 06:31:09,173 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 06:31:09,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:31:09,174 INFO L82 PathProgramCache]: Analyzing trace with hash -2089566008, now seen corresponding path program 2 times [2019-12-27 06:31:09,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:31:09,174 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056963554] [2019-12-27 06:31:09,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:31:09,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:31:09,238 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 06:31:09,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056963554] [2019-12-27 06:31:09,238 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:31:09,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:31:09,239 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406539688] [2019-12-27 06:31:09,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:31:09,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:31:09,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:31:09,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:31:09,243 INFO L87 Difference]: Start difference. First operand 14412 states and 42566 transitions. Second operand 3 states. [2019-12-27 06:31:09,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:31:09,333 INFO L93 Difference]: Finished difference Result 23005 states and 68360 transitions. [2019-12-27 06:31:09,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:31:09,334 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 06:31:09,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:31:09,354 INFO L225 Difference]: With dead ends: 23005 [2019-12-27 06:31:09,354 INFO L226 Difference]: Without dead ends: 10590 [2019-12-27 06:31:09,354 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:31:09,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10590 states. [2019-12-27 06:31:09,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10590 to 10534. [2019-12-27 06:31:09,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10534 states. [2019-12-27 06:31:09,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10534 states to 10534 states and 30298 transitions. [2019-12-27 06:31:09,580 INFO L78 Accepts]: Start accepts. Automaton has 10534 states and 30298 transitions. Word has length 39 [2019-12-27 06:31:09,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:31:09,581 INFO L462 AbstractCegarLoop]: Abstraction has 10534 states and 30298 transitions. [2019-12-27 06:31:09,581 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:31:09,581 INFO L276 IsEmpty]: Start isEmpty. Operand 10534 states and 30298 transitions. [2019-12-27 06:31:09,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 06:31:09,593 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:31:09,593 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 06:31:09,593 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 06:31:09,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:31:09,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1423567527, now seen corresponding path program 1 times [2019-12-27 06:31:09,594 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:31:09,594 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444436193] [2019-12-27 06:31:09,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:31:09,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:31:09,663 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 06:31:09,663 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444436193] [2019-12-27 06:31:09,663 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:31:09,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 06:31:09,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121271264] [2019-12-27 06:31:09,664 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:31:09,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:31:09,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:31:09,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:31:09,665 INFO L87 Difference]: Start difference. First operand 10534 states and 30298 transitions. Second operand 5 states. [2019-12-27 06:31:10,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:31:10,236 INFO L93 Difference]: Finished difference Result 17505 states and 50007 transitions. [2019-12-27 06:31:10,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 06:31:10,236 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 06:31:10,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:31:10,260 INFO L225 Difference]: With dead ends: 17505 [2019-12-27 06:31:10,261 INFO L226 Difference]: Without dead ends: 17505 [2019-12-27 06:31:10,261 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:31:10,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17505 states. [2019-12-27 06:31:10,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17505 to 16433. [2019-12-27 06:31:10,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16433 states. [2019-12-27 06:31:10,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16433 states to 16433 states and 47130 transitions. [2019-12-27 06:31:10,501 INFO L78 Accepts]: Start accepts. Automaton has 16433 states and 47130 transitions. Word has length 40 [2019-12-27 06:31:10,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:31:10,502 INFO L462 AbstractCegarLoop]: Abstraction has 16433 states and 47130 transitions. [2019-12-27 06:31:10,502 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:31:10,502 INFO L276 IsEmpty]: Start isEmpty. Operand 16433 states and 47130 transitions. [2019-12-27 06:31:10,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 06:31:10,516 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:31:10,516 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 06:31:10,517 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 06:31:10,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:31:10,517 INFO L82 PathProgramCache]: Analyzing trace with hash -1539619421, now seen corresponding path program 2 times [2019-12-27 06:31:10,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:31:10,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979695641] [2019-12-27 06:31:10,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:31:10,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:31:10,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:31:10,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979695641] [2019-12-27 06:31:10,577 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:31:10,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:31:10,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344475183] [2019-12-27 06:31:10,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:31:10,578 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:31:10,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:31:10,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:31:10,578 INFO L87 Difference]: Start difference. First operand 16433 states and 47130 transitions. Second operand 5 states. [2019-12-27 06:31:10,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:31:10,658 INFO L93 Difference]: Finished difference Result 15339 states and 44645 transitions. [2019-12-27 06:31:10,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:31:10,658 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 06:31:10,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:31:10,680 INFO L225 Difference]: With dead ends: 15339 [2019-12-27 06:31:10,680 INFO L226 Difference]: Without dead ends: 12149 [2019-12-27 06:31:10,680 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:31:10,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12149 states. [2019-12-27 06:31:10,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12149 to 11603. [2019-12-27 06:31:10,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11603 states. [2019-12-27 06:31:10,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11603 states to 11603 states and 36079 transitions. [2019-12-27 06:31:10,943 INFO L78 Accepts]: Start accepts. Automaton has 11603 states and 36079 transitions. Word has length 40 [2019-12-27 06:31:10,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:31:10,943 INFO L462 AbstractCegarLoop]: Abstraction has 11603 states and 36079 transitions. [2019-12-27 06:31:10,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:31:10,944 INFO L276 IsEmpty]: Start isEmpty. Operand 11603 states and 36079 transitions. [2019-12-27 06:31:10,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 06:31:10,958 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:31:10,958 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] [2019-12-27 06:31:10,958 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 06:31:10,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:31:10,958 INFO L82 PathProgramCache]: Analyzing trace with hash 987827026, now seen corresponding path program 1 times [2019-12-27 06:31:10,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:31:10,959 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404810965] [2019-12-27 06:31:10,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:31:10,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:31:11,061 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 06:31:11,062 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404810965] [2019-12-27 06:31:11,062 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:31:11,062 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 06:31:11,062 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130060604] [2019-12-27 06:31:11,062 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 06:31:11,063 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:31:11,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 06:31:11,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 06:31:11,063 INFO L87 Difference]: Start difference. First operand 11603 states and 36079 transitions. Second operand 8 states. [2019-12-27 06:31:11,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:31:11,910 INFO L93 Difference]: Finished difference Result 31587 states and 96032 transitions. [2019-12-27 06:31:11,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 06:31:11,910 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 64 [2019-12-27 06:31:11,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:31:11,950 INFO L225 Difference]: With dead ends: 31587 [2019-12-27 06:31:11,950 INFO L226 Difference]: Without dead ends: 22364 [2019-12-27 06:31:11,951 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=352, Unknown=0, NotChecked=0, Total=462 [2019-12-27 06:31:12,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22364 states. [2019-12-27 06:31:12,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22364 to 13002. [2019-12-27 06:31:12,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13002 states. [2019-12-27 06:31:12,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13002 states to 13002 states and 40208 transitions. [2019-12-27 06:31:12,406 INFO L78 Accepts]: Start accepts. Automaton has 13002 states and 40208 transitions. Word has length 64 [2019-12-27 06:31:12,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:31:12,406 INFO L462 AbstractCegarLoop]: Abstraction has 13002 states and 40208 transitions. [2019-12-27 06:31:12,406 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 06:31:12,406 INFO L276 IsEmpty]: Start isEmpty. Operand 13002 states and 40208 transitions. [2019-12-27 06:31:12,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 06:31:12,421 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:31:12,421 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] [2019-12-27 06:31:12,421 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 06:31:12,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:31:12,422 INFO L82 PathProgramCache]: Analyzing trace with hash -2017353844, now seen corresponding path program 2 times [2019-12-27 06:31:12,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:31:12,422 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171886192] [2019-12-27 06:31:12,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:31:12,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:31:12,489 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 06:31:12,490 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171886192] [2019-12-27 06:31:12,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:31:12,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:31:12,490 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977029448] [2019-12-27 06:31:12,491 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:31:12,491 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:31:12,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:31:12,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:31:12,491 INFO L87 Difference]: Start difference. First operand 13002 states and 40208 transitions. Second operand 7 states. [2019-12-27 06:31:12,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:31:12,739 INFO L93 Difference]: Finished difference Result 25917 states and 78857 transitions. [2019-12-27 06:31:12,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 06:31:12,739 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 06:31:12,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:31:12,764 INFO L225 Difference]: With dead ends: 25917 [2019-12-27 06:31:12,764 INFO L226 Difference]: Without dead ends: 18327 [2019-12-27 06:31:12,765 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-27 06:31:12,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18327 states. [2019-12-27 06:31:12,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18327 to 15314. [2019-12-27 06:31:12,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15314 states. [2019-12-27 06:31:13,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15314 states to 15314 states and 47034 transitions. [2019-12-27 06:31:13,020 INFO L78 Accepts]: Start accepts. Automaton has 15314 states and 47034 transitions. Word has length 64 [2019-12-27 06:31:13,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:31:13,020 INFO L462 AbstractCegarLoop]: Abstraction has 15314 states and 47034 transitions. [2019-12-27 06:31:13,020 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:31:13,020 INFO L276 IsEmpty]: Start isEmpty. Operand 15314 states and 47034 transitions. [2019-12-27 06:31:13,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 06:31:13,036 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:31:13,037 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] [2019-12-27 06:31:13,037 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 06:31:13,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:31:13,037 INFO L82 PathProgramCache]: Analyzing trace with hash -838064708, now seen corresponding path program 3 times [2019-12-27 06:31:13,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:31:13,037 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798810142] [2019-12-27 06:31:13,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:31:13,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:31:13,158 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 06:31:13,158 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798810142] [2019-12-27 06:31:13,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:31:13,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 06:31:13,159 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839729911] [2019-12-27 06:31:13,159 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 06:31:13,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:31:13,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 06:31:13,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 06:31:13,160 INFO L87 Difference]: Start difference. First operand 15314 states and 47034 transitions. Second operand 9 states. [2019-12-27 06:31:14,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:31:14,179 INFO L93 Difference]: Finished difference Result 47803 states and 144821 transitions. [2019-12-27 06:31:14,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 06:31:14,179 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-27 06:31:14,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:31:14,238 INFO L225 Difference]: With dead ends: 47803 [2019-12-27 06:31:14,238 INFO L226 Difference]: Without dead ends: 44099 [2019-12-27 06:31:14,239 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2019-12-27 06:31:14,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44099 states. [2019-12-27 06:31:14,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44099 to 15558. [2019-12-27 06:31:14,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15558 states. [2019-12-27 06:31:14,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15558 states to 15558 states and 47784 transitions. [2019-12-27 06:31:14,689 INFO L78 Accepts]: Start accepts. Automaton has 15558 states and 47784 transitions. Word has length 64 [2019-12-27 06:31:14,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:31:14,689 INFO L462 AbstractCegarLoop]: Abstraction has 15558 states and 47784 transitions. [2019-12-27 06:31:14,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 06:31:14,689 INFO L276 IsEmpty]: Start isEmpty. Operand 15558 states and 47784 transitions. [2019-12-27 06:31:14,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 06:31:14,712 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:31:14,712 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] [2019-12-27 06:31:14,713 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 06:31:14,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:31:14,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1593875220, now seen corresponding path program 4 times [2019-12-27 06:31:14,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:31:14,713 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430153980] [2019-12-27 06:31:14,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:31:14,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:31:14,811 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 06:31:14,811 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430153980] [2019-12-27 06:31:14,812 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:31:14,812 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 06:31:14,813 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840857436] [2019-12-27 06:31:14,813 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 06:31:14,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:31:14,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 06:31:14,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 06:31:14,818 INFO L87 Difference]: Start difference. First operand 15558 states and 47784 transitions. Second operand 9 states. [2019-12-27 06:31:16,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:31:16,106 INFO L93 Difference]: Finished difference Result 35624 states and 107719 transitions. [2019-12-27 06:31:16,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 06:31:16,107 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-27 06:31:16,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:31:16,168 INFO L225 Difference]: With dead ends: 35624 [2019-12-27 06:31:16,169 INFO L226 Difference]: Without dead ends: 32808 [2019-12-27 06:31:16,169 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=536, Unknown=0, NotChecked=0, Total=702 [2019-12-27 06:31:16,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32808 states. [2019-12-27 06:31:16,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32808 to 15311. [2019-12-27 06:31:16,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15311 states. [2019-12-27 06:31:16,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15311 states to 15311 states and 47116 transitions. [2019-12-27 06:31:16,673 INFO L78 Accepts]: Start accepts. Automaton has 15311 states and 47116 transitions. Word has length 64 [2019-12-27 06:31:16,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:31:16,674 INFO L462 AbstractCegarLoop]: Abstraction has 15311 states and 47116 transitions. [2019-12-27 06:31:16,674 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 06:31:16,674 INFO L276 IsEmpty]: Start isEmpty. Operand 15311 states and 47116 transitions. [2019-12-27 06:31:16,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 06:31:16,691 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:31:16,691 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] [2019-12-27 06:31:16,691 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 06:31:16,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:31:16,694 INFO L82 PathProgramCache]: Analyzing trace with hash -406759870, now seen corresponding path program 5 times [2019-12-27 06:31:16,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:31:16,697 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775198494] [2019-12-27 06:31:16,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:31:16,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:31:16,802 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 06:31:16,803 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775198494] [2019-12-27 06:31:16,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:31:16,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:31:16,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296044673] [2019-12-27 06:31:16,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:31:16,806 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:31:16,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:31:16,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:31:16,807 INFO L87 Difference]: Start difference. First operand 15311 states and 47116 transitions. Second operand 7 states. [2019-12-27 06:31:17,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:31:17,217 INFO L93 Difference]: Finished difference Result 25740 states and 77714 transitions. [2019-12-27 06:31:17,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 06:31:17,217 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 06:31:17,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:31:17,255 INFO L225 Difference]: With dead ends: 25740 [2019-12-27 06:31:17,255 INFO L226 Difference]: Without dead ends: 18859 [2019-12-27 06:31:17,255 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-27 06:31:17,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18859 states. [2019-12-27 06:31:17,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18859 to 15335. [2019-12-27 06:31:17,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15335 states. [2019-12-27 06:31:17,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15335 states to 15335 states and 47162 transitions. [2019-12-27 06:31:17,641 INFO L78 Accepts]: Start accepts. Automaton has 15335 states and 47162 transitions. Word has length 64 [2019-12-27 06:31:17,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:31:17,641 INFO L462 AbstractCegarLoop]: Abstraction has 15335 states and 47162 transitions. [2019-12-27 06:31:17,641 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:31:17,641 INFO L276 IsEmpty]: Start isEmpty. Operand 15335 states and 47162 transitions. [2019-12-27 06:31:17,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 06:31:17,666 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:31:17,666 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] [2019-12-27 06:31:17,666 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:31:17,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:31:17,666 INFO L82 PathProgramCache]: Analyzing trace with hash -2083011794, now seen corresponding path program 6 times [2019-12-27 06:31:17,667 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:31:17,667 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689578928] [2019-12-27 06:31:17,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:31:17,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:31:17,722 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 06:31:17,722 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689578928] [2019-12-27 06:31:17,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:31:17,722 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:31:17,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740491979] [2019-12-27 06:31:17,723 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:31:17,723 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:31:17,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:31:17,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:31:17,724 INFO L87 Difference]: Start difference. First operand 15335 states and 47162 transitions. Second operand 3 states. [2019-12-27 06:31:17,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:31:17,832 INFO L93 Difference]: Finished difference Result 17615 states and 54128 transitions. [2019-12-27 06:31:17,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:31:17,833 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 06:31:17,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:31:17,856 INFO L225 Difference]: With dead ends: 17615 [2019-12-27 06:31:17,856 INFO L226 Difference]: Without dead ends: 17615 [2019-12-27 06:31:17,856 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 06:31:17,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17615 states. [2019-12-27 06:31:18,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17615 to 15395. [2019-12-27 06:31:18,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15395 states. [2019-12-27 06:31:18,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15395 states to 15395 states and 47626 transitions. [2019-12-27 06:31:18,108 INFO L78 Accepts]: Start accepts. Automaton has 15395 states and 47626 transitions. Word has length 64 [2019-12-27 06:31:18,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:31:18,108 INFO L462 AbstractCegarLoop]: Abstraction has 15395 states and 47626 transitions. [2019-12-27 06:31:18,108 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:31:18,108 INFO L276 IsEmpty]: Start isEmpty. Operand 15395 states and 47626 transitions. [2019-12-27 06:31:18,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 06:31:18,125 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:31:18,125 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] [2019-12-27 06:31:18,125 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:31:18,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:31:18,126 INFO L82 PathProgramCache]: Analyzing trace with hash -2130207003, now seen corresponding path program 1 times [2019-12-27 06:31:18,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:31:18,126 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034976841] [2019-12-27 06:31:18,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:31:18,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:31:18,171 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 06:31:18,171 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034976841] [2019-12-27 06:31:18,171 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:31:18,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:31:18,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094784270] [2019-12-27 06:31:18,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:31:18,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:31:18,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:31:18,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:31:18,173 INFO L87 Difference]: Start difference. First operand 15395 states and 47626 transitions. Second operand 4 states. [2019-12-27 06:31:18,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:31:18,414 INFO L93 Difference]: Finished difference Result 19567 states and 60167 transitions. [2019-12-27 06:31:18,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 06:31:18,414 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-27 06:31:18,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:31:18,461 INFO L225 Difference]: With dead ends: 19567 [2019-12-27 06:31:18,462 INFO L226 Difference]: Without dead ends: 19567 [2019-12-27 06:31:18,462 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:31:18,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19567 states. [2019-12-27 06:31:18,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19567 to 15944. [2019-12-27 06:31:18,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15944 states. [2019-12-27 06:31:18,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15944 states to 15944 states and 49343 transitions. [2019-12-27 06:31:18,919 INFO L78 Accepts]: Start accepts. Automaton has 15944 states and 49343 transitions. Word has length 65 [2019-12-27 06:31:18,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:31:18,919 INFO L462 AbstractCegarLoop]: Abstraction has 15944 states and 49343 transitions. [2019-12-27 06:31:18,920 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:31:18,920 INFO L276 IsEmpty]: Start isEmpty. Operand 15944 states and 49343 transitions. [2019-12-27 06:31:18,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 06:31:18,941 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:31:18,941 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] [2019-12-27 06:31:18,941 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:31:18,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:31:18,941 INFO L82 PathProgramCache]: Analyzing trace with hash -1591994433, now seen corresponding path program 2 times [2019-12-27 06:31:18,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:31:18,941 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581355269] [2019-12-27 06:31:18,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:31:18,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:31:19,049 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 06:31:19,049 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581355269] [2019-12-27 06:31:19,049 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:31:19,049 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 06:31:19,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688667574] [2019-12-27 06:31:19,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 06:31:19,050 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:31:19,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 06:31:19,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 06:31:19,051 INFO L87 Difference]: Start difference. First operand 15944 states and 49343 transitions. Second operand 9 states. [2019-12-27 06:31:20,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:31:20,132 INFO L93 Difference]: Finished difference Result 41264 states and 124013 transitions. [2019-12-27 06:31:20,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 06:31:20,132 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-27 06:31:20,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:31:20,177 INFO L225 Difference]: With dead ends: 41264 [2019-12-27 06:31:20,177 INFO L226 Difference]: Without dead ends: 33724 [2019-12-27 06:31:20,178 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=459, Unknown=0, NotChecked=0, Total=600 [2019-12-27 06:31:20,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33724 states. [2019-12-27 06:31:20,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33724 to 15883. [2019-12-27 06:31:20,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15883 states. [2019-12-27 06:31:20,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15883 states to 15883 states and 48653 transitions. [2019-12-27 06:31:20,675 INFO L78 Accepts]: Start accepts. Automaton has 15883 states and 48653 transitions. Word has length 65 [2019-12-27 06:31:20,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:31:20,675 INFO L462 AbstractCegarLoop]: Abstraction has 15883 states and 48653 transitions. [2019-12-27 06:31:20,675 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 06:31:20,675 INFO L276 IsEmpty]: Start isEmpty. Operand 15883 states and 48653 transitions. [2019-12-27 06:31:20,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 06:31:20,692 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:31:20,692 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] [2019-12-27 06:31:20,692 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:31:20,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:31:20,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1318305515, now seen corresponding path program 3 times [2019-12-27 06:31:20,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:31:20,693 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221689324] [2019-12-27 06:31:20,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:31:20,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:31:20,812 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 06:31:20,812 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221689324] [2019-12-27 06:31:20,812 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:31:20,812 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 06:31:20,812 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008570454] [2019-12-27 06:31:20,813 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 06:31:20,813 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:31:20,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 06:31:20,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 06:31:20,813 INFO L87 Difference]: Start difference. First operand 15883 states and 48653 transitions. Second operand 9 states. [2019-12-27 06:31:21,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:31:21,707 INFO L93 Difference]: Finished difference Result 32475 states and 97537 transitions. [2019-12-27 06:31:21,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 06:31:21,707 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-27 06:31:21,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:31:21,745 INFO L225 Difference]: With dead ends: 32475 [2019-12-27 06:31:21,745 INFO L226 Difference]: Without dead ends: 28770 [2019-12-27 06:31:21,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=423, Unknown=0, NotChecked=0, Total=552 [2019-12-27 06:31:21,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28770 states. [2019-12-27 06:31:22,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28770 to 15369. [2019-12-27 06:31:22,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15369 states. [2019-12-27 06:31:22,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15369 states to 15369 states and 47106 transitions. [2019-12-27 06:31:22,067 INFO L78 Accepts]: Start accepts. Automaton has 15369 states and 47106 transitions. Word has length 65 [2019-12-27 06:31:22,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:31:22,067 INFO L462 AbstractCegarLoop]: Abstraction has 15369 states and 47106 transitions. [2019-12-27 06:31:22,067 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 06:31:22,067 INFO L276 IsEmpty]: Start isEmpty. Operand 15369 states and 47106 transitions. [2019-12-27 06:31:22,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 06:31:22,084 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:31:22,084 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] [2019-12-27 06:31:22,084 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:31:22,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:31:22,084 INFO L82 PathProgramCache]: Analyzing trace with hash 2022119832, now seen corresponding path program 1 times [2019-12-27 06:31:22,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:31:22,085 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910302341] [2019-12-27 06:31:22,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:31:22,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:31:22,148 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 06:31:22,148 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910302341] [2019-12-27 06:31:22,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:31:22,149 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:31:22,149 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081288167] [2019-12-27 06:31:22,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:31:22,149 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:31:22,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:31:22,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:31:22,150 INFO L87 Difference]: Start difference. First operand 15369 states and 47106 transitions. Second operand 3 states. [2019-12-27 06:31:22,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:31:22,218 INFO L93 Difference]: Finished difference Result 15369 states and 47105 transitions. [2019-12-27 06:31:22,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:31:22,219 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 06:31:22,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:31:22,247 INFO L225 Difference]: With dead ends: 15369 [2019-12-27 06:31:22,248 INFO L226 Difference]: Without dead ends: 15369 [2019-12-27 06:31:22,248 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 06:31:22,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15369 states. [2019-12-27 06:31:22,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15369 to 14435. [2019-12-27 06:31:22,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14435 states. [2019-12-27 06:31:22,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14435 states to 14435 states and 44555 transitions. [2019-12-27 06:31:22,514 INFO L78 Accepts]: Start accepts. Automaton has 14435 states and 44555 transitions. Word has length 65 [2019-12-27 06:31:22,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:31:22,514 INFO L462 AbstractCegarLoop]: Abstraction has 14435 states and 44555 transitions. [2019-12-27 06:31:22,514 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:31:22,514 INFO L276 IsEmpty]: Start isEmpty. Operand 14435 states and 44555 transitions. [2019-12-27 06:31:22,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 06:31:22,530 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:31:22,530 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 06:31:22,530 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:31:22,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:31:22,530 INFO L82 PathProgramCache]: Analyzing trace with hash -665679131, now seen corresponding path program 1 times [2019-12-27 06:31:22,530 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:31:22,531 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968438171] [2019-12-27 06:31:22,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:31:22,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:31:22,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:31:22,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968438171] [2019-12-27 06:31:22,586 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:31:22,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:31:22,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289030841] [2019-12-27 06:31:22,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:31:22,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:31:22,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:31:22,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:31:22,587 INFO L87 Difference]: Start difference. First operand 14435 states and 44555 transitions. Second operand 3 states. [2019-12-27 06:31:22,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:31:22,648 INFO L93 Difference]: Finished difference Result 12651 states and 38448 transitions. [2019-12-27 06:31:22,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:31:22,649 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 06:31:22,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:31:22,673 INFO L225 Difference]: With dead ends: 12651 [2019-12-27 06:31:22,673 INFO L226 Difference]: Without dead ends: 12651 [2019-12-27 06:31:22,673 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 06:31:22,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12651 states. [2019-12-27 06:31:22,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12651 to 12398. [2019-12-27 06:31:22,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12398 states. [2019-12-27 06:31:22,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12398 states to 12398 states and 37729 transitions. [2019-12-27 06:31:22,970 INFO L78 Accepts]: Start accepts. Automaton has 12398 states and 37729 transitions. Word has length 66 [2019-12-27 06:31:22,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:31:22,970 INFO L462 AbstractCegarLoop]: Abstraction has 12398 states and 37729 transitions. [2019-12-27 06:31:22,970 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:31:22,970 INFO L276 IsEmpty]: Start isEmpty. Operand 12398 states and 37729 transitions. [2019-12-27 06:31:22,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 06:31:22,990 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:31:22,991 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 06:31:22,991 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:31:22,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:31:22,991 INFO L82 PathProgramCache]: Analyzing trace with hash -611821270, now seen corresponding path program 1 times [2019-12-27 06:31:22,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:31:22,992 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671266916] [2019-12-27 06:31:22,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:31:23,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:31:23,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:31:23,220 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 06:31:23,220 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 06:31:23,226 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [898] [898] ULTIMATE.startENTRY-->L830: Formula: (let ((.cse0 (store |v_#valid_65| 0 0))) (and (= v_~main$tmp_guard1~0_17 0) (= v_~main$tmp_guard0~0_10 0) (= v_~x~0_11 0) (= 0 v_~a$mem_tmp~0_9) (= v_~a~0_26 0) (= v_~a$r_buff0_thd0~0_20 0) (= 0 v_~a$read_delayed_var~0.base_7) (= 0 v_~__unbuffered_cnt~0_20) (= v_~y~0_14 0) (= v_~a$r_buff0_thd2~0_19 0) (= |v_#NULL.offset_6| 0) (= 0 v_~a$read_delayed~0_7) (= v_~a$read_delayed_var~0.offset_7 0) (= 0 v_~a$r_buff1_thd1~0_19) (= 0 v_~z~0_6) (< 0 |v_#StackHeapBarrier_19|) (= 0 v_~a$r_buff1_thd3~0_52) (= v_~a$r_buff0_thd3~0_77 0) (= v_~a$flush_delayed~0_12 0) (= 0 v_~a$r_buff1_thd0~0_26) (= 0 v_~a$w_buff0~0_23) (= 0 v_~a$w_buff0_used~0_113) (< |v_#StackHeapBarrier_19| |v_ULTIMATE.start_main_~#t1123~0.base_23|) (= 0 |v_#NULL.base_6|) (= 0 v_~weak$$choice2~0_33) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1123~0.base_23|)) (= 0 v_~weak$$choice0~0_7) (= v_~a$r_buff0_thd1~0_28 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1123~0.base_23| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1123~0.base_23|) |v_ULTIMATE.start_main_~#t1123~0.offset_18| 0)) |v_#memory_int_21|) (= v_~__unbuffered_p2_EBX~0_15 0) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t1123~0.base_23| 4)) (= 0 |v_ULTIMATE.start_main_~#t1123~0.offset_18|) (= 0 v_~__unbuffered_p0_EAX~0_17) (= 0 v_~__unbuffered_p2_EAX~0_14) (= |v_#valid_63| (store .cse0 |v_ULTIMATE.start_main_~#t1123~0.base_23| 1)) (= 0 v_~a$r_buff1_thd2~0_21) (= 0 v_~a$w_buff1~0_25) (= 0 v_~a$w_buff1_used~0_76))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_19|, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_21, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_12|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_10|, ULTIMATE.start_main_~#t1124~0.offset=|v_ULTIMATE.start_main_~#t1124~0.offset_15|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_20, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_10|, ~a~0=v_~a~0_26, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_23|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_17, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_14, ULTIMATE.start_main_~#t1124~0.base=|v_ULTIMATE.start_main_~#t1124~0.base_21|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_15, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_9|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_52, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_113, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_28, ULTIMATE.start_main_~#t1123~0.base=|v_ULTIMATE.start_main_~#t1123~0.base_23|, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_19|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_7, ~a$w_buff0~0=v_~a$w_buff0~0_23, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_26, ULTIMATE.start_main_~#t1125~0.offset=|v_ULTIMATE.start_main_~#t1125~0.offset_16|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ~x~0=v_~x~0_11, ~a$read_delayed~0=v_~a$read_delayed~0_7, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_19, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_12|, ~a$mem_tmp~0=v_~a$mem_tmp~0_9, ULTIMATE.start_main_~#t1123~0.offset=|v_ULTIMATE.start_main_~#t1123~0.offset_18|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_10|, ~a$w_buff1~0=v_~a$w_buff1~0_25, ~y~0=v_~y~0_14, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_8|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ULTIMATE.start_main_~#t1125~0.base=|v_ULTIMATE.start_main_~#t1125~0.base_20|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_19, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_77, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, #NULL.base=|v_#NULL.base_6|, ~a$flush_delayed~0=v_~a$flush_delayed~0_12, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_6, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_76, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_7} AuxVars[] AssignedVars[~a$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_~#t1124~0.offset, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite50, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t1124~0.base, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ULTIMATE.start_main_~#t1123~0.base, ~weak$$choice0~0, ~a$read_delayed_var~0.offset, ~a$w_buff0~0, ~a$r_buff1_thd0~0, ULTIMATE.start_main_~#t1125~0.offset, ~__unbuffered_cnt~0, ~x~0, ~a$read_delayed~0, ~a$r_buff0_thd2~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~a$mem_tmp~0, ULTIMATE.start_main_~#t1123~0.offset, ULTIMATE.start_main_#t~ite51, ~a$w_buff1~0, ~y~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ULTIMATE.start_main_~#t1125~0.base, ~a$r_buff1_thd1~0, ~a$r_buff0_thd3~0, ~main$tmp_guard0~0, #NULL.base, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~a$read_delayed_var~0.base] because there is no mapped edge [2019-12-27 06:31:23,230 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [857] [857] L830-1-->L832: Formula: (and (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t1124~0.base_9| 1)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1124~0.base_9| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1124~0.base_9|) |v_ULTIMATE.start_main_~#t1124~0.offset_7| 1)) |v_#memory_int_11|) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t1124~0.base_9|)) (= 0 |v_ULTIMATE.start_main_~#t1124~0.offset_7|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1124~0.base_9| 4)) (not (= |v_ULTIMATE.start_main_~#t1124~0.base_9| 0)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1124~0.base_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t1124~0.offset=|v_ULTIMATE.start_main_~#t1124~0.offset_7|, #length=|v_#length_15|, ULTIMATE.start_main_~#t1124~0.base=|v_ULTIMATE.start_main_~#t1124~0.base_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, ULTIMATE.start_main_~#t1124~0.offset, #length, ULTIMATE.start_main_~#t1124~0.base] because there is no mapped edge [2019-12-27 06:31:23,231 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [856] [856] L832-1-->L834: Formula: (and (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1125~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1125~0.base_9|) |v_ULTIMATE.start_main_~#t1125~0.offset_8| 2))) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1125~0.base_9| 4)) (= |v_#valid_32| (store |v_#valid_33| |v_ULTIMATE.start_main_~#t1125~0.base_9| 1)) (not (= |v_ULTIMATE.start_main_~#t1125~0.base_9| 0)) (= |v_ULTIMATE.start_main_~#t1125~0.offset_8| 0) (= 0 (select |v_#valid_33| |v_ULTIMATE.start_main_~#t1125~0.base_9|)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1125~0.base_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t1125~0.base=|v_ULTIMATE.start_main_~#t1125~0.base_9|, #valid=|v_#valid_32|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_4|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t1125~0.offset=|v_ULTIMATE.start_main_~#t1125~0.offset_8|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1125~0.base, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t1125~0.offset, #length] because there is no mapped edge [2019-12-27 06:31:23,235 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L4-->L748: Formula: (and (= ~a$r_buff0_thd1~0_In1336650894 ~a$r_buff1_thd1~0_Out1336650894) (= ~x~0_In1336650894 ~__unbuffered_p0_EAX~0_Out1336650894) (= ~a$r_buff0_thd2~0_In1336650894 ~a$r_buff1_thd2~0_Out1336650894) (= 1 ~a$r_buff0_thd1~0_Out1336650894) (= ~a$r_buff1_thd3~0_Out1336650894 ~a$r_buff0_thd3~0_In1336650894) (= ~a$r_buff1_thd0~0_Out1336650894 ~a$r_buff0_thd0~0_In1336650894) (not (= 0 P0Thread1of1ForFork1___VERIFIER_assert_~expression_In1336650894))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1336650894, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1336650894, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In1336650894, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1336650894, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1336650894, ~x~0=~x~0_In1336650894} OutVars{~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out1336650894, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_Out1336650894, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_Out1336650894, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_Out1336650894, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_Out1336650894, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1336650894, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1336650894, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In1336650894, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out1336650894, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1336650894, ~x~0=~x~0_In1336650894} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~a$r_buff1_thd1~0, ~a$r_buff1_thd3~0, ~a$r_buff1_thd2~0, ~a$r_buff1_thd0~0, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 06:31:23,244 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L768-2-->L768-5: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff1_used~0_In78047624 256))) (.cse0 (= 0 (mod ~a$r_buff1_thd2~0_In78047624 256))) (.cse2 (= |P1Thread1of1ForFork2_#t~ite10_Out78047624| |P1Thread1of1ForFork2_#t~ite9_Out78047624|))) (or (and (or .cse0 .cse1) .cse2 (= |P1Thread1of1ForFork2_#t~ite9_Out78047624| ~a~0_In78047624)) (and (= ~a$w_buff1~0_In78047624 |P1Thread1of1ForFork2_#t~ite9_Out78047624|) (not .cse1) (not .cse0) .cse2))) InVars {~a~0=~a~0_In78047624, ~a$w_buff1~0=~a$w_buff1~0_In78047624, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In78047624, ~a$w_buff1_used~0=~a$w_buff1_used~0_In78047624} OutVars{~a~0=~a~0_In78047624, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out78047624|, ~a$w_buff1~0=~a$w_buff1~0_In78047624, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In78047624, P1Thread1of1ForFork2_#t~ite10=|P1Thread1of1ForFork2_#t~ite10_Out78047624|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In78047624} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-27 06:31:23,250 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [876] [876] L796-->L796-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-409057719 256) 0))) (or (and (let ((.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In-409057719 256)))) (or (= 0 (mod ~a$w_buff0_used~0_In-409057719 256)) (and (= (mod ~a$r_buff1_thd3~0_In-409057719 256) 0) .cse0) (and .cse0 (= (mod ~a$w_buff1_used~0_In-409057719 256) 0)))) .cse1 (= |P2Thread1of1ForFork0_#t~ite20_Out-409057719| |P2Thread1of1ForFork0_#t~ite21_Out-409057719|) (= ~a$w_buff0~0_In-409057719 |P2Thread1of1ForFork0_#t~ite20_Out-409057719|)) (and (not .cse1) (= |P2Thread1of1ForFork0_#t~ite20_In-409057719| |P2Thread1of1ForFork0_#t~ite20_Out-409057719|) (= ~a$w_buff0~0_In-409057719 |P2Thread1of1ForFork0_#t~ite21_Out-409057719|)))) InVars {~a$w_buff0~0=~a$w_buff0~0_In-409057719, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-409057719, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-409057719, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-409057719, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-409057719, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In-409057719|, ~weak$$choice2~0=~weak$$choice2~0_In-409057719} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out-409057719|, ~a$w_buff0~0=~a$w_buff0~0_In-409057719, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-409057719, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-409057719, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-409057719, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out-409057719|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-409057719, ~weak$$choice2~0=~weak$$choice2~0_In-409057719} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-27 06:31:23,252 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L769-->L769-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd2~0_In-163006030 256) 0)) (.cse0 (= (mod ~a$w_buff0_used~0_In-163006030 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite11_Out-163006030| ~a$w_buff0_used~0_In-163006030)) (and (= |P1Thread1of1ForFork2_#t~ite11_Out-163006030| 0) (not .cse1) (not .cse0)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-163006030, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-163006030} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-163006030, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-163006030, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-163006030|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 06:31:23,255 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L770-->L770-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff1_used~0_In-1375469586 256))) (.cse0 (= 0 (mod ~a$r_buff1_thd2~0_In-1375469586 256))) (.cse3 (= 0 (mod ~a$r_buff0_thd2~0_In-1375469586 256))) (.cse2 (= (mod ~a$w_buff0_used~0_In-1375469586 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork2_#t~ite12_Out-1375469586|)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~a$w_buff1_used~0_In-1375469586 |P1Thread1of1ForFork2_#t~ite12_Out-1375469586|)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1375469586, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1375469586, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1375469586, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1375469586} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1375469586, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1375469586, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1375469586, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-1375469586|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1375469586} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-27 06:31:23,256 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L797-->L797-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1852417697 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite23_In-1852417697| |P2Thread1of1ForFork0_#t~ite23_Out-1852417697|) (not .cse0) (= ~a$w_buff1~0_In-1852417697 |P2Thread1of1ForFork0_#t~ite24_Out-1852417697|)) (and (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In-1852417697 256) 0))) (or (and (= (mod ~a$w_buff1_used~0_In-1852417697 256) 0) .cse1) (and .cse1 (= (mod ~a$r_buff1_thd3~0_In-1852417697 256) 0)) (= 0 (mod ~a$w_buff0_used~0_In-1852417697 256)))) (= ~a$w_buff1~0_In-1852417697 |P2Thread1of1ForFork0_#t~ite23_Out-1852417697|) .cse0 (= |P2Thread1of1ForFork0_#t~ite24_Out-1852417697| |P2Thread1of1ForFork0_#t~ite23_Out-1852417697|)))) InVars {~a$w_buff1~0=~a$w_buff1~0_In-1852417697, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_In-1852417697|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1852417697, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1852417697, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1852417697, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1852417697, ~weak$$choice2~0=~weak$$choice2~0_In-1852417697} OutVars{~a$w_buff1~0=~a$w_buff1~0_In-1852417697, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_Out-1852417697|, P2Thread1of1ForFork0_#t~ite24=|P2Thread1of1ForFork0_#t~ite24_Out-1852417697|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1852417697, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1852417697, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1852417697, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1852417697, ~weak$$choice2~0=~weak$$choice2~0_In-1852417697} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24] because there is no mapped edge [2019-12-27 06:31:23,258 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L798-->L798-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-426927550 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite27_Out-426927550| ~a$w_buff0_used~0_In-426927550) (= |P2Thread1of1ForFork0_#t~ite26_In-426927550| |P2Thread1of1ForFork0_#t~ite26_Out-426927550|) (not .cse0)) (and (= |P2Thread1of1ForFork0_#t~ite27_Out-426927550| |P2Thread1of1ForFork0_#t~ite26_Out-426927550|) (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In-426927550 256)))) (or (and (= 0 (mod ~a$r_buff1_thd3~0_In-426927550 256)) .cse1) (and (= (mod ~a$w_buff1_used~0_In-426927550 256) 0) .cse1) (= (mod ~a$w_buff0_used~0_In-426927550 256) 0))) .cse0 (= ~a$w_buff0_used~0_In-426927550 |P2Thread1of1ForFork0_#t~ite26_Out-426927550|)))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In-426927550|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-426927550, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-426927550, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-426927550, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-426927550, ~weak$$choice2~0=~weak$$choice2~0_In-426927550} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out-426927550|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out-426927550|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-426927550, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-426927550, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-426927550, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-426927550, ~weak$$choice2~0=~weak$$choice2~0_In-426927550} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-27 06:31:23,263 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L771-->L771-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In2051965878 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In2051965878 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork2_#t~ite13_Out2051965878|) (not .cse1)) (and (or .cse1 .cse0) (= ~a$r_buff0_thd2~0_In2051965878 |P1Thread1of1ForFork2_#t~ite13_Out2051965878|)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In2051965878, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2051965878} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In2051965878, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2051965878, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out2051965878|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-27 06:31:23,266 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L772-->L772-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In-10047098 256))) (.cse0 (= (mod ~a$r_buff0_thd2~0_In-10047098 256) 0)) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In-10047098 256))) (.cse3 (= 0 (mod ~a$r_buff1_thd2~0_In-10047098 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite14_Out-10047098| 0)) (and (= |P1Thread1of1ForFork2_#t~ite14_Out-10047098| ~a$r_buff1_thd2~0_In-10047098) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-10047098, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-10047098, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-10047098, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-10047098} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-10047098, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-10047098, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-10047098, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-10047098, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-10047098|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 06:31:23,266 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] L772-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= |v_P1Thread1of1ForFork2_#t~ite14_8| v_~a$r_buff1_thd2~0_17) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_8|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_17, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_7|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 06:31:23,269 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L800-->L801: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_16 256))) (= v_~a$r_buff0_thd3~0_51 v_~a$r_buff0_thd3~0_50)) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_51, ~weak$$choice2~0=v_~weak$$choice2~0_16} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_9|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_9|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_50, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_8|, ~weak$$choice2~0=v_~weak$$choice2~0_16} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 06:31:23,277 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L803-->L807: Formula: (and (not (= 0 (mod v_~a$flush_delayed~0_8 256))) (= v_~a~0_19 v_~a$mem_tmp~0_5) (= v_~a$flush_delayed~0_7 0)) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_8} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~a~0=v_~a~0_19, ~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_7} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~a~0, ~a$flush_delayed~0] because there is no mapped edge [2019-12-27 06:31:23,280 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L807-2-->L807-4: Formula: (let ((.cse1 (= (mod ~a$w_buff1_used~0_In2132999972 256) 0)) (.cse0 (= 0 (mod ~a$r_buff1_thd3~0_In2132999972 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite38_Out2132999972| ~a$w_buff1~0_In2132999972) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork0_#t~ite38_Out2132999972| ~a~0_In2132999972)))) InVars {~a~0=~a~0_In2132999972, ~a$w_buff1~0=~a$w_buff1~0_In2132999972, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In2132999972, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2132999972} OutVars{~a~0=~a~0_In2132999972, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out2132999972|, ~a$w_buff1~0=~a$w_buff1~0_In2132999972, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In2132999972, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2132999972} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 06:31:23,280 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L807-4-->L808: Formula: (= v_~a~0_16 |v_P2Thread1of1ForFork0_#t~ite38_8|) InVars {P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_8|} OutVars{~a~0=v_~a~0_16, P2Thread1of1ForFork0_#t~ite39=|v_P2Thread1of1ForFork0_#t~ite39_7|, P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_7|} AuxVars[] AssignedVars[~a~0, P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 06:31:23,280 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L808-->L808-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In532248011 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In532248011 256)))) (or (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In532248011 |P2Thread1of1ForFork0_#t~ite40_Out532248011|)) (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite40_Out532248011|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In532248011, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In532248011} OutVars{P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out532248011|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In532248011, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In532248011} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-27 06:31:23,280 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L749-->L749-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd1~0_In-743713768 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-743713768 256)))) (or (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork1_#t~ite5_Out-743713768| 0)) (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In-743713768 |P0Thread1of1ForFork1_#t~ite5_Out-743713768|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-743713768, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-743713768} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-743713768|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-743713768, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-743713768} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-27 06:31:23,283 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L750-->L750-2: Formula: (let ((.cse3 (= 0 (mod ~a$w_buff1_used~0_In-1150020036 256))) (.cse2 (= (mod ~a$r_buff1_thd1~0_In-1150020036 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-1150020036 256))) (.cse1 (= (mod ~a$r_buff0_thd1~0_In-1150020036 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork1_#t~ite6_Out-1150020036|)) (and (= |P0Thread1of1ForFork1_#t~ite6_Out-1150020036| ~a$w_buff1_used~0_In-1150020036) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1150020036, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1150020036, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1150020036, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1150020036} OutVars{P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-1150020036|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1150020036, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1150020036, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1150020036, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1150020036} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 06:31:23,286 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L751-->L752: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd1~0_In987512193 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In987512193 256)))) (or (and (or .cse0 .cse1) (= ~a$r_buff0_thd1~0_Out987512193 ~a$r_buff0_thd1~0_In987512193)) (and (not .cse0) (not .cse1) (= ~a$r_buff0_thd1~0_Out987512193 0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In987512193, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In987512193} OutVars{P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out987512193|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In987512193, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out987512193} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 06:31:23,286 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L752-->L752-2: Formula: (let ((.cse0 (= (mod ~a$w_buff1_used~0_In81526071 256) 0)) (.cse1 (= (mod ~a$r_buff1_thd1~0_In81526071 256) 0)) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In81526071 256))) (.cse2 (= (mod ~a$r_buff0_thd1~0_In81526071 256) 0))) (or (and (= |P0Thread1of1ForFork1_#t~ite8_Out81526071| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~a$r_buff1_thd1~0_In81526071 |P0Thread1of1ForFork1_#t~ite8_Out81526071|) (or .cse3 .cse2)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In81526071, ~a$w_buff0_used~0=~a$w_buff0_used~0_In81526071, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In81526071, ~a$w_buff1_used~0=~a$w_buff1_used~0_In81526071} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out81526071|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In81526071, ~a$w_buff0_used~0=~a$w_buff0_used~0_In81526071, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In81526071, ~a$w_buff1_used~0=~a$w_buff1_used~0_In81526071} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 06:31:23,286 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [865] [865] L752-2-->P0EXIT: Formula: (and (= v_~a$r_buff1_thd1~0_15 |v_P0Thread1of1ForFork1_#t~ite8_8|) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_7|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_15, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~a$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 06:31:23,289 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L809-->L809-2: Formula: (let ((.cse3 (= 0 (mod ~a$w_buff1_used~0_In978354248 256))) (.cse2 (= 0 (mod ~a$r_buff1_thd3~0_In978354248 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In978354248 256) 0)) (.cse1 (= (mod ~a$r_buff0_thd3~0_In978354248 256) 0))) (or (and (= ~a$w_buff1_used~0_In978354248 |P2Thread1of1ForFork0_#t~ite41_Out978354248|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork0_#t~ite41_Out978354248|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In978354248, ~a$w_buff0_used~0=~a$w_buff0_used~0_In978354248, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In978354248, ~a$w_buff1_used~0=~a$w_buff1_used~0_In978354248} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In978354248, ~a$w_buff0_used~0=~a$w_buff0_used~0_In978354248, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In978354248, ~a$w_buff1_used~0=~a$w_buff1_used~0_In978354248, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out978354248|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-27 06:31:23,292 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L810-->L810-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In977938329 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In977938329 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite42_Out977938329| ~a$r_buff0_thd3~0_In977938329)) (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite42_Out977938329| 0) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In977938329, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In977938329} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In977938329, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In977938329, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out977938329|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 06:31:23,295 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L811-->L811-2: Formula: (let ((.cse2 (= 0 (mod ~a$w_buff0_used~0_In1472771639 256))) (.cse3 (= 0 (mod ~a$r_buff0_thd3~0_In1472771639 256))) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In1472771639 256))) (.cse0 (= 0 (mod ~a$r_buff1_thd3~0_In1472771639 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork0_#t~ite43_Out1472771639|)) (and (= ~a$r_buff1_thd3~0_In1472771639 |P2Thread1of1ForFork0_#t~ite43_Out1472771639|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1472771639, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1472771639, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1472771639, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1472771639} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out1472771639|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1472771639, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1472771639, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1472771639, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1472771639} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-27 06:31:23,296 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L811-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~a$r_buff1_thd3~0_43 |v_P2Thread1of1ForFork0_#t~ite43_8|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_7|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_43, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~a$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 06:31:23,296 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [806] [806] L834-1-->L840: Formula: (and (= 3 v_~__unbuffered_cnt~0_10) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 06:31:23,299 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L840-2-->L840-5: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff1_used~0_In776998983 256))) (.cse0 (= (mod ~a$r_buff1_thd0~0_In776998983 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite48_Out776998983| |ULTIMATE.start_main_#t~ite47_Out776998983|))) (or (and (= ~a$w_buff1~0_In776998983 |ULTIMATE.start_main_#t~ite47_Out776998983|) (not .cse0) (not .cse1) .cse2) (and (= ~a~0_In776998983 |ULTIMATE.start_main_#t~ite47_Out776998983|) (or .cse1 .cse0) .cse2))) InVars {~a~0=~a~0_In776998983, ~a$w_buff1~0=~a$w_buff1~0_In776998983, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In776998983, ~a$w_buff1_used~0=~a$w_buff1_used~0_In776998983} OutVars{~a~0=~a~0_In776998983, ~a$w_buff1~0=~a$w_buff1~0_In776998983, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out776998983|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In776998983, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out776998983|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In776998983} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 06:31:23,302 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L841-->L841-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In472188493 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In472188493 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite49_Out472188493| 0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite49_Out472188493| ~a$w_buff0_used~0_In472188493)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In472188493, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In472188493} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In472188493, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out472188493|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In472188493} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 06:31:23,305 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L842-->L842-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff1_used~0_In711149683 256))) (.cse0 (= 0 (mod ~a$r_buff1_thd0~0_In711149683 256))) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In711149683 256))) (.cse3 (= (mod ~a$r_buff0_thd0~0_In711149683 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite50_Out711149683|)) (and (= ~a$w_buff1_used~0_In711149683 |ULTIMATE.start_main_#t~ite50_Out711149683|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In711149683, ~a$w_buff0_used~0=~a$w_buff0_used~0_In711149683, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In711149683, ~a$w_buff1_used~0=~a$w_buff1_used~0_In711149683} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out711149683|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In711149683, ~a$w_buff0_used~0=~a$w_buff0_used~0_In711149683, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In711149683, ~a$w_buff1_used~0=~a$w_buff1_used~0_In711149683} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 06:31:23,308 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L843-->L843-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd0~0_In-1089195968 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-1089195968 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite51_Out-1089195968|)) (and (or .cse1 .cse0) (= ~a$r_buff0_thd0~0_In-1089195968 |ULTIMATE.start_main_#t~ite51_Out-1089195968|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1089195968, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1089195968} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-1089195968|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1089195968, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1089195968} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 06:31:23,310 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L844-->L844-2: Formula: (let ((.cse3 (= (mod ~a$w_buff0_used~0_In-1492643992 256) 0)) (.cse2 (= 0 (mod ~a$r_buff0_thd0~0_In-1492643992 256))) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In-1492643992 256))) (.cse0 (= 0 (mod ~a$r_buff1_thd0~0_In-1492643992 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite52_Out-1492643992|)) (and (= ~a$r_buff1_thd0~0_In-1492643992 |ULTIMATE.start_main_#t~ite52_Out-1492643992|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1492643992, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1492643992, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1492643992, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1492643992} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-1492643992|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1492643992, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1492643992, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1492643992, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1492643992} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 06:31:23,311 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L844-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p2_EAX~0_8 1) (= v_~main$tmp_guard1~0_10 0) (= 2 v_~y~0_8) (= v_~__unbuffered_p2_EBX~0_9 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= |v_ULTIMATE.start_main_#t~ite52_12| v_~a$r_buff1_thd0~0_20) (= 0 v_~__unbuffered_p0_EAX~0_10) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_10, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_12|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~y~0=v_~y~0_8} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_10, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_11|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_9, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_20, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~y~0=v_~y~0_8, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 06:31:23,468 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 06:31:23 BasicIcfg [2019-12-27 06:31:23,468 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 06:31:23,473 INFO L168 Benchmark]: Toolchain (without parser) took 85339.29 ms. Allocated memory was 137.4 MB in the beginning and 2.7 GB in the end (delta: 2.6 GB). Free memory was 100.3 MB in the beginning and 1.1 GB in the end (delta: -988.1 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-27 06:31:23,477 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 137.4 MB. Free memory was 120.6 MB in the beginning and 120.3 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-27 06:31:23,478 INFO L168 Benchmark]: CACSL2BoogieTranslator took 797.76 ms. Allocated memory was 137.4 MB in the beginning and 201.3 MB in the end (delta: 64.0 MB). Free memory was 99.8 MB in the beginning and 152.6 MB in the end (delta: -52.7 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. [2019-12-27 06:31:23,478 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.31 ms. Allocated memory is still 201.3 MB. Free memory was 152.6 MB in the beginning and 149.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 06:31:23,479 INFO L168 Benchmark]: Boogie Preprocessor took 39.32 ms. Allocated memory is still 201.3 MB. Free memory was 149.8 MB in the beginning and 147.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 06:31:23,479 INFO L168 Benchmark]: RCFGBuilder took 811.54 ms. Allocated memory is still 201.3 MB. Free memory was 147.8 MB in the beginning and 97.3 MB in the end (delta: 50.5 MB). Peak memory consumption was 50.5 MB. Max. memory is 7.1 GB. [2019-12-27 06:31:23,480 INFO L168 Benchmark]: TraceAbstraction took 83626.03 ms. Allocated memory was 201.3 MB in the beginning and 2.7 GB in the end (delta: 2.5 GB). Free memory was 96.7 MB in the beginning and 1.1 GB in the end (delta: -991.7 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-12-27 06:31:23,487 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 137.4 MB. Free memory was 120.6 MB in the beginning and 120.3 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 797.76 ms. Allocated memory was 137.4 MB in the beginning and 201.3 MB in the end (delta: 64.0 MB). Free memory was 99.8 MB in the beginning and 152.6 MB in the end (delta: -52.7 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 56.31 ms. Allocated memory is still 201.3 MB. Free memory was 152.6 MB in the beginning and 149.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.32 ms. Allocated memory is still 201.3 MB. Free memory was 149.8 MB in the beginning and 147.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 811.54 ms. Allocated memory is still 201.3 MB. Free memory was 147.8 MB in the beginning and 97.3 MB in the end (delta: 50.5 MB). Peak memory consumption was 50.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 83626.03 ms. Allocated memory was 201.3 MB in the beginning and 2.7 GB in the end (delta: 2.5 GB). Free memory was 96.7 MB in the beginning and 1.1 GB in the end (delta: -991.7 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.0s, 177 ProgramPointsBefore, 93 ProgramPointsAfterwards, 214 TransitionsBefore, 102 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 34 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 32 ChoiceCompositions, 7189 VarBasedMoverChecksPositive, 222 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 80962 CheckedPairsTotal, 114 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L830] FCALL, FORK 0 pthread_create(&t1123, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L733] 1 a$w_buff1 = a$w_buff0 [L734] 1 a$w_buff0 = 1 [L735] 1 a$w_buff1_used = a$w_buff0_used [L736] 1 a$w_buff0_used = (_Bool)1 [L832] FCALL, FORK 0 pthread_create(&t1124, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L834] FCALL, FORK 0 pthread_create(&t1125, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L762] 2 x = 1 [L765] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, z=0] [L768] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, z=0] [L782] 3 y = 2 [L785] 3 z = 1 [L788] 3 __unbuffered_p2_EAX = z [L791] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L792] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L793] 3 a$flush_delayed = weak$$choice2 [L794] 3 a$mem_tmp = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=2, z=1] [L795] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=2, z=1] [L768] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L795] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L796] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L769] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L797] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L798] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L799] EXPR 3 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=2, z=1] [L799] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L770] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L771] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L748] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=2, z=1] [L801] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=2, z=1] [L801] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L802] 3 __unbuffered_p2_EBX = a VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=2, z=1] [L748] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L807] 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=2, z=1] [L749] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L750] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L808] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L809] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L810] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L840] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=2, z=1] [L840] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L841] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L842] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L843] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 168 locations, 2 error locations. Result: UNSAFE, OverallTime: 83.1s, OverallIterations: 30, TraceHistogramMax: 1, AutomataDifference: 26.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6345 SDtfs, 9796 SDslu, 16016 SDs, 0 SdLazy, 9122 SolverSat, 519 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 327 GetRequests, 48 SyntacticMatches, 8 SemanticMatches, 271 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1090 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=141665occurred 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: 32.9s AutomataMinimizationTime, 29 MinimizatonAttempts, 266770 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 1274 NumberOfCodeBlocks, 1274 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 1178 ConstructedInterpolants, 0 QuantifiedInterpolants, 199391 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 29 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...