/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix056_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 17:54:39,856 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 17:54:39,858 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 17:54:39,870 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 17:54:39,870 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 17:54:39,871 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 17:54:39,873 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 17:54:39,875 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 17:54:39,876 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 17:54:39,877 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 17:54:39,878 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 17:54:39,879 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 17:54:39,879 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 17:54:39,880 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 17:54:39,881 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 17:54:39,882 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 17:54:39,883 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 17:54:39,884 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 17:54:39,886 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 17:54:39,888 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 17:54:39,889 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 17:54:39,890 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 17:54:39,891 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 17:54:39,892 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 17:54:39,894 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 17:54:39,894 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 17:54:39,894 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 17:54:39,895 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 17:54:39,896 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 17:54:39,897 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 17:54:39,897 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 17:54:39,897 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 17:54:39,898 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 17:54:39,899 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 17:54:39,900 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 17:54:39,900 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 17:54:39,901 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 17:54:39,901 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 17:54:39,901 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 17:54:39,902 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 17:54:39,903 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 17:54:39,904 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-18 17:54:39,918 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 17:54:39,920 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 17:54:39,922 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 17:54:39,922 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 17:54:39,922 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 17:54:39,922 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 17:54:39,922 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 17:54:39,923 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 17:54:39,923 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 17:54:39,923 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 17:54:39,923 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 17:54:39,924 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 17:54:39,924 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 17:54:39,924 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 17:54:39,924 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 17:54:39,924 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 17:54:39,924 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 17:54:39,925 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 17:54:39,925 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 17:54:39,925 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 17:54:39,925 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 17:54:39,925 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 17:54:39,926 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 17:54:39,926 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 17:54:39,926 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 17:54:39,926 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 17:54:39,926 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 17:54:39,927 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 17:54:39,927 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 17:54:40,197 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 17:54:40,210 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 17:54:40,213 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 17:54:40,215 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 17:54:40,215 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 17:54:40,216 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix056_power.oepc.i [2019-12-18 17:54:40,294 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/096e82de2/94725f88d56f43639d6a9d2fe936a5ff/FLAG92fb180b2 [2019-12-18 17:54:40,902 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 17:54:40,902 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix056_power.oepc.i [2019-12-18 17:54:40,916 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/096e82de2/94725f88d56f43639d6a9d2fe936a5ff/FLAG92fb180b2 [2019-12-18 17:54:41,097 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/096e82de2/94725f88d56f43639d6a9d2fe936a5ff [2019-12-18 17:54:41,106 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 17:54:41,108 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 17:54:41,109 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 17:54:41,109 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 17:54:41,112 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 17:54:41,114 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 05:54:41" (1/1) ... [2019-12-18 17:54:41,116 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20f0f0d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:54:41, skipping insertion in model container [2019-12-18 17:54:41,117 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 05:54:41" (1/1) ... [2019-12-18 17:54:41,124 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 17:54:41,177 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 17:54:41,774 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 17:54:41,786 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 17:54:41,884 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 17:54:41,963 INFO L208 MainTranslator]: Completed translation [2019-12-18 17:54:41,964 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:54:41 WrapperNode [2019-12-18 17:54:41,964 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 17:54:41,965 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 17:54:41,965 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 17:54:41,965 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 17:54:41,974 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:54:41" (1/1) ... [2019-12-18 17:54:42,004 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:54:41" (1/1) ... [2019-12-18 17:54:42,034 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 17:54:42,034 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 17:54:42,034 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 17:54:42,034 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 17:54:42,045 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:54:41" (1/1) ... [2019-12-18 17:54:42,045 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:54:41" (1/1) ... [2019-12-18 17:54:42,050 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:54:41" (1/1) ... [2019-12-18 17:54:42,050 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:54:41" (1/1) ... [2019-12-18 17:54:42,064 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:54:41" (1/1) ... [2019-12-18 17:54:42,069 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:54:41" (1/1) ... [2019-12-18 17:54:42,073 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:54:41" (1/1) ... [2019-12-18 17:54:42,079 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 17:54:42,080 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 17:54:42,080 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 17:54:42,080 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 17:54:42,081 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:54:41" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 17:54:42,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 17:54:42,162 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 17:54:42,162 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 17:54:42,162 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 17:54:42,163 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 17:54:42,163 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 17:54:42,163 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 17:54:42,163 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 17:54:42,164 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 17:54:42,164 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 17:54:42,164 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 17:54:42,164 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 17:54:42,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 17:54:42,167 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 17:54:43,008 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 17:54:43,008 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 17:54:43,010 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 05:54:43 BoogieIcfgContainer [2019-12-18 17:54:43,011 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 17:54:43,013 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 17:54:43,013 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 17:54:43,017 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 17:54:43,017 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 05:54:41" (1/3) ... [2019-12-18 17:54:43,018 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76af996 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 05:54:43, skipping insertion in model container [2019-12-18 17:54:43,020 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:54:41" (2/3) ... [2019-12-18 17:54:43,021 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76af996 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 05:54:43, skipping insertion in model container [2019-12-18 17:54:43,021 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 05:54:43" (3/3) ... [2019-12-18 17:54:43,024 INFO L109 eAbstractionObserver]: Analyzing ICFG mix056_power.oepc.i [2019-12-18 17:54:43,035 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 17:54:43,036 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 17:54:43,049 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 17:54:43,050 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 17:54:43,091 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,092 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,092 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,092 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,093 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,093 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,093 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,094 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,094 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,094 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,095 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,095 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,095 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,095 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,099 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,099 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,100 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,100 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,100 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,100 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,104 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,104 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,105 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,106 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,106 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,106 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,107 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,107 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,107 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,107 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,108 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,108 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,108 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,108 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,110 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,110 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,138 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,138 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,138 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,138 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,138 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,139 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,139 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,139 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,139 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,139 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,140 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,140 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,140 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,140 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,140 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,141 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,141 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,141 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,141 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,141 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,142 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,142 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,142 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,142 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,142 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,143 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,143 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,143 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,143 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,143 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,147 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,147 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,147 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,147 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,148 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,148 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,148 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,148 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,148 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,149 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,149 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,149 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,149 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,149 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,151 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,151 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,151 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,151 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,151 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,152 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,152 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,152 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,152 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,152 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,153 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,153 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,153 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,153 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,153 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,154 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,154 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,154 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,154 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,154 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,155 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,155 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,155 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,155 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,155 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,155 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,156 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,156 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,156 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,156 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,156 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,157 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,157 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,157 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,157 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,157 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,165 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,165 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,165 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,165 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,165 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,166 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,166 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,166 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,166 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,166 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,167 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,167 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,169 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,170 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,170 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,170 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,170 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,171 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,171 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,171 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,171 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,171 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,173 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,173 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,174 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,174 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,174 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,174 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,174 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,175 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,175 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,175 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,175 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,175 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,176 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,176 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,176 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,176 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,176 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,176 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,177 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,177 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,177 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,177 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,177 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,178 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,178 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,178 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,178 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,178 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,179 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,179 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,179 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,179 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,180 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:43,197 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 17:54:43,223 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 17:54:43,224 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 17:54:43,224 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 17:54:43,224 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 17:54:43,224 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 17:54:43,224 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 17:54:43,224 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 17:54:43,225 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 17:54:43,244 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 174 places, 211 transitions [2019-12-18 17:54:43,246 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-18 17:54:43,344 INFO L126 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-18 17:54:43,345 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 17:54:43,371 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 430 event pairs. 9/168 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 17:54:43,400 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-18 17:54:43,473 INFO L126 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-18 17:54:43,474 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 17:54:43,483 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 430 event pairs. 9/168 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 17:54:43,504 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-18 17:54:43,506 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 17:54:49,204 WARN L192 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-18 17:54:49,332 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-18 17:54:49,354 INFO L206 etLargeBlockEncoding]: Checked pairs total: 77200 [2019-12-18 17:54:49,354 INFO L214 etLargeBlockEncoding]: Total number of compositions: 114 [2019-12-18 17:54:49,357 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 92 places, 102 transitions [2019-12-18 17:55:04,038 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 102314 states. [2019-12-18 17:55:04,040 INFO L276 IsEmpty]: Start isEmpty. Operand 102314 states. [2019-12-18 17:55:04,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 17:55:04,046 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:55:04,047 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 17:55:04,047 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-18 17:55:04,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:55:04,054 INFO L82 PathProgramCache]: Analyzing trace with hash 909908, now seen corresponding path program 1 times [2019-12-18 17:55:04,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:55:04,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158715225] [2019-12-18 17:55:04,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:55:04,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:55:04,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:55:04,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158715225] [2019-12-18 17:55:04,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:55:04,283 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 17:55:04,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402972216] [2019-12-18 17:55:04,292 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:55:04,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:55:04,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:55:04,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:55:04,310 INFO L87 Difference]: Start difference. First operand 102314 states. Second operand 3 states. [2019-12-18 17:55:05,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:55:05,667 INFO L93 Difference]: Finished difference Result 101472 states and 432734 transitions. [2019-12-18 17:55:05,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:55:05,669 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 17:55:05,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:55:08,821 INFO L225 Difference]: With dead ends: 101472 [2019-12-18 17:55:08,821 INFO L226 Difference]: Without dead ends: 95232 [2019-12-18 17:55:08,823 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:55:12,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95232 states. [2019-12-18 17:55:14,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95232 to 95232. [2019-12-18 17:55:14,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95232 states. [2019-12-18 17:55:15,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95232 states to 95232 states and 405538 transitions. [2019-12-18 17:55:15,246 INFO L78 Accepts]: Start accepts. Automaton has 95232 states and 405538 transitions. Word has length 3 [2019-12-18 17:55:15,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:55:15,246 INFO L462 AbstractCegarLoop]: Abstraction has 95232 states and 405538 transitions. [2019-12-18 17:55:15,246 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:55:15,247 INFO L276 IsEmpty]: Start isEmpty. Operand 95232 states and 405538 transitions. [2019-12-18 17:55:15,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 17:55:15,251 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:55:15,251 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:55:15,251 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-18 17:55:15,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:55:15,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1729820714, now seen corresponding path program 1 times [2019-12-18 17:55:15,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:55:15,252 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110081352] [2019-12-18 17:55:15,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:55:15,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:55:15,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:55:15,388 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110081352] [2019-12-18 17:55:15,388 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:55:15,388 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:55:15,389 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348621783] [2019-12-18 17:55:15,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:55:15,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:55:15,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:55:15,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:55:15,391 INFO L87 Difference]: Start difference. First operand 95232 states and 405538 transitions. Second operand 4 states. [2019-12-18 17:55:19,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:55:19,551 INFO L93 Difference]: Finished difference Result 151692 states and 619304 transitions. [2019-12-18 17:55:19,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:55:19,551 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 17:55:19,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:55:20,792 INFO L225 Difference]: With dead ends: 151692 [2019-12-18 17:55:20,792 INFO L226 Difference]: Without dead ends: 151643 [2019-12-18 17:55:20,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:55:24,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151643 states. [2019-12-18 17:55:31,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151643 to 138429. [2019-12-18 17:55:31,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138429 states. [2019-12-18 17:55:31,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138429 states to 138429 states and 572602 transitions. [2019-12-18 17:55:31,820 INFO L78 Accepts]: Start accepts. Automaton has 138429 states and 572602 transitions. Word has length 11 [2019-12-18 17:55:31,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:55:31,821 INFO L462 AbstractCegarLoop]: Abstraction has 138429 states and 572602 transitions. [2019-12-18 17:55:31,821 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:55:31,821 INFO L276 IsEmpty]: Start isEmpty. Operand 138429 states and 572602 transitions. [2019-12-18 17:55:31,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 17:55:31,827 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:55:31,828 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:55:31,828 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-18 17:55:31,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:55:31,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1791451612, now seen corresponding path program 1 times [2019-12-18 17:55:31,829 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:55:31,829 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153644809] [2019-12-18 17:55:31,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:55:31,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:55:31,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:55:31,887 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153644809] [2019-12-18 17:55:31,887 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:55:31,887 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:55:31,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256564801] [2019-12-18 17:55:31,888 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:55:31,888 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:55:31,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:55:31,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:55:31,889 INFO L87 Difference]: Start difference. First operand 138429 states and 572602 transitions. Second operand 3 states. [2019-12-18 17:55:32,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:55:32,008 INFO L93 Difference]: Finished difference Result 30955 states and 100617 transitions. [2019-12-18 17:55:32,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:55:32,009 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 17:55:32,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:55:32,063 INFO L225 Difference]: With dead ends: 30955 [2019-12-18 17:55:32,064 INFO L226 Difference]: Without dead ends: 30955 [2019-12-18 17:55:32,064 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:55:32,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30955 states. [2019-12-18 17:55:36,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30955 to 30955. [2019-12-18 17:55:36,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30955 states. [2019-12-18 17:55:36,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30955 states to 30955 states and 100617 transitions. [2019-12-18 17:55:36,859 INFO L78 Accepts]: Start accepts. Automaton has 30955 states and 100617 transitions. Word has length 13 [2019-12-18 17:55:36,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:55:36,860 INFO L462 AbstractCegarLoop]: Abstraction has 30955 states and 100617 transitions. [2019-12-18 17:55:36,860 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:55:36,860 INFO L276 IsEmpty]: Start isEmpty. Operand 30955 states and 100617 transitions. [2019-12-18 17:55:36,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 17:55:36,862 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:55:36,862 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:55:36,862 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-18 17:55:36,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:55:36,863 INFO L82 PathProgramCache]: Analyzing trace with hash -137996123, now seen corresponding path program 1 times [2019-12-18 17:55:36,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:55:36,863 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174538430] [2019-12-18 17:55:36,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:55:36,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:55:36,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:55:36,921 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174538430] [2019-12-18 17:55:36,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:55:36,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:55:36,922 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365230692] [2019-12-18 17:55:36,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:55:36,922 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:55:36,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:55:36,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:55:36,923 INFO L87 Difference]: Start difference. First operand 30955 states and 100617 transitions. Second operand 3 states. [2019-12-18 17:55:37,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:55:37,145 INFO L93 Difference]: Finished difference Result 47061 states and 152507 transitions. [2019-12-18 17:55:37,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:55:37,146 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-18 17:55:37,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:55:37,255 INFO L225 Difference]: With dead ends: 47061 [2019-12-18 17:55:37,255 INFO L226 Difference]: Without dead ends: 47061 [2019-12-18 17:55:37,256 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:55:37,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47061 states. [2019-12-18 17:55:38,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47061 to 33925. [2019-12-18 17:55:38,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33925 states. [2019-12-18 17:55:38,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33925 states to 33925 states and 111057 transitions. [2019-12-18 17:55:38,305 INFO L78 Accepts]: Start accepts. Automaton has 33925 states and 111057 transitions. Word has length 16 [2019-12-18 17:55:38,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:55:38,307 INFO L462 AbstractCegarLoop]: Abstraction has 33925 states and 111057 transitions. [2019-12-18 17:55:38,307 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:55:38,307 INFO L276 IsEmpty]: Start isEmpty. Operand 33925 states and 111057 transitions. [2019-12-18 17:55:38,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 17:55:38,309 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:55:38,310 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:55:38,310 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-18 17:55:38,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:55:38,310 INFO L82 PathProgramCache]: Analyzing trace with hash -137876649, now seen corresponding path program 1 times [2019-12-18 17:55:38,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:55:38,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222587658] [2019-12-18 17:55:38,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:55:38,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:55:38,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:55:38,385 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222587658] [2019-12-18 17:55:38,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:55:38,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:55:38,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621267023] [2019-12-18 17:55:38,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:55:38,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:55:38,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:55:38,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:55:38,387 INFO L87 Difference]: Start difference. First operand 33925 states and 111057 transitions. Second operand 4 states. [2019-12-18 17:55:38,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:55:38,751 INFO L93 Difference]: Finished difference Result 41000 states and 132194 transitions. [2019-12-18 17:55:38,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:55:38,751 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 17:55:38,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:55:38,817 INFO L225 Difference]: With dead ends: 41000 [2019-12-18 17:55:38,817 INFO L226 Difference]: Without dead ends: 41000 [2019-12-18 17:55:38,818 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:55:39,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41000 states. [2019-12-18 17:55:39,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41000 to 37405. [2019-12-18 17:55:39,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37405 states. [2019-12-18 17:55:39,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37405 states to 37405 states and 121522 transitions. [2019-12-18 17:55:39,492 INFO L78 Accepts]: Start accepts. Automaton has 37405 states and 121522 transitions. Word has length 16 [2019-12-18 17:55:39,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:55:39,493 INFO L462 AbstractCegarLoop]: Abstraction has 37405 states and 121522 transitions. [2019-12-18 17:55:39,493 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:55:39,493 INFO L276 IsEmpty]: Start isEmpty. Operand 37405 states and 121522 transitions. [2019-12-18 17:55:39,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 17:55:39,495 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:55:39,495 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:55:39,495 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-18 17:55:39,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:55:39,495 INFO L82 PathProgramCache]: Analyzing trace with hash -219444717, now seen corresponding path program 1 times [2019-12-18 17:55:39,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:55:39,496 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276329076] [2019-12-18 17:55:39,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:55:39,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:55:39,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:55:39,555 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276329076] [2019-12-18 17:55:39,555 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:55:39,556 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:55:39,556 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104143119] [2019-12-18 17:55:39,557 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:55:39,557 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:55:39,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:55:39,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:55:39,558 INFO L87 Difference]: Start difference. First operand 37405 states and 121522 transitions. Second operand 4 states. [2019-12-18 17:55:39,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:55:39,903 INFO L93 Difference]: Finished difference Result 45062 states and 145323 transitions. [2019-12-18 17:55:39,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:55:39,903 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 17:55:39,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:55:40,340 INFO L225 Difference]: With dead ends: 45062 [2019-12-18 17:55:40,340 INFO L226 Difference]: Without dead ends: 45062 [2019-12-18 17:55:40,341 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:55:40,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45062 states. [2019-12-18 17:55:40,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45062 to 38365. [2019-12-18 17:55:40,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38365 states. [2019-12-18 17:55:41,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38365 states to 38365 states and 124903 transitions. [2019-12-18 17:55:41,000 INFO L78 Accepts]: Start accepts. Automaton has 38365 states and 124903 transitions. Word has length 16 [2019-12-18 17:55:41,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:55:41,001 INFO L462 AbstractCegarLoop]: Abstraction has 38365 states and 124903 transitions. [2019-12-18 17:55:41,001 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:55:41,001 INFO L276 IsEmpty]: Start isEmpty. Operand 38365 states and 124903 transitions. [2019-12-18 17:55:41,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 17:55:41,012 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:55:41,012 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-18 17:55:41,012 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-18 17:55:41,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:55:41,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1066994180, now seen corresponding path program 1 times [2019-12-18 17:55:41,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:55:41,013 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26866072] [2019-12-18 17:55:41,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:55:41,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:55:41,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:55:41,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26866072] [2019-12-18 17:55:41,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:55:41,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:55:41,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407125659] [2019-12-18 17:55:41,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:55:41,113 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:55:41,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:55:41,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:55:41,113 INFO L87 Difference]: Start difference. First operand 38365 states and 124903 transitions. Second operand 5 states. [2019-12-18 17:55:41,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:55:41,761 INFO L93 Difference]: Finished difference Result 53898 states and 171065 transitions. [2019-12-18 17:55:41,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 17:55:41,762 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 17:55:41,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:55:41,865 INFO L225 Difference]: With dead ends: 53898 [2019-12-18 17:55:41,865 INFO L226 Difference]: Without dead ends: 53891 [2019-12-18 17:55:41,865 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 17:55:42,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53891 states. [2019-12-18 17:55:42,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53891 to 39721. [2019-12-18 17:55:42,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39721 states. [2019-12-18 17:55:43,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39721 states to 39721 states and 129036 transitions. [2019-12-18 17:55:43,006 INFO L78 Accepts]: Start accepts. Automaton has 39721 states and 129036 transitions. Word has length 22 [2019-12-18 17:55:43,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:55:43,006 INFO L462 AbstractCegarLoop]: Abstraction has 39721 states and 129036 transitions. [2019-12-18 17:55:43,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:55:43,006 INFO L276 IsEmpty]: Start isEmpty. Operand 39721 states and 129036 transitions. [2019-12-18 17:55:43,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 17:55:43,015 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:55:43,015 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-18 17:55:43,015 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-18 17:55:43,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:55:43,016 INFO L82 PathProgramCache]: Analyzing trace with hash -1734556852, now seen corresponding path program 1 times [2019-12-18 17:55:43,016 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:55:43,016 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440345996] [2019-12-18 17:55:43,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:55:43,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:55:43,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:55:43,089 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440345996] [2019-12-18 17:55:43,089 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:55:43,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:55:43,089 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068083471] [2019-12-18 17:55:43,090 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:55:43,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:55:43,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:55:43,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:55:43,091 INFO L87 Difference]: Start difference. First operand 39721 states and 129036 transitions. Second operand 5 states. [2019-12-18 17:55:43,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:55:43,686 INFO L93 Difference]: Finished difference Result 56181 states and 177938 transitions. [2019-12-18 17:55:43,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 17:55:43,686 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 17:55:43,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:55:43,781 INFO L225 Difference]: With dead ends: 56181 [2019-12-18 17:55:43,782 INFO L226 Difference]: Without dead ends: 56174 [2019-12-18 17:55:43,782 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-18 17:55:44,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56174 states. [2019-12-18 17:55:45,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56174 to 38054. [2019-12-18 17:55:45,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38054 states. [2019-12-18 17:55:45,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38054 states to 38054 states and 123745 transitions. [2019-12-18 17:55:45,124 INFO L78 Accepts]: Start accepts. Automaton has 38054 states and 123745 transitions. Word has length 22 [2019-12-18 17:55:45,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:55:45,124 INFO L462 AbstractCegarLoop]: Abstraction has 38054 states and 123745 transitions. [2019-12-18 17:55:45,124 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:55:45,124 INFO L276 IsEmpty]: Start isEmpty. Operand 38054 states and 123745 transitions. [2019-12-18 17:55:45,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 17:55:45,136 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:55:45,136 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-18 17:55:45,137 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-18 17:55:45,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:55:45,137 INFO L82 PathProgramCache]: Analyzing trace with hash -779030427, now seen corresponding path program 1 times [2019-12-18 17:55:45,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:55:45,137 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543173325] [2019-12-18 17:55:45,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:55:45,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:55:45,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:55:45,184 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543173325] [2019-12-18 17:55:45,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:55:45,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:55:45,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123309791] [2019-12-18 17:55:45,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:55:45,185 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:55:45,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:55:45,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:55:45,186 INFO L87 Difference]: Start difference. First operand 38054 states and 123745 transitions. Second operand 4 states. [2019-12-18 17:55:45,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:55:45,256 INFO L93 Difference]: Finished difference Result 15260 states and 46817 transitions. [2019-12-18 17:55:45,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 17:55:45,257 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 17:55:45,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:55:45,286 INFO L225 Difference]: With dead ends: 15260 [2019-12-18 17:55:45,286 INFO L226 Difference]: Without dead ends: 15260 [2019-12-18 17:55:45,287 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:55:45,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15260 states. [2019-12-18 17:55:45,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15260 to 14988. [2019-12-18 17:55:45,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14988 states. [2019-12-18 17:55:45,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14988 states to 14988 states and 46041 transitions. [2019-12-18 17:55:45,630 INFO L78 Accepts]: Start accepts. Automaton has 14988 states and 46041 transitions. Word has length 25 [2019-12-18 17:55:45,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:55:45,634 INFO L462 AbstractCegarLoop]: Abstraction has 14988 states and 46041 transitions. [2019-12-18 17:55:45,634 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:55:45,634 INFO L276 IsEmpty]: Start isEmpty. Operand 14988 states and 46041 transitions. [2019-12-18 17:55:45,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 17:55:45,650 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:55:45,651 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-18 17:55:45,651 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-18 17:55:45,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:55:45,651 INFO L82 PathProgramCache]: Analyzing trace with hash -1740727520, now seen corresponding path program 1 times [2019-12-18 17:55:45,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:55:45,652 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610573207] [2019-12-18 17:55:45,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:55:45,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:55:45,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:55:45,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610573207] [2019-12-18 17:55:45,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:55:45,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:55:45,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514189778] [2019-12-18 17:55:45,750 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:55:45,750 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:55:45,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:55:45,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:55:45,750 INFO L87 Difference]: Start difference. First operand 14988 states and 46041 transitions. Second operand 5 states. [2019-12-18 17:55:46,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:55:46,126 INFO L93 Difference]: Finished difference Result 19496 states and 58771 transitions. [2019-12-18 17:55:46,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 17:55:46,127 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-18 17:55:46,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:55:46,163 INFO L225 Difference]: With dead ends: 19496 [2019-12-18 17:55:46,163 INFO L226 Difference]: Without dead ends: 19496 [2019-12-18 17:55:46,163 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:55:46,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19496 states. [2019-12-18 17:55:46,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19496 to 18230. [2019-12-18 17:55:46,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18230 states. [2019-12-18 17:55:46,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18230 states to 18230 states and 55601 transitions. [2019-12-18 17:55:46,524 INFO L78 Accepts]: Start accepts. Automaton has 18230 states and 55601 transitions. Word has length 27 [2019-12-18 17:55:46,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:55:46,524 INFO L462 AbstractCegarLoop]: Abstraction has 18230 states and 55601 transitions. [2019-12-18 17:55:46,524 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:55:46,524 INFO L276 IsEmpty]: Start isEmpty. Operand 18230 states and 55601 transitions. [2019-12-18 17:55:46,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 17:55:46,537 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:55:46,537 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-18 17:55:46,537 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-18 17:55:46,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:55:46,537 INFO L82 PathProgramCache]: Analyzing trace with hash -1978987791, now seen corresponding path program 1 times [2019-12-18 17:55:46,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:55:46,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796141158] [2019-12-18 17:55:46,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:55:46,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:55:46,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:55:46,598 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796141158] [2019-12-18 17:55:46,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:55:46,598 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:55:46,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544773811] [2019-12-18 17:55:46,599 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:55:46,599 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:55:46,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:55:46,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:55:46,600 INFO L87 Difference]: Start difference. First operand 18230 states and 55601 transitions. Second operand 5 states. [2019-12-18 17:55:46,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:55:46,976 INFO L93 Difference]: Finished difference Result 21384 states and 64177 transitions. [2019-12-18 17:55:46,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 17:55:46,977 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-18 17:55:46,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:55:47,015 INFO L225 Difference]: With dead ends: 21384 [2019-12-18 17:55:47,015 INFO L226 Difference]: Without dead ends: 21384 [2019-12-18 17:55:47,015 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:55:47,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21384 states. [2019-12-18 17:55:47,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21384 to 17323. [2019-12-18 17:55:47,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17323 states. [2019-12-18 17:55:47,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17323 states to 17323 states and 52883 transitions. [2019-12-18 17:55:47,295 INFO L78 Accepts]: Start accepts. Automaton has 17323 states and 52883 transitions. Word has length 28 [2019-12-18 17:55:47,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:55:47,295 INFO L462 AbstractCegarLoop]: Abstraction has 17323 states and 52883 transitions. [2019-12-18 17:55:47,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:55:47,296 INFO L276 IsEmpty]: Start isEmpty. Operand 17323 states and 52883 transitions. [2019-12-18 17:55:47,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 17:55:47,312 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:55:47,313 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-18 17:55:47,313 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-18 17:55:47,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:55:47,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1850577991, now seen corresponding path program 1 times [2019-12-18 17:55:47,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:55:47,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558139519] [2019-12-18 17:55:47,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:55:47,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:55:47,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:55:47,390 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558139519] [2019-12-18 17:55:47,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:55:47,390 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 17:55:47,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382458772] [2019-12-18 17:55:47,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:55:47,391 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:55:47,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:55:47,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:55:47,391 INFO L87 Difference]: Start difference. First operand 17323 states and 52883 transitions. Second operand 6 states. [2019-12-18 17:55:48,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:55:48,276 INFO L93 Difference]: Finished difference Result 24527 states and 73018 transitions. [2019-12-18 17:55:48,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 17:55:48,276 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-12-18 17:55:48,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:55:48,325 INFO L225 Difference]: With dead ends: 24527 [2019-12-18 17:55:48,326 INFO L226 Difference]: Without dead ends: 24527 [2019-12-18 17:55:48,326 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-18 17:55:48,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24527 states. [2019-12-18 17:55:48,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24527 to 18692. [2019-12-18 17:55:48,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18692 states. [2019-12-18 17:55:48,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18692 states to 18692 states and 56821 transitions. [2019-12-18 17:55:48,722 INFO L78 Accepts]: Start accepts. Automaton has 18692 states and 56821 transitions. Word has length 33 [2019-12-18 17:55:48,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:55:48,723 INFO L462 AbstractCegarLoop]: Abstraction has 18692 states and 56821 transitions. [2019-12-18 17:55:48,723 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:55:48,723 INFO L276 IsEmpty]: Start isEmpty. Operand 18692 states and 56821 transitions. [2019-12-18 17:55:48,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 17:55:48,742 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:55:48,742 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:55:48,742 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-18 17:55:48,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:55:48,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1933444630, now seen corresponding path program 1 times [2019-12-18 17:55:48,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:55:48,743 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342445137] [2019-12-18 17:55:48,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:55:48,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:55:48,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:55:48,826 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342445137] [2019-12-18 17:55:48,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:55:48,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 17:55:48,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664311986] [2019-12-18 17:55:48,827 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:55:48,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:55:48,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:55:48,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:55:48,829 INFO L87 Difference]: Start difference. First operand 18692 states and 56821 transitions. Second operand 6 states. [2019-12-18 17:55:49,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:55:49,539 INFO L93 Difference]: Finished difference Result 23844 states and 71231 transitions. [2019-12-18 17:55:49,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 17:55:49,539 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-12-18 17:55:49,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:55:49,586 INFO L225 Difference]: With dead ends: 23844 [2019-12-18 17:55:49,587 INFO L226 Difference]: Without dead ends: 23844 [2019-12-18 17:55:49,587 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-18 17:55:49,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23844 states. [2019-12-18 17:55:49,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23844 to 15691. [2019-12-18 17:55:49,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15691 states. [2019-12-18 17:55:49,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15691 states to 15691 states and 48077 transitions. [2019-12-18 17:55:49,940 INFO L78 Accepts]: Start accepts. Automaton has 15691 states and 48077 transitions. Word has length 34 [2019-12-18 17:55:49,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:55:49,940 INFO L462 AbstractCegarLoop]: Abstraction has 15691 states and 48077 transitions. [2019-12-18 17:55:49,940 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:55:49,940 INFO L276 IsEmpty]: Start isEmpty. Operand 15691 states and 48077 transitions. [2019-12-18 17:55:49,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 17:55:49,960 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:55:49,961 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-18 17:55:49,961 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-18 17:55:49,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:55:49,961 INFO L82 PathProgramCache]: Analyzing trace with hash -390301387, now seen corresponding path program 1 times [2019-12-18 17:55:49,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:55:49,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627838631] [2019-12-18 17:55:49,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:55:49,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:55:50,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:55:50,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627838631] [2019-12-18 17:55:50,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:55:50,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:55:50,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980077722] [2019-12-18 17:55:50,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:55:50,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:55:50,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:55:50,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:55:50,008 INFO L87 Difference]: Start difference. First operand 15691 states and 48077 transitions. Second operand 3 states. [2019-12-18 17:55:50,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:55:50,134 INFO L93 Difference]: Finished difference Result 29593 states and 90773 transitions. [2019-12-18 17:55:50,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:55:50,135 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 17:55:50,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:55:50,170 INFO L225 Difference]: With dead ends: 29593 [2019-12-18 17:55:50,170 INFO L226 Difference]: Without dead ends: 16129 [2019-12-18 17:55:50,171 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:55:50,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16129 states. [2019-12-18 17:55:50,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16129 to 16073. [2019-12-18 17:55:50,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16073 states. [2019-12-18 17:55:50,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16073 states to 16073 states and 48010 transitions. [2019-12-18 17:55:50,422 INFO L78 Accepts]: Start accepts. Automaton has 16073 states and 48010 transitions. Word has length 39 [2019-12-18 17:55:50,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:55:50,422 INFO L462 AbstractCegarLoop]: Abstraction has 16073 states and 48010 transitions. [2019-12-18 17:55:50,422 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:55:50,422 INFO L276 IsEmpty]: Start isEmpty. Operand 16073 states and 48010 transitions. [2019-12-18 17:55:50,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 17:55:50,439 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:55:50,439 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-18 17:55:50,439 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-18 17:55:50,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:55:50,440 INFO L82 PathProgramCache]: Analyzing trace with hash -1543157030, now seen corresponding path program 1 times [2019-12-18 17:55:50,440 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:55:50,440 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721839990] [2019-12-18 17:55:50,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:55:50,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:55:50,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:55:50,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721839990] [2019-12-18 17:55:50,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:55:50,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 17:55:50,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234590992] [2019-12-18 17:55:50,526 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:55:50,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:55:50,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:55:50,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:55:50,527 INFO L87 Difference]: Start difference. First operand 16073 states and 48010 transitions. Second operand 5 states. [2019-12-18 17:55:51,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:55:51,370 INFO L93 Difference]: Finished difference Result 23632 states and 69938 transitions. [2019-12-18 17:55:51,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 17:55:51,371 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 17:55:51,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:55:51,414 INFO L225 Difference]: With dead ends: 23632 [2019-12-18 17:55:51,414 INFO L226 Difference]: Without dead ends: 23632 [2019-12-18 17:55:51,415 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:55:51,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23632 states. [2019-12-18 17:55:51,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23632 to 21777. [2019-12-18 17:55:51,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21777 states. [2019-12-18 17:55:51,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21777 states to 21777 states and 64983 transitions. [2019-12-18 17:55:51,751 INFO L78 Accepts]: Start accepts. Automaton has 21777 states and 64983 transitions. Word has length 40 [2019-12-18 17:55:51,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:55:51,752 INFO L462 AbstractCegarLoop]: Abstraction has 21777 states and 64983 transitions. [2019-12-18 17:55:51,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:55:51,752 INFO L276 IsEmpty]: Start isEmpty. Operand 21777 states and 64983 transitions. [2019-12-18 17:55:51,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 17:55:51,773 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:55:51,773 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-18 17:55:51,774 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-18 17:55:51,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:55:51,774 INFO L82 PathProgramCache]: Analyzing trace with hash 838743556, now seen corresponding path program 2 times [2019-12-18 17:55:51,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:55:51,774 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799031038] [2019-12-18 17:55:51,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:55:51,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:55:51,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:55:51,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799031038] [2019-12-18 17:55:51,831 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:55:51,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 17:55:51,832 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829163986] [2019-12-18 17:55:51,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:55:51,832 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:55:51,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:55:51,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:55:51,833 INFO L87 Difference]: Start difference. First operand 21777 states and 64983 transitions. Second operand 5 states. [2019-12-18 17:55:51,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:55:51,918 INFO L93 Difference]: Finished difference Result 20526 states and 62067 transitions. [2019-12-18 17:55:51,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:55:51,919 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 17:55:51,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:55:51,946 INFO L225 Difference]: With dead ends: 20526 [2019-12-18 17:55:51,946 INFO L226 Difference]: Without dead ends: 18967 [2019-12-18 17:55:51,946 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:55:52,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18967 states. [2019-12-18 17:55:52,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18967 to 18092. [2019-12-18 17:55:52,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18092 states. [2019-12-18 17:55:52,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18092 states to 18092 states and 56295 transitions. [2019-12-18 17:55:52,226 INFO L78 Accepts]: Start accepts. Automaton has 18092 states and 56295 transitions. Word has length 40 [2019-12-18 17:55:52,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:55:52,226 INFO L462 AbstractCegarLoop]: Abstraction has 18092 states and 56295 transitions. [2019-12-18 17:55:52,226 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:55:52,227 INFO L276 IsEmpty]: Start isEmpty. Operand 18092 states and 56295 transitions. [2019-12-18 17:55:52,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 17:55:52,255 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:55:52,256 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-18 17:55:52,257 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-18 17:55:52,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:55:52,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1449191354, now seen corresponding path program 1 times [2019-12-18 17:55:52,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:55:52,258 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064135077] [2019-12-18 17:55:52,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:55:52,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:55:52,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:55:52,312 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064135077] [2019-12-18 17:55:52,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:55:52,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:55:52,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914579957] [2019-12-18 17:55:52,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:55:52,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:55:52,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:55:52,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:55:52,316 INFO L87 Difference]: Start difference. First operand 18092 states and 56295 transitions. Second operand 3 states. [2019-12-18 17:55:52,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:55:52,436 INFO L93 Difference]: Finished difference Result 24294 states and 73055 transitions. [2019-12-18 17:55:52,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:55:52,436 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 17:55:52,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:55:52,476 INFO L225 Difference]: With dead ends: 24294 [2019-12-18 17:55:52,476 INFO L226 Difference]: Without dead ends: 24294 [2019-12-18 17:55:52,477 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:55:52,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24294 states. [2019-12-18 17:55:52,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24294 to 18274. [2019-12-18 17:55:52,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18274 states. [2019-12-18 17:55:52,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18274 states to 18274 states and 55190 transitions. [2019-12-18 17:55:52,798 INFO L78 Accepts]: Start accepts. Automaton has 18274 states and 55190 transitions. Word has length 64 [2019-12-18 17:55:52,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:55:52,798 INFO L462 AbstractCegarLoop]: Abstraction has 18274 states and 55190 transitions. [2019-12-18 17:55:52,798 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:55:52,798 INFO L276 IsEmpty]: Start isEmpty. Operand 18274 states and 55190 transitions. [2019-12-18 17:55:52,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 17:55:52,824 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:55:52,824 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-18 17:55:52,824 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-18 17:55:52,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:55:52,825 INFO L82 PathProgramCache]: Analyzing trace with hash -237391966, now seen corresponding path program 1 times [2019-12-18 17:55:52,825 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:55:52,825 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464540097] [2019-12-18 17:55:52,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:55:52,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:55:52,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:55:52,934 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464540097] [2019-12-18 17:55:52,935 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:55:52,935 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 17:55:52,936 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151289059] [2019-12-18 17:55:52,936 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 17:55:52,936 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:55:52,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 17:55:52,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 17:55:52,940 INFO L87 Difference]: Start difference. First operand 18274 states and 55190 transitions. Second operand 8 states. [2019-12-18 17:55:53,945 WARN L192 SmtUtils]: Spent 231.00 ms on a formula simplification that was a NOOP. DAG size: 6 [2019-12-18 17:55:54,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:55:54,405 INFO L93 Difference]: Finished difference Result 80145 states and 240194 transitions. [2019-12-18 17:55:54,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 17:55:54,405 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 64 [2019-12-18 17:55:54,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:55:54,488 INFO L225 Difference]: With dead ends: 80145 [2019-12-18 17:55:54,489 INFO L226 Difference]: Without dead ends: 58918 [2019-12-18 17:55:54,489 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2019-12-18 17:55:54,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58918 states. [2019-12-18 17:55:55,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58918 to 21155. [2019-12-18 17:55:55,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21155 states. [2019-12-18 17:55:55,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21155 states to 21155 states and 64148 transitions. [2019-12-18 17:55:55,099 INFO L78 Accepts]: Start accepts. Automaton has 21155 states and 64148 transitions. Word has length 64 [2019-12-18 17:55:55,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:55:55,100 INFO L462 AbstractCegarLoop]: Abstraction has 21155 states and 64148 transitions. [2019-12-18 17:55:55,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 17:55:55,100 INFO L276 IsEmpty]: Start isEmpty. Operand 21155 states and 64148 transitions. [2019-12-18 17:55:55,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 17:55:55,123 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:55:55,123 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-18 17:55:55,123 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-18 17:55:55,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:55:55,124 INFO L82 PathProgramCache]: Analyzing trace with hash -1797634292, now seen corresponding path program 2 times [2019-12-18 17:55:55,124 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:55:55,124 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42347444] [2019-12-18 17:55:55,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:55:55,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:55:55,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:55:55,198 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42347444] [2019-12-18 17:55:55,198 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:55:55,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 17:55:55,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63051203] [2019-12-18 17:55:55,199 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 17:55:55,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:55:55,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 17:55:55,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:55:55,199 INFO L87 Difference]: Start difference. First operand 21155 states and 64148 transitions. Second operand 7 states. [2019-12-18 17:55:55,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:55:55,675 INFO L93 Difference]: Finished difference Result 60723 states and 180590 transitions. [2019-12-18 17:55:55,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 17:55:55,676 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 17:55:55,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:55:55,733 INFO L225 Difference]: With dead ends: 60723 [2019-12-18 17:55:55,734 INFO L226 Difference]: Without dead ends: 42175 [2019-12-18 17:55:55,734 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 17:55:55,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42175 states. [2019-12-18 17:55:56,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42175 to 24456. [2019-12-18 17:55:56,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24456 states. [2019-12-18 17:55:56,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24456 states to 24456 states and 73578 transitions. [2019-12-18 17:55:56,660 INFO L78 Accepts]: Start accepts. Automaton has 24456 states and 73578 transitions. Word has length 64 [2019-12-18 17:55:56,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:55:56,660 INFO L462 AbstractCegarLoop]: Abstraction has 24456 states and 73578 transitions. [2019-12-18 17:55:56,660 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 17:55:56,660 INFO L276 IsEmpty]: Start isEmpty. Operand 24456 states and 73578 transitions. [2019-12-18 17:55:56,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 17:55:56,685 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:55:56,685 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-18 17:55:56,685 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-18 17:55:56,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:55:56,686 INFO L82 PathProgramCache]: Analyzing trace with hash 1864819808, now seen corresponding path program 3 times [2019-12-18 17:55:56,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:55:56,686 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390133965] [2019-12-18 17:55:56,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:55:56,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:55:56,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:55:56,799 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390133965] [2019-12-18 17:55:56,799 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:55:56,799 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 17:55:56,800 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358957620] [2019-12-18 17:55:56,800 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 17:55:56,800 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:55:56,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 17:55:56,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 17:55:56,801 INFO L87 Difference]: Start difference. First operand 24456 states and 73578 transitions. Second operand 9 states. [2019-12-18 17:55:58,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:55:58,115 INFO L93 Difference]: Finished difference Result 82000 states and 242893 transitions. [2019-12-18 17:55:58,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-18 17:55:58,115 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-18 17:55:58,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:55:58,226 INFO L225 Difference]: With dead ends: 82000 [2019-12-18 17:55:58,226 INFO L226 Difference]: Without dead ends: 78263 [2019-12-18 17:55:58,227 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=163, Invalid=539, Unknown=0, NotChecked=0, Total=702 [2019-12-18 17:55:58,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78263 states. [2019-12-18 17:55:58,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78263 to 24486. [2019-12-18 17:55:58,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24486 states. [2019-12-18 17:55:59,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24486 states to 24486 states and 73706 transitions. [2019-12-18 17:55:59,024 INFO L78 Accepts]: Start accepts. Automaton has 24486 states and 73706 transitions. Word has length 64 [2019-12-18 17:55:59,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:55:59,024 INFO L462 AbstractCegarLoop]: Abstraction has 24486 states and 73706 transitions. [2019-12-18 17:55:59,025 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 17:55:59,025 INFO L276 IsEmpty]: Start isEmpty. Operand 24486 states and 73706 transitions. [2019-12-18 17:55:59,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 17:55:59,048 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:55:59,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:55:59,048 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-18 17:55:59,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:55:59,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1743895244, now seen corresponding path program 4 times [2019-12-18 17:55:59,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:55:59,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946593340] [2019-12-18 17:55:59,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:55:59,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:55:59,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:55:59,153 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946593340] [2019-12-18 17:55:59,153 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:55:59,154 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 17:55:59,154 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885714661] [2019-12-18 17:55:59,154 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 17:55:59,155 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:55:59,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 17:55:59,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 17:55:59,156 INFO L87 Difference]: Start difference. First operand 24486 states and 73706 transitions. Second operand 9 states. [2019-12-18 17:56:01,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:56:01,024 INFO L93 Difference]: Finished difference Result 98855 states and 292935 transitions. [2019-12-18 17:56:01,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 17:56:01,024 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-18 17:56:01,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:56:01,153 INFO L225 Difference]: With dead ends: 98855 [2019-12-18 17:56:01,153 INFO L226 Difference]: Without dead ends: 95231 [2019-12-18 17:56:01,153 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=154, Invalid=496, Unknown=0, NotChecked=0, Total=650 [2019-12-18 17:56:01,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95231 states. [2019-12-18 17:56:01,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95231 to 24523. [2019-12-18 17:56:01,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24523 states. [2019-12-18 17:56:02,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24523 states to 24523 states and 73910 transitions. [2019-12-18 17:56:02,016 INFO L78 Accepts]: Start accepts. Automaton has 24523 states and 73910 transitions. Word has length 64 [2019-12-18 17:56:02,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:56:02,016 INFO L462 AbstractCegarLoop]: Abstraction has 24523 states and 73910 transitions. [2019-12-18 17:56:02,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 17:56:02,016 INFO L276 IsEmpty]: Start isEmpty. Operand 24523 states and 73910 transitions. [2019-12-18 17:56:02,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 17:56:02,044 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:56:02,044 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-18 17:56:02,044 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-18 17:56:02,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:56:02,044 INFO L82 PathProgramCache]: Analyzing trace with hash -1299608434, now seen corresponding path program 5 times [2019-12-18 17:56:02,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:56:02,047 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455582468] [2019-12-18 17:56:02,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:56:02,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:56:02,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:56:02,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455582468] [2019-12-18 17:56:02,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:56:02,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 17:56:02,135 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865869422] [2019-12-18 17:56:02,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 17:56:02,136 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:56:02,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 17:56:02,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:56:02,137 INFO L87 Difference]: Start difference. First operand 24523 states and 73910 transitions. Second operand 7 states. [2019-12-18 17:56:02,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:56:02,563 INFO L93 Difference]: Finished difference Result 51563 states and 153345 transitions. [2019-12-18 17:56:02,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 17:56:02,564 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 17:56:02,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:56:02,624 INFO L225 Difference]: With dead ends: 51563 [2019-12-18 17:56:02,624 INFO L226 Difference]: Without dead ends: 44912 [2019-12-18 17:56:02,625 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 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-18 17:56:02,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44912 states. [2019-12-18 17:56:03,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44912 to 24831. [2019-12-18 17:56:03,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24831 states. [2019-12-18 17:56:03,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24831 states to 24831 states and 74861 transitions. [2019-12-18 17:56:03,591 INFO L78 Accepts]: Start accepts. Automaton has 24831 states and 74861 transitions. Word has length 64 [2019-12-18 17:56:03,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:56:03,592 INFO L462 AbstractCegarLoop]: Abstraction has 24831 states and 74861 transitions. [2019-12-18 17:56:03,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 17:56:03,592 INFO L276 IsEmpty]: Start isEmpty. Operand 24831 states and 74861 transitions. [2019-12-18 17:56:03,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 17:56:03,618 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:56:03,618 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-18 17:56:03,618 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-18 17:56:03,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:56:03,619 INFO L82 PathProgramCache]: Analyzing trace with hash 2138548684, now seen corresponding path program 6 times [2019-12-18 17:56:03,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:56:03,619 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62172488] [2019-12-18 17:56:03,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:56:03,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:56:03,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:56:03,720 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62172488] [2019-12-18 17:56:03,720 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:56:03,720 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 17:56:03,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043445419] [2019-12-18 17:56:03,721 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:56:03,721 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:56:03,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:56:03,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:56:03,722 INFO L87 Difference]: Start difference. First operand 24831 states and 74861 transitions. Second operand 6 states. [2019-12-18 17:56:04,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:56:04,490 INFO L93 Difference]: Finished difference Result 40171 states and 119168 transitions. [2019-12-18 17:56:04,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 17:56:04,491 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2019-12-18 17:56:04,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:56:04,545 INFO L225 Difference]: With dead ends: 40171 [2019-12-18 17:56:04,545 INFO L226 Difference]: Without dead ends: 39968 [2019-12-18 17:56:04,546 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-18 17:56:04,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39968 states. [2019-12-18 17:56:05,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39968 to 26499. [2019-12-18 17:56:05,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26499 states. [2019-12-18 17:56:05,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26499 states to 26499 states and 80093 transitions. [2019-12-18 17:56:05,066 INFO L78 Accepts]: Start accepts. Automaton has 26499 states and 80093 transitions. Word has length 64 [2019-12-18 17:56:05,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:56:05,066 INFO L462 AbstractCegarLoop]: Abstraction has 26499 states and 80093 transitions. [2019-12-18 17:56:05,066 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:56:05,067 INFO L276 IsEmpty]: Start isEmpty. Operand 26499 states and 80093 transitions. [2019-12-18 17:56:05,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 17:56:05,097 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:56:05,097 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-18 17:56:05,097 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-18 17:56:05,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:56:05,098 INFO L82 PathProgramCache]: Analyzing trace with hash -203791434, now seen corresponding path program 7 times [2019-12-18 17:56:05,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:56:05,098 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113574103] [2019-12-18 17:56:05,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:56:05,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:56:05,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:56:05,178 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113574103] [2019-12-18 17:56:05,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:56:05,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 17:56:05,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485949769] [2019-12-18 17:56:05,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:56:05,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:56:05,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:56:05,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:56:05,180 INFO L87 Difference]: Start difference. First operand 26499 states and 80093 transitions. Second operand 5 states. [2019-12-18 17:56:05,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:56:05,574 INFO L93 Difference]: Finished difference Result 28511 states and 85751 transitions. [2019-12-18 17:56:05,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 17:56:05,575 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2019-12-18 17:56:05,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:56:05,612 INFO L225 Difference]: With dead ends: 28511 [2019-12-18 17:56:05,612 INFO L226 Difference]: Without dead ends: 28511 [2019-12-18 17:56:05,613 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:56:05,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28511 states. [2019-12-18 17:56:05,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28511 to 26924. [2019-12-18 17:56:05,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26924 states. [2019-12-18 17:56:06,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26924 states to 26924 states and 81409 transitions. [2019-12-18 17:56:06,049 INFO L78 Accepts]: Start accepts. Automaton has 26924 states and 81409 transitions. Word has length 64 [2019-12-18 17:56:06,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:56:06,049 INFO L462 AbstractCegarLoop]: Abstraction has 26924 states and 81409 transitions. [2019-12-18 17:56:06,049 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:56:06,049 INFO L276 IsEmpty]: Start isEmpty. Operand 26924 states and 81409 transitions. [2019-12-18 17:56:06,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 17:56:06,080 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:56:06,080 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-18 17:56:06,081 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-18 17:56:06,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:56:06,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1288865556, now seen corresponding path program 8 times [2019-12-18 17:56:06,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:56:06,081 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571993554] [2019-12-18 17:56:06,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:56:06,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:56:06,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:56:06,189 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571993554] [2019-12-18 17:56:06,189 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:56:06,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 17:56:06,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004638558] [2019-12-18 17:56:06,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 17:56:06,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:56:06,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 17:56:06,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 17:56:06,191 INFO L87 Difference]: Start difference. First operand 26924 states and 81409 transitions. Second operand 8 states. [2019-12-18 17:56:08,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:56:08,385 INFO L93 Difference]: Finished difference Result 43600 states and 128179 transitions. [2019-12-18 17:56:08,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 17:56:08,385 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 64 [2019-12-18 17:56:08,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:56:08,442 INFO L225 Difference]: With dead ends: 43600 [2019-12-18 17:56:08,442 INFO L226 Difference]: Without dead ends: 43304 [2019-12-18 17:56:08,442 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=132, Invalid=468, Unknown=0, NotChecked=0, Total=600 [2019-12-18 17:56:08,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43304 states. [2019-12-18 17:56:08,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43304 to 27220. [2019-12-18 17:56:08,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27220 states. [2019-12-18 17:56:09,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27220 states to 27220 states and 82366 transitions. [2019-12-18 17:56:09,003 INFO L78 Accepts]: Start accepts. Automaton has 27220 states and 82366 transitions. Word has length 64 [2019-12-18 17:56:09,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:56:09,004 INFO L462 AbstractCegarLoop]: Abstraction has 27220 states and 82366 transitions. [2019-12-18 17:56:09,004 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 17:56:09,004 INFO L276 IsEmpty]: Start isEmpty. Operand 27220 states and 82366 transitions. [2019-12-18 17:56:09,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 17:56:09,031 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:56:09,031 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-18 17:56:09,032 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-18 17:56:09,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:56:09,032 INFO L82 PathProgramCache]: Analyzing trace with hash 2115336524, now seen corresponding path program 9 times [2019-12-18 17:56:09,032 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:56:09,032 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426156736] [2019-12-18 17:56:09,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:56:09,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:56:09,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:56:09,144 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426156736] [2019-12-18 17:56:09,144 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:56:09,144 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 17:56:09,145 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925664598] [2019-12-18 17:56:09,145 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 17:56:09,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:56:09,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 17:56:09,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-18 17:56:09,147 INFO L87 Difference]: Start difference. First operand 27220 states and 82366 transitions. Second operand 8 states. [2019-12-18 17:56:10,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:56:10,457 INFO L93 Difference]: Finished difference Result 39321 states and 118755 transitions. [2019-12-18 17:56:10,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 17:56:10,461 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 64 [2019-12-18 17:56:10,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:56:10,515 INFO L225 Difference]: With dead ends: 39321 [2019-12-18 17:56:10,516 INFO L226 Difference]: Without dead ends: 39321 [2019-12-18 17:56:10,516 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-12-18 17:56:10,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39321 states. [2019-12-18 17:56:10,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39321 to 26999. [2019-12-18 17:56:10,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26999 states. [2019-12-18 17:56:11,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26999 states to 26999 states and 81718 transitions. [2019-12-18 17:56:11,039 INFO L78 Accepts]: Start accepts. Automaton has 26999 states and 81718 transitions. Word has length 64 [2019-12-18 17:56:11,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:56:11,039 INFO L462 AbstractCegarLoop]: Abstraction has 26999 states and 81718 transitions. [2019-12-18 17:56:11,039 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 17:56:11,039 INFO L276 IsEmpty]: Start isEmpty. Operand 26999 states and 81718 transitions. [2019-12-18 17:56:11,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 17:56:11,070 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:56:11,070 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-18 17:56:11,071 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-18 17:56:11,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:56:11,071 INFO L82 PathProgramCache]: Analyzing trace with hash 576481680, now seen corresponding path program 10 times [2019-12-18 17:56:11,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:56:11,071 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889679952] [2019-12-18 17:56:11,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:56:11,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:56:11,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:56:11,146 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889679952] [2019-12-18 17:56:11,146 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:56:11,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 17:56:11,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805583186] [2019-12-18 17:56:11,147 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:56:11,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:56:11,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:56:11,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:56:11,148 INFO L87 Difference]: Start difference. First operand 26999 states and 81718 transitions. Second operand 5 states. [2019-12-18 17:56:12,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:56:12,171 INFO L93 Difference]: Finished difference Result 38088 states and 112998 transitions. [2019-12-18 17:56:12,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 17:56:12,172 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2019-12-18 17:56:12,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:56:12,222 INFO L225 Difference]: With dead ends: 38088 [2019-12-18 17:56:12,223 INFO L226 Difference]: Without dead ends: 37868 [2019-12-18 17:56:12,223 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:56:12,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37868 states. [2019-12-18 17:56:12,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37868 to 32230. [2019-12-18 17:56:12,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32230 states. [2019-12-18 17:56:12,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32230 states to 32230 states and 96827 transitions. [2019-12-18 17:56:12,747 INFO L78 Accepts]: Start accepts. Automaton has 32230 states and 96827 transitions. Word has length 64 [2019-12-18 17:56:12,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:56:12,747 INFO L462 AbstractCegarLoop]: Abstraction has 32230 states and 96827 transitions. [2019-12-18 17:56:12,747 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:56:12,748 INFO L276 IsEmpty]: Start isEmpty. Operand 32230 states and 96827 transitions. [2019-12-18 17:56:12,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 17:56:12,780 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:56:12,780 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-18 17:56:12,780 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-18 17:56:12,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:56:12,780 INFO L82 PathProgramCache]: Analyzing trace with hash 883747876, now seen corresponding path program 11 times [2019-12-18 17:56:12,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:56:12,780 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176107194] [2019-12-18 17:56:12,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:56:12,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:56:12,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:56:12,888 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176107194] [2019-12-18 17:56:12,888 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:56:12,888 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 17:56:12,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670044713] [2019-12-18 17:56:12,889 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:56:12,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:56:12,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:56:12,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:56:12,889 INFO L87 Difference]: Start difference. First operand 32230 states and 96827 transitions. Second operand 6 states. [2019-12-18 17:56:13,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:56:13,635 INFO L93 Difference]: Finished difference Result 37761 states and 112147 transitions. [2019-12-18 17:56:13,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 17:56:13,636 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2019-12-18 17:56:13,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:56:13,687 INFO L225 Difference]: With dead ends: 37761 [2019-12-18 17:56:13,687 INFO L226 Difference]: Without dead ends: 37761 [2019-12-18 17:56:13,687 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 17:56:13,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37761 states. [2019-12-18 17:56:14,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37761 to 29801. [2019-12-18 17:56:14,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29801 states. [2019-12-18 17:56:14,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29801 states to 29801 states and 89901 transitions. [2019-12-18 17:56:14,196 INFO L78 Accepts]: Start accepts. Automaton has 29801 states and 89901 transitions. Word has length 64 [2019-12-18 17:56:14,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:56:14,197 INFO L462 AbstractCegarLoop]: Abstraction has 29801 states and 89901 transitions. [2019-12-18 17:56:14,197 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:56:14,197 INFO L276 IsEmpty]: Start isEmpty. Operand 29801 states and 89901 transitions. [2019-12-18 17:56:14,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 17:56:14,231 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:56:14,231 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-18 17:56:14,231 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-18 17:56:14,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:56:14,232 INFO L82 PathProgramCache]: Analyzing trace with hash 81413226, now seen corresponding path program 12 times [2019-12-18 17:56:14,232 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:56:14,232 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371212917] [2019-12-18 17:56:14,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:56:14,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:56:14,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:56:14,358 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371212917] [2019-12-18 17:56:14,358 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:56:14,358 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 17:56:14,358 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526061475] [2019-12-18 17:56:14,359 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 17:56:14,359 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:56:14,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 17:56:14,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-18 17:56:14,359 INFO L87 Difference]: Start difference. First operand 29801 states and 89901 transitions. Second operand 9 states. [2019-12-18 17:56:16,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:56:16,516 INFO L93 Difference]: Finished difference Result 43598 states and 131012 transitions. [2019-12-18 17:56:16,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 17:56:16,516 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-18 17:56:16,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:56:16,569 INFO L225 Difference]: With dead ends: 43598 [2019-12-18 17:56:16,569 INFO L226 Difference]: Without dead ends: 43598 [2019-12-18 17:56:16,569 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=126, Invalid=524, Unknown=0, NotChecked=0, Total=650 [2019-12-18 17:56:16,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43598 states. [2019-12-18 17:56:17,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43598 to 30110. [2019-12-18 17:56:17,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30110 states. [2019-12-18 17:56:17,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30110 states to 30110 states and 90814 transitions. [2019-12-18 17:56:17,092 INFO L78 Accepts]: Start accepts. Automaton has 30110 states and 90814 transitions. Word has length 64 [2019-12-18 17:56:17,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:56:17,092 INFO L462 AbstractCegarLoop]: Abstraction has 30110 states and 90814 transitions. [2019-12-18 17:56:17,092 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 17:56:17,092 INFO L276 IsEmpty]: Start isEmpty. Operand 30110 states and 90814 transitions. [2019-12-18 17:56:17,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 17:56:17,121 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:56:17,121 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-18 17:56:17,121 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-18 17:56:17,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:56:17,121 INFO L82 PathProgramCache]: Analyzing trace with hash 871311026, now seen corresponding path program 13 times [2019-12-18 17:56:17,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:56:17,121 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704414490] [2019-12-18 17:56:17,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:56:17,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:56:17,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:56:17,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704414490] [2019-12-18 17:56:17,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:56:17,208 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 17:56:17,208 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640953880] [2019-12-18 17:56:17,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:56:17,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:56:17,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:56:17,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:56:17,209 INFO L87 Difference]: Start difference. First operand 30110 states and 90814 transitions. Second operand 6 states. [2019-12-18 17:56:18,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:56:18,055 INFO L93 Difference]: Finished difference Result 39649 states and 117454 transitions. [2019-12-18 17:56:18,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 17:56:18,055 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2019-12-18 17:56:18,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:56:18,106 INFO L225 Difference]: With dead ends: 39649 [2019-12-18 17:56:18,106 INFO L226 Difference]: Without dead ends: 39397 [2019-12-18 17:56:18,107 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 17:56:18,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39397 states. [2019-12-18 17:56:18,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39397 to 32288. [2019-12-18 17:56:18,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32288 states. [2019-12-18 17:56:18,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32288 states to 32288 states and 97005 transitions. [2019-12-18 17:56:18,625 INFO L78 Accepts]: Start accepts. Automaton has 32288 states and 97005 transitions. Word has length 64 [2019-12-18 17:56:18,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:56:18,626 INFO L462 AbstractCegarLoop]: Abstraction has 32288 states and 97005 transitions. [2019-12-18 17:56:18,626 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:56:18,626 INFO L276 IsEmpty]: Start isEmpty. Operand 32288 states and 97005 transitions. [2019-12-18 17:56:18,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 17:56:18,660 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:56:18,660 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-18 17:56:18,660 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:56:18,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:56:18,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1291874674, now seen corresponding path program 14 times [2019-12-18 17:56:18,660 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:56:18,661 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237200587] [2019-12-18 17:56:18,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:56:18,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:56:18,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:56:18,807 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237200587] [2019-12-18 17:56:18,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:56:18,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 17:56:18,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288371733] [2019-12-18 17:56:18,808 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 17:56:18,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:56:18,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 17:56:18,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-18 17:56:18,809 INFO L87 Difference]: Start difference. First operand 32288 states and 97005 transitions. Second operand 8 states. [2019-12-18 17:56:19,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:56:19,942 INFO L93 Difference]: Finished difference Result 38601 states and 114597 transitions. [2019-12-18 17:56:19,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 17:56:19,943 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 64 [2019-12-18 17:56:19,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:56:19,993 INFO L225 Difference]: With dead ends: 38601 [2019-12-18 17:56:19,993 INFO L226 Difference]: Without dead ends: 38601 [2019-12-18 17:56:19,994 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 17:56:20,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38601 states. [2019-12-18 17:56:20,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38601 to 30249. [2019-12-18 17:56:20,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30249 states. [2019-12-18 17:56:20,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30249 states to 30249 states and 91166 transitions. [2019-12-18 17:56:20,792 INFO L78 Accepts]: Start accepts. Automaton has 30249 states and 91166 transitions. Word has length 64 [2019-12-18 17:56:20,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:56:20,792 INFO L462 AbstractCegarLoop]: Abstraction has 30249 states and 91166 transitions. [2019-12-18 17:56:20,792 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 17:56:20,792 INFO L276 IsEmpty]: Start isEmpty. Operand 30249 states and 91166 transitions. [2019-12-18 17:56:20,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 17:56:20,822 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:56:20,822 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-18 17:56:20,823 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:56:20,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:56:20,823 INFO L82 PathProgramCache]: Analyzing trace with hash 305875630, now seen corresponding path program 15 times [2019-12-18 17:56:20,823 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:56:20,823 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696597175] [2019-12-18 17:56:20,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:56:20,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:56:20,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:56:20,911 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696597175] [2019-12-18 17:56:20,911 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:56:20,912 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 17:56:20,912 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151502490] [2019-12-18 17:56:20,912 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 17:56:20,912 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:56:20,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 17:56:20,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:56:20,913 INFO L87 Difference]: Start difference. First operand 30249 states and 91166 transitions. Second operand 7 states. [2019-12-18 17:56:21,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:56:21,764 INFO L93 Difference]: Finished difference Result 55831 states and 165057 transitions. [2019-12-18 17:56:21,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 17:56:21,765 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 17:56:21,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:56:21,845 INFO L225 Difference]: With dead ends: 55831 [2019-12-18 17:56:21,845 INFO L226 Difference]: Without dead ends: 55611 [2019-12-18 17:56:21,845 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-12-18 17:56:21,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55611 states. [2019-12-18 17:56:22,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55611 to 33451. [2019-12-18 17:56:22,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33451 states. [2019-12-18 17:56:22,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33451 states to 33451 states and 100571 transitions. [2019-12-18 17:56:22,505 INFO L78 Accepts]: Start accepts. Automaton has 33451 states and 100571 transitions. Word has length 64 [2019-12-18 17:56:22,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:56:22,506 INFO L462 AbstractCegarLoop]: Abstraction has 33451 states and 100571 transitions. [2019-12-18 17:56:22,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 17:56:22,506 INFO L276 IsEmpty]: Start isEmpty. Operand 33451 states and 100571 transitions. [2019-12-18 17:56:22,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 17:56:22,541 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:56:22,541 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-18 17:56:22,541 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:56:22,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:56:22,541 INFO L82 PathProgramCache]: Analyzing trace with hash -1461620952, now seen corresponding path program 16 times [2019-12-18 17:56:22,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:56:22,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872928852] [2019-12-18 17:56:22,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:56:22,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:56:22,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:56:22,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872928852] [2019-12-18 17:56:22,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:56:22,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:56:22,582 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955541551] [2019-12-18 17:56:22,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:56:22,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:56:22,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:56:22,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:56:22,583 INFO L87 Difference]: Start difference. First operand 33451 states and 100571 transitions. Second operand 3 states. [2019-12-18 17:56:22,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:56:22,691 INFO L93 Difference]: Finished difference Result 26167 states and 77734 transitions. [2019-12-18 17:56:22,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:56:22,691 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 17:56:22,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:56:22,738 INFO L225 Difference]: With dead ends: 26167 [2019-12-18 17:56:22,738 INFO L226 Difference]: Without dead ends: 26167 [2019-12-18 17:56:22,739 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:56:22,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26167 states. [2019-12-18 17:56:23,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26167 to 25397. [2019-12-18 17:56:23,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25397 states. [2019-12-18 17:56:23,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25397 states to 25397 states and 75368 transitions. [2019-12-18 17:56:23,356 INFO L78 Accepts]: Start accepts. Automaton has 25397 states and 75368 transitions. Word has length 64 [2019-12-18 17:56:23,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:56:23,356 INFO L462 AbstractCegarLoop]: Abstraction has 25397 states and 75368 transitions. [2019-12-18 17:56:23,356 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:56:23,357 INFO L276 IsEmpty]: Start isEmpty. Operand 25397 states and 75368 transitions. [2019-12-18 17:56:23,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 17:56:23,392 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:56:23,392 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-18 17:56:23,393 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:56:23,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:56:23,393 INFO L82 PathProgramCache]: Analyzing trace with hash -436231330, now seen corresponding path program 1 times [2019-12-18 17:56:23,393 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:56:23,393 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362302913] [2019-12-18 17:56:23,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:56:23,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:56:23,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:56:23,466 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362302913] [2019-12-18 17:56:23,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:56:23,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 17:56:23,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378983376] [2019-12-18 17:56:23,467 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:56:23,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:56:23,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:56:23,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:56:23,468 INFO L87 Difference]: Start difference. First operand 25397 states and 75368 transitions. Second operand 6 states. [2019-12-18 17:56:24,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:56:24,526 INFO L93 Difference]: Finished difference Result 35173 states and 103285 transitions. [2019-12-18 17:56:24,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 17:56:24,526 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-18 17:56:24,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:56:24,573 INFO L225 Difference]: With dead ends: 35173 [2019-12-18 17:56:24,573 INFO L226 Difference]: Without dead ends: 35173 [2019-12-18 17:56:24,573 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-18 17:56:24,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35173 states. [2019-12-18 17:56:24,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35173 to 27514. [2019-12-18 17:56:24,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27514 states. [2019-12-18 17:56:25,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27514 states to 27514 states and 81604 transitions. [2019-12-18 17:56:25,036 INFO L78 Accepts]: Start accepts. Automaton has 27514 states and 81604 transitions. Word has length 65 [2019-12-18 17:56:25,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:56:25,037 INFO L462 AbstractCegarLoop]: Abstraction has 27514 states and 81604 transitions. [2019-12-18 17:56:25,037 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:56:25,037 INFO L276 IsEmpty]: Start isEmpty. Operand 27514 states and 81604 transitions. [2019-12-18 17:56:25,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 17:56:25,067 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:56:25,067 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-18 17:56:25,067 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:56:25,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:56:25,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1843412020, now seen corresponding path program 2 times [2019-12-18 17:56:25,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:56:25,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736130115] [2019-12-18 17:56:25,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:56:25,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:56:25,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:56:25,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736130115] [2019-12-18 17:56:25,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:56:25,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 17:56:25,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867302842] [2019-12-18 17:56:25,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 17:56:25,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:56:25,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 17:56:25,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-12-18 17:56:25,441 INFO L87 Difference]: Start difference. First operand 27514 states and 81604 transitions. Second operand 15 states. [2019-12-18 17:56:29,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:56:29,712 INFO L93 Difference]: Finished difference Result 47275 states and 138681 transitions. [2019-12-18 17:56:29,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-12-18 17:56:29,713 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 65 [2019-12-18 17:56:29,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:56:29,762 INFO L225 Difference]: With dead ends: 47275 [2019-12-18 17:56:29,762 INFO L226 Difference]: Without dead ends: 37317 [2019-12-18 17:56:29,763 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 757 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=438, Invalid=2214, Unknown=0, NotChecked=0, Total=2652 [2019-12-18 17:56:29,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37317 states. [2019-12-18 17:56:30,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37317 to 28469. [2019-12-18 17:56:30,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28469 states. [2019-12-18 17:56:30,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28469 states to 28469 states and 84002 transitions. [2019-12-18 17:56:30,666 INFO L78 Accepts]: Start accepts. Automaton has 28469 states and 84002 transitions. Word has length 65 [2019-12-18 17:56:30,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:56:30,667 INFO L462 AbstractCegarLoop]: Abstraction has 28469 states and 84002 transitions. [2019-12-18 17:56:30,667 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 17:56:30,667 INFO L276 IsEmpty]: Start isEmpty. Operand 28469 states and 84002 transitions. [2019-12-18 17:56:30,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 17:56:30,692 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:56:30,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-18 17:56:30,692 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:56:30,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:56:30,693 INFO L82 PathProgramCache]: Analyzing trace with hash 306778196, now seen corresponding path program 3 times [2019-12-18 17:56:30,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:56:30,693 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903573701] [2019-12-18 17:56:30,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:56:30,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:56:30,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:56:30,869 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903573701] [2019-12-18 17:56:30,870 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:56:30,870 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 17:56:30,870 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884902027] [2019-12-18 17:56:30,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 17:56:30,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:56:30,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 17:56:30,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 17:56:30,871 INFO L87 Difference]: Start difference. First operand 28469 states and 84002 transitions. Second operand 11 states. [2019-12-18 17:56:32,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:56:32,155 INFO L93 Difference]: Finished difference Result 66225 states and 196096 transitions. [2019-12-18 17:56:32,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-18 17:56:32,155 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-12-18 17:56:32,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:56:32,243 INFO L225 Difference]: With dead ends: 66225 [2019-12-18 17:56:32,243 INFO L226 Difference]: Without dead ends: 61214 [2019-12-18 17:56:32,243 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=802, Unknown=0, NotChecked=0, Total=992 [2019-12-18 17:56:32,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61214 states. [2019-12-18 17:56:32,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61214 to 33701. [2019-12-18 17:56:32,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33701 states. [2019-12-18 17:56:32,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33701 states to 33701 states and 99376 transitions. [2019-12-18 17:56:32,964 INFO L78 Accepts]: Start accepts. Automaton has 33701 states and 99376 transitions. Word has length 65 [2019-12-18 17:56:32,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:56:32,964 INFO L462 AbstractCegarLoop]: Abstraction has 33701 states and 99376 transitions. [2019-12-18 17:56:32,965 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 17:56:32,965 INFO L276 IsEmpty]: Start isEmpty. Operand 33701 states and 99376 transitions. [2019-12-18 17:56:33,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 17:56:33,006 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:56:33,006 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-18 17:56:33,006 INFO L410 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:56:33,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:56:33,006 INFO L82 PathProgramCache]: Analyzing trace with hash 1341753566, now seen corresponding path program 4 times [2019-12-18 17:56:33,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:56:33,007 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384723819] [2019-12-18 17:56:33,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:56:33,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:56:33,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:56:33,110 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384723819] [2019-12-18 17:56:33,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:56:33,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 17:56:33,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91392715] [2019-12-18 17:56:33,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 17:56:33,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:56:33,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 17:56:33,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-18 17:56:33,113 INFO L87 Difference]: Start difference. First operand 33701 states and 99376 transitions. Second operand 9 states. [2019-12-18 17:56:34,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:56:34,650 INFO L93 Difference]: Finished difference Result 55635 states and 162845 transitions. [2019-12-18 17:56:34,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 17:56:34,650 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-18 17:56:34,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:56:34,720 INFO L225 Difference]: With dead ends: 55635 [2019-12-18 17:56:34,720 INFO L226 Difference]: Without dead ends: 49602 [2019-12-18 17:56:34,721 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2019-12-18 17:56:34,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49602 states. [2019-12-18 17:56:35,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49602 to 32820. [2019-12-18 17:56:35,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32820 states. [2019-12-18 17:56:35,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32820 states to 32820 states and 96298 transitions. [2019-12-18 17:56:35,631 INFO L78 Accepts]: Start accepts. Automaton has 32820 states and 96298 transitions. Word has length 65 [2019-12-18 17:56:35,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:56:35,631 INFO L462 AbstractCegarLoop]: Abstraction has 32820 states and 96298 transitions. [2019-12-18 17:56:35,631 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 17:56:35,631 INFO L276 IsEmpty]: Start isEmpty. Operand 32820 states and 96298 transitions. [2019-12-18 17:56:35,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 17:56:35,662 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:56:35,662 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-18 17:56:35,663 INFO L410 AbstractCegarLoop]: === Iteration 38 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:56:35,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:56:35,663 INFO L82 PathProgramCache]: Analyzing trace with hash -1782581384, now seen corresponding path program 5 times [2019-12-18 17:56:35,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:56:35,663 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507929828] [2019-12-18 17:56:35,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:56:35,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:56:35,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:56:35,820 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507929828] [2019-12-18 17:56:35,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:56:35,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 17:56:35,820 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940264705] [2019-12-18 17:56:35,820 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 17:56:35,820 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:56:35,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 17:56:35,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 17:56:35,821 INFO L87 Difference]: Start difference. First operand 32820 states and 96298 transitions. Second operand 11 states. [2019-12-18 17:56:37,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:56:37,277 INFO L93 Difference]: Finished difference Result 39642 states and 115409 transitions. [2019-12-18 17:56:37,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 17:56:37,277 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-12-18 17:56:37,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:56:37,328 INFO L225 Difference]: With dead ends: 39642 [2019-12-18 17:56:37,328 INFO L226 Difference]: Without dead ends: 38444 [2019-12-18 17:56:37,329 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2019-12-18 17:56:37,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38444 states. [2019-12-18 17:56:37,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38444 to 32931. [2019-12-18 17:56:37,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32931 states. [2019-12-18 17:56:37,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32931 states to 32931 states and 96535 transitions. [2019-12-18 17:56:37,850 INFO L78 Accepts]: Start accepts. Automaton has 32931 states and 96535 transitions. Word has length 65 [2019-12-18 17:56:37,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:56:37,850 INFO L462 AbstractCegarLoop]: Abstraction has 32931 states and 96535 transitions. [2019-12-18 17:56:37,850 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 17:56:37,850 INFO L276 IsEmpty]: Start isEmpty. Operand 32931 states and 96535 transitions. [2019-12-18 17:56:37,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 17:56:37,885 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:56:37,885 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-18 17:56:37,885 INFO L410 AbstractCegarLoop]: === Iteration 39 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:56:37,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:56:37,886 INFO L82 PathProgramCache]: Analyzing trace with hash -1407949658, now seen corresponding path program 6 times [2019-12-18 17:56:37,886 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:56:37,886 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31421076] [2019-12-18 17:56:37,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:56:37,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:56:37,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:56:37,969 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31421076] [2019-12-18 17:56:37,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:56:37,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 17:56:37,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264668299] [2019-12-18 17:56:37,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 17:56:37,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:56:37,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 17:56:37,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-18 17:56:37,970 INFO L87 Difference]: Start difference. First operand 32931 states and 96535 transitions. Second operand 9 states. [2019-12-18 17:56:39,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:56:39,114 INFO L93 Difference]: Finished difference Result 51665 states and 150804 transitions. [2019-12-18 17:56:39,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 17:56:39,114 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-18 17:56:39,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:56:39,179 INFO L225 Difference]: With dead ends: 51665 [2019-12-18 17:56:39,179 INFO L226 Difference]: Without dead ends: 47723 [2019-12-18 17:56:39,180 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2019-12-18 17:56:39,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47723 states. [2019-12-18 17:56:39,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47723 to 31303. [2019-12-18 17:56:39,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31303 states. [2019-12-18 17:56:39,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31303 states to 31303 states and 91513 transitions. [2019-12-18 17:56:39,768 INFO L78 Accepts]: Start accepts. Automaton has 31303 states and 91513 transitions. Word has length 65 [2019-12-18 17:56:39,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:56:39,769 INFO L462 AbstractCegarLoop]: Abstraction has 31303 states and 91513 transitions. [2019-12-18 17:56:39,769 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 17:56:39,769 INFO L276 IsEmpty]: Start isEmpty. Operand 31303 states and 91513 transitions. [2019-12-18 17:56:39,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 17:56:39,806 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:56:39,806 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-18 17:56:39,806 INFO L410 AbstractCegarLoop]: === Iteration 40 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:56:39,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:56:39,806 INFO L82 PathProgramCache]: Analyzing trace with hash -834836066, now seen corresponding path program 7 times [2019-12-18 17:56:39,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:56:39,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302694209] [2019-12-18 17:56:39,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:56:39,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:56:39,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:56:39,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302694209] [2019-12-18 17:56:39,937 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:56:39,937 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 17:56:39,937 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235279980] [2019-12-18 17:56:39,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 17:56:39,938 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:56:39,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 17:56:39,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-18 17:56:39,938 INFO L87 Difference]: Start difference. First operand 31303 states and 91513 transitions. Second operand 8 states. [2019-12-18 17:56:41,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:56:41,144 INFO L93 Difference]: Finished difference Result 41669 states and 119557 transitions. [2019-12-18 17:56:41,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 17:56:41,145 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-18 17:56:41,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:56:41,196 INFO L225 Difference]: With dead ends: 41669 [2019-12-18 17:56:41,197 INFO L226 Difference]: Without dead ends: 41669 [2019-12-18 17:56:41,197 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-12-18 17:56:41,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41669 states. [2019-12-18 17:56:41,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41669 to 29783. [2019-12-18 17:56:41,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29783 states. [2019-12-18 17:56:41,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29783 states to 29783 states and 86395 transitions. [2019-12-18 17:56:41,697 INFO L78 Accepts]: Start accepts. Automaton has 29783 states and 86395 transitions. Word has length 65 [2019-12-18 17:56:41,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:56:41,697 INFO L462 AbstractCegarLoop]: Abstraction has 29783 states and 86395 transitions. [2019-12-18 17:56:41,697 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 17:56:41,697 INFO L276 IsEmpty]: Start isEmpty. Operand 29783 states and 86395 transitions. [2019-12-18 17:56:41,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 17:56:41,724 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:56:41,724 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-18 17:56:41,724 INFO L410 AbstractCegarLoop]: === Iteration 41 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:56:41,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:56:41,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1988412098, now seen corresponding path program 8 times [2019-12-18 17:56:41,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:56:41,725 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175071619] [2019-12-18 17:56:41,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:56:41,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:56:41,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:56:41,780 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175071619] [2019-12-18 17:56:41,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:56:41,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:56:41,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788845017] [2019-12-18 17:56:41,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:56:41,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:56:41,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:56:41,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:56:41,781 INFO L87 Difference]: Start difference. First operand 29783 states and 86395 transitions. Second operand 3 states. [2019-12-18 17:56:41,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:56:41,875 INFO L93 Difference]: Finished difference Result 29783 states and 86394 transitions. [2019-12-18 17:56:41,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:56:41,876 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 17:56:41,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:56:41,914 INFO L225 Difference]: With dead ends: 29783 [2019-12-18 17:56:41,914 INFO L226 Difference]: Without dead ends: 29783 [2019-12-18 17:56:41,914 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:56:42,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29783 states. [2019-12-18 17:56:42,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29783 to 24227. [2019-12-18 17:56:42,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24227 states. [2019-12-18 17:56:42,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24227 states to 24227 states and 70663 transitions. [2019-12-18 17:56:42,311 INFO L78 Accepts]: Start accepts. Automaton has 24227 states and 70663 transitions. Word has length 65 [2019-12-18 17:56:42,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:56:42,312 INFO L462 AbstractCegarLoop]: Abstraction has 24227 states and 70663 transitions. [2019-12-18 17:56:42,312 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:56:42,312 INFO L276 IsEmpty]: Start isEmpty. Operand 24227 states and 70663 transitions. [2019-12-18 17:56:42,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 17:56:42,334 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:56:42,334 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-18 17:56:42,335 INFO L410 AbstractCegarLoop]: === Iteration 42 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:56:42,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:56:42,335 INFO L82 PathProgramCache]: Analyzing trace with hash -424379593, now seen corresponding path program 1 times [2019-12-18 17:56:42,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:56:42,335 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749715095] [2019-12-18 17:56:42,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:56:42,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:56:42,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:56:42,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749715095] [2019-12-18 17:56:42,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:56:42,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 17:56:42,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252949286] [2019-12-18 17:56:42,429 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 17:56:42,429 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:56:42,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 17:56:42,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:56:42,429 INFO L87 Difference]: Start difference. First operand 24227 states and 70663 transitions. Second operand 7 states. [2019-12-18 17:56:43,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:56:43,962 INFO L93 Difference]: Finished difference Result 32457 states and 93601 transitions. [2019-12-18 17:56:43,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-18 17:56:43,963 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-18 17:56:43,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:56:44,006 INFO L225 Difference]: With dead ends: 32457 [2019-12-18 17:56:44,006 INFO L226 Difference]: Without dead ends: 32457 [2019-12-18 17:56:44,006 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2019-12-18 17:56:44,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32457 states. [2019-12-18 17:56:44,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32457 to 23645. [2019-12-18 17:56:44,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23645 states. [2019-12-18 17:56:44,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23645 states to 23645 states and 69051 transitions. [2019-12-18 17:56:44,424 INFO L78 Accepts]: Start accepts. Automaton has 23645 states and 69051 transitions. Word has length 66 [2019-12-18 17:56:44,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:56:44,424 INFO L462 AbstractCegarLoop]: Abstraction has 23645 states and 69051 transitions. [2019-12-18 17:56:44,424 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 17:56:44,424 INFO L276 IsEmpty]: Start isEmpty. Operand 23645 states and 69051 transitions. [2019-12-18 17:56:44,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 17:56:44,450 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:56:44,450 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-18 17:56:44,451 INFO L410 AbstractCegarLoop]: === Iteration 43 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:56:44,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:56:44,451 INFO L82 PathProgramCache]: Analyzing trace with hash -721618659, now seen corresponding path program 2 times [2019-12-18 17:56:44,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:56:44,451 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371696671] [2019-12-18 17:56:44,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:56:44,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:56:44,767 WARN L192 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 7 [2019-12-18 17:56:44,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:56:44,796 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371696671] [2019-12-18 17:56:44,796 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:56:44,796 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 17:56:44,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014343879] [2019-12-18 17:56:44,797 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 17:56:44,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:56:44,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 17:56:44,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 17:56:44,797 INFO L87 Difference]: Start difference. First operand 23645 states and 69051 transitions. Second operand 11 states. [2019-12-18 17:56:45,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:56:45,787 INFO L93 Difference]: Finished difference Result 41306 states and 121182 transitions. [2019-12-18 17:56:45,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 17:56:45,788 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-18 17:56:45,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:56:45,836 INFO L225 Difference]: With dead ends: 41306 [2019-12-18 17:56:45,837 INFO L226 Difference]: Without dead ends: 35096 [2019-12-18 17:56:45,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2019-12-18 17:56:45,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35096 states. [2019-12-18 17:56:46,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35096 to 19927. [2019-12-18 17:56:46,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19927 states. [2019-12-18 17:56:46,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19927 states to 19927 states and 58792 transitions. [2019-12-18 17:56:46,237 INFO L78 Accepts]: Start accepts. Automaton has 19927 states and 58792 transitions. Word has length 66 [2019-12-18 17:56:46,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:56:46,237 INFO L462 AbstractCegarLoop]: Abstraction has 19927 states and 58792 transitions. [2019-12-18 17:56:46,237 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 17:56:46,237 INFO L276 IsEmpty]: Start isEmpty. Operand 19927 states and 58792 transitions. [2019-12-18 17:56:46,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 17:56:46,259 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:56:46,259 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-18 17:56:46,259 INFO L410 AbstractCegarLoop]: === Iteration 44 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:56:46,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:56:46,259 INFO L82 PathProgramCache]: Analyzing trace with hash 103775479, now seen corresponding path program 3 times [2019-12-18 17:56:46,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:56:46,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320851769] [2019-12-18 17:56:46,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:56:46,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:56:46,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:56:46,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320851769] [2019-12-18 17:56:46,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:56:46,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 17:56:46,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276428448] [2019-12-18 17:56:46,423 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 17:56:46,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:56:46,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 17:56:46,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-12-18 17:56:46,423 INFO L87 Difference]: Start difference. First operand 19927 states and 58792 transitions. Second operand 11 states. [2019-12-18 17:56:49,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:56:49,080 INFO L93 Difference]: Finished difference Result 32862 states and 95615 transitions. [2019-12-18 17:56:49,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-18 17:56:49,081 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-18 17:56:49,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:56:49,124 INFO L225 Difference]: With dead ends: 32862 [2019-12-18 17:56:49,124 INFO L226 Difference]: Without dead ends: 32862 [2019-12-18 17:56:49,124 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=126, Invalid=524, Unknown=0, NotChecked=0, Total=650 [2019-12-18 17:56:49,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32862 states. [2019-12-18 17:56:49,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32862 to 20096. [2019-12-18 17:56:49,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20096 states. [2019-12-18 17:56:49,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20096 states to 20096 states and 59329 transitions. [2019-12-18 17:56:49,510 INFO L78 Accepts]: Start accepts. Automaton has 20096 states and 59329 transitions. Word has length 66 [2019-12-18 17:56:49,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:56:49,510 INFO L462 AbstractCegarLoop]: Abstraction has 20096 states and 59329 transitions. [2019-12-18 17:56:49,510 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 17:56:49,510 INFO L276 IsEmpty]: Start isEmpty. Operand 20096 states and 59329 transitions. [2019-12-18 17:56:49,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 17:56:49,529 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:56:49,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-18 17:56:49,530 INFO L410 AbstractCegarLoop]: === Iteration 45 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:56:49,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:56:49,530 INFO L82 PathProgramCache]: Analyzing trace with hash 328971281, now seen corresponding path program 4 times [2019-12-18 17:56:49,530 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:56:49,530 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32077967] [2019-12-18 17:56:49,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:56:49,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:56:49,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:56:49,610 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32077967] [2019-12-18 17:56:49,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:56:49,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:56:49,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753899471] [2019-12-18 17:56:49,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:56:49,611 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:56:49,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:56:49,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:56:49,612 INFO L87 Difference]: Start difference. First operand 20096 states and 59329 transitions. Second operand 4 states. [2019-12-18 17:56:49,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:56:49,768 INFO L93 Difference]: Finished difference Result 23665 states and 69977 transitions. [2019-12-18 17:56:49,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:56:49,769 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-18 17:56:49,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:56:49,808 INFO L225 Difference]: With dead ends: 23665 [2019-12-18 17:56:49,809 INFO L226 Difference]: Without dead ends: 23665 [2019-12-18 17:56:49,809 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:56:49,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23665 states. [2019-12-18 17:56:50,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23665 to 17966. [2019-12-18 17:56:50,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17966 states. [2019-12-18 17:56:50,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17966 states to 17966 states and 53429 transitions. [2019-12-18 17:56:50,135 INFO L78 Accepts]: Start accepts. Automaton has 17966 states and 53429 transitions. Word has length 66 [2019-12-18 17:56:50,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:56:50,136 INFO L462 AbstractCegarLoop]: Abstraction has 17966 states and 53429 transitions. [2019-12-18 17:56:50,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:56:50,136 INFO L276 IsEmpty]: Start isEmpty. Operand 17966 states and 53429 transitions. [2019-12-18 17:56:50,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 17:56:50,155 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:56:50,155 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-18 17:56:50,155 INFO L410 AbstractCegarLoop]: === Iteration 46 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:56:50,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:56:50,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1945562630, now seen corresponding path program 1 times [2019-12-18 17:56:50,156 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:56:50,156 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834314412] [2019-12-18 17:56:50,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:56:50,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:56:50,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:56:50,754 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834314412] [2019-12-18 17:56:50,754 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:56:50,754 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 17:56:50,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015300356] [2019-12-18 17:56:50,755 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 17:56:50,755 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:56:50,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 17:56:50,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2019-12-18 17:56:50,756 INFO L87 Difference]: Start difference. First operand 17966 states and 53429 transitions. Second operand 17 states. [2019-12-18 17:56:53,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:56:53,864 INFO L93 Difference]: Finished difference Result 23091 states and 67615 transitions. [2019-12-18 17:56:53,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-18 17:56:53,865 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 67 [2019-12-18 17:56:53,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:56:53,895 INFO L225 Difference]: With dead ends: 23091 [2019-12-18 17:56:53,895 INFO L226 Difference]: Without dead ends: 22620 [2019-12-18 17:56:53,896 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 424 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=321, Invalid=1401, Unknown=0, NotChecked=0, Total=1722 [2019-12-18 17:56:53,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22620 states. [2019-12-18 17:56:54,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22620 to 17712. [2019-12-18 17:56:54,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17712 states. [2019-12-18 17:56:54,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17712 states to 17712 states and 52785 transitions. [2019-12-18 17:56:54,188 INFO L78 Accepts]: Start accepts. Automaton has 17712 states and 52785 transitions. Word has length 67 [2019-12-18 17:56:54,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:56:54,188 INFO L462 AbstractCegarLoop]: Abstraction has 17712 states and 52785 transitions. [2019-12-18 17:56:54,188 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 17:56:54,188 INFO L276 IsEmpty]: Start isEmpty. Operand 17712 states and 52785 transitions. [2019-12-18 17:56:54,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 17:56:54,207 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:56:54,207 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-18 17:56:54,207 INFO L410 AbstractCegarLoop]: === Iteration 47 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:56:54,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:56:54,207 INFO L82 PathProgramCache]: Analyzing trace with hash 121505500, now seen corresponding path program 2 times [2019-12-18 17:56:54,207 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:56:54,207 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105233820] [2019-12-18 17:56:54,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:56:54,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:56:54,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:56:54,340 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105233820] [2019-12-18 17:56:54,340 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:56:54,340 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 17:56:54,340 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143727014] [2019-12-18 17:56:54,341 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 17:56:54,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:56:54,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 17:56:54,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 17:56:54,341 INFO L87 Difference]: Start difference. First operand 17712 states and 52785 transitions. Second operand 9 states. [2019-12-18 17:56:56,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:56:56,420 INFO L93 Difference]: Finished difference Result 29059 states and 85132 transitions. [2019-12-18 17:56:56,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-18 17:56:56,421 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2019-12-18 17:56:56,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:56:56,459 INFO L225 Difference]: With dead ends: 29059 [2019-12-18 17:56:56,459 INFO L226 Difference]: Without dead ends: 29059 [2019-12-18 17:56:56,459 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=488, Unknown=0, NotChecked=0, Total=600 [2019-12-18 17:56:56,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29059 states. [2019-12-18 17:56:56,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29059 to 19174. [2019-12-18 17:56:56,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19174 states. [2019-12-18 17:56:56,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19174 states to 19174 states and 57031 transitions. [2019-12-18 17:56:56,822 INFO L78 Accepts]: Start accepts. Automaton has 19174 states and 57031 transitions. Word has length 67 [2019-12-18 17:56:56,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:56:56,822 INFO L462 AbstractCegarLoop]: Abstraction has 19174 states and 57031 transitions. [2019-12-18 17:56:56,822 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 17:56:56,822 INFO L276 IsEmpty]: Start isEmpty. Operand 19174 states and 57031 transitions. [2019-12-18 17:56:56,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 17:56:56,842 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:56:56,843 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-18 17:56:56,843 INFO L410 AbstractCegarLoop]: === Iteration 48 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:56:56,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:56:56,843 INFO L82 PathProgramCache]: Analyzing trace with hash 190726530, now seen corresponding path program 3 times [2019-12-18 17:56:56,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:56:56,843 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654834148] [2019-12-18 17:56:56,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:56:56,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:56:56,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:56:56,953 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654834148] [2019-12-18 17:56:56,953 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:56:56,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 17:56:56,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078131215] [2019-12-18 17:56:56,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:56:56,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:56:56,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:56:56,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:56:56,955 INFO L87 Difference]: Start difference. First operand 19174 states and 57031 transitions. Second operand 5 states. [2019-12-18 17:56:57,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:56:57,152 INFO L93 Difference]: Finished difference Result 19058 states and 56413 transitions. [2019-12-18 17:56:57,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 17:56:57,153 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-12-18 17:56:57,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:56:57,190 INFO L225 Difference]: With dead ends: 19058 [2019-12-18 17:56:57,190 INFO L226 Difference]: Without dead ends: 19058 [2019-12-18 17:56:57,191 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:56:57,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19058 states. [2019-12-18 17:56:57,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19058 to 16862. [2019-12-18 17:56:57,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16862 states. [2019-12-18 17:56:57,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16862 states to 16862 states and 49878 transitions. [2019-12-18 17:56:57,528 INFO L78 Accepts]: Start accepts. Automaton has 16862 states and 49878 transitions. Word has length 67 [2019-12-18 17:56:57,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:56:57,528 INFO L462 AbstractCegarLoop]: Abstraction has 16862 states and 49878 transitions. [2019-12-18 17:56:57,528 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:56:57,528 INFO L276 IsEmpty]: Start isEmpty. Operand 16862 states and 49878 transitions. [2019-12-18 17:56:57,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 17:56:57,545 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:56:57,545 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-18 17:56:57,545 INFO L410 AbstractCegarLoop]: === Iteration 49 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:56:57,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:56:57,545 INFO L82 PathProgramCache]: Analyzing trace with hash -778064925, now seen corresponding path program 1 times [2019-12-18 17:56:57,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:56:57,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450617929] [2019-12-18 17:56:57,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:56:57,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 17:56:57,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 17:56:57,682 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 17:56:57,682 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 17:56:57,687 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [891] [891] ULTIMATE.startENTRY-->L818: Formula: (let ((.cse0 (store |v_#valid_82| 0 0))) (and (= v_~z$r_buff0_thd0~0_144 0) (= v_~z$r_buff0_thd1~0_230 0) (= v_~z$w_buff0_used~0_947 0) (= v_~z$r_buff1_thd1~0_185 0) (= v_~z$read_delayed_var~0.offset_6 0) (= |v_#NULL.offset_7| 0) (= v_~z$w_buff1_used~0_563 0) (= v_~weak$$choice2~0_147 0) (= 0 v_~z$r_buff1_thd3~0_352) (= 0 v_~x~0_159) (< 0 |v_#StackHeapBarrier_17|) (= v_~z$read_delayed~0_6 0) (= v_~z$mem_tmp~0_24 0) (= |v_#valid_80| (store .cse0 |v_ULTIMATE.start_main_~#t1489~0.base_44| 1)) (= v_~z$r_buff0_thd2~0_126 0) (= 0 v_~__unbuffered_p2_EAX~0_47) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1489~0.base_44| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1489~0.base_44|) |v_ULTIMATE.start_main_~#t1489~0.offset_28| 0)) |v_#memory_int_19|) (= v_~z$read_delayed_var~0.base_6 0) (= v_~__unbuffered_cnt~0_155 0) (= |v_ULTIMATE.start_main_~#t1489~0.offset_28| 0) (= v_~z$r_buff1_thd2~0_201 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1489~0.base_44|)) (= 0 v_~z$r_buff0_thd3~0_371) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1489~0.base_44|) (= v_~main$tmp_guard1~0_38 0) (= v_~z$r_buff1_thd0~0_199 0) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t1489~0.base_44| 4) |v_#length_21|) (= 0 |v_#NULL.base_7|) (= 0 v_~weak$$choice0~0_19) (= v_~z$w_buff1~0_328 0) (= v_~z~0_152 0) (= v_~z$w_buff0~0_540 0) (= v_~main$tmp_guard0~0_22 0) (= 0 v_~z$flush_delayed~0_35) (= v_~y~0_49 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_82|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t1490~0.base=|v_ULTIMATE.start_main_~#t1490~0.base_44|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_201, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_59|, ~z$read_delayed~0=v_~z$read_delayed~0_6, ~z$w_buff1~0=v_~z$w_buff1~0_328, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_37|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_38, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_99|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_31|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_75|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_144, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_31|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_199, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_47, ~y~0=v_~y~0_49, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_126, ULTIMATE.start_main_~#t1491~0.base=|v_ULTIMATE.start_main_~#t1491~0.base_25|, ~z$mem_tmp~0=v_~z$mem_tmp~0_24, ULTIMATE.start_main_~#t1489~0.base=|v_ULTIMATE.start_main_~#t1489~0.base_44|, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_19|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_947, ~z$w_buff0~0=v_~z$w_buff0~0_540, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_352, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_563, ULTIMATE.start_main_~#t1491~0.offset=|v_ULTIMATE.start_main_~#t1491~0.offset_18|, ~z$flush_delayed~0=v_~z$flush_delayed~0_35, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, ULTIMATE.start_main_~#t1489~0.offset=|v_ULTIMATE.start_main_~#t1489~0.offset_28|, #NULL.base=|v_#NULL.base_7|, ~weak$$choice0~0=v_~weak$$choice0~0_19, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_26|, #valid=|v_#valid_80|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_185, #memory_int=|v_#memory_int_19|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_371, ULTIMATE.start_main_~#t1490~0.offset=|v_ULTIMATE.start_main_~#t1490~0.offset_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_155, ~z~0=v_~z~0_152, ~weak$$choice2~0=v_~weak$$choice2~0_147, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_230, ~x~0=v_~x~0_159} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1490~0.base, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, ~z$read_delayed~0, ~z$w_buff1~0, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, #length, ~__unbuffered_p2_EAX~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t1491~0.base, ~z$mem_tmp~0, ULTIMATE.start_main_~#t1489~0.base, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ULTIMATE.start_main_~#t1491~0.offset, ~z$flush_delayed~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t1489~0.offset, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_#res, #valid, ~z$r_buff1_thd1~0, #memory_int, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ULTIMATE.start_main_~#t1490~0.offset, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-18 17:56:57,689 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [857] [857] L818-1-->L820: Formula: (and (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1490~0.base_13|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1490~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1490~0.base_13|) |v_ULTIMATE.start_main_~#t1490~0.offset_11| 1)) |v_#memory_int_13|) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t1490~0.base_13| 4) |v_#length_15|) (not (= |v_ULTIMATE.start_main_~#t1490~0.base_13| 0)) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t1490~0.base_13|)) (= (store |v_#valid_37| |v_ULTIMATE.start_main_~#t1490~0.base_13| 1) |v_#valid_36|) (= 0 |v_ULTIMATE.start_main_~#t1490~0.offset_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t1490~0.base=|v_ULTIMATE.start_main_~#t1490~0.base_13|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t1490~0.offset=|v_ULTIMATE.start_main_~#t1490~0.offset_11|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1490~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, ULTIMATE.start_main_~#t1490~0.offset, #length] because there is no mapped edge [2019-12-18 17:56:57,689 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L820-1-->L822: Formula: (and (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1491~0.base_13|)) (not (= 0 |v_ULTIMATE.start_main_~#t1491~0.base_13|)) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1491~0.base_13| 1)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1491~0.base_13| 4)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1491~0.base_13|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1491~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1491~0.base_13|) |v_ULTIMATE.start_main_~#t1491~0.offset_11| 2)) |v_#memory_int_15|) (= 0 |v_ULTIMATE.start_main_~#t1491~0.offset_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_6|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t1491~0.offset=|v_ULTIMATE.start_main_~#t1491~0.offset_11|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1491~0.base=|v_ULTIMATE.start_main_~#t1491~0.base_13|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t1491~0.offset, #length, ULTIMATE.start_main_~#t1491~0.base] because there is no mapped edge [2019-12-18 17:56:57,690 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] P0ENTRY-->L4-3: Formula: (and (= v_~z$w_buff0_used~0_163 v_~z$w_buff1_used~0_112) (= 1 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_14|) (= v_~z$w_buff0~0_38 v_~z$w_buff1~0_37) (= v_P0Thread1of1ForFork0_~arg.base_14 |v_P0Thread1of1ForFork0_#in~arg.base_14|) (= v_~z$w_buff0_used~0_162 1) (= 1 v_~z$w_buff0~0_37) (= v_P0Thread1of1ForFork0_~arg.offset_14 |v_P0Thread1of1ForFork0_#in~arg.offset_14|) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_16 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_14|) (= (mod v_~z$w_buff1_used~0_112 256) 0)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_14|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_163, ~z$w_buff0~0=v_~z$w_buff0~0_38, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_14|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_14|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_162, ~z$w_buff0~0=v_~z$w_buff0~0_37, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_16, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_112, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_14|, ~z$w_buff1~0=v_~z$w_buff1~0_37, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_14, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_14|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_14} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1_used~0, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-18 17:56:57,697 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L784-->L784-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In424919007 256) 0))) (or (and (= ~z$w_buff0~0_In424919007 |P2Thread1of1ForFork2_#t~ite20_Out424919007|) .cse0 (= |P2Thread1of1ForFork2_#t~ite21_Out424919007| |P2Thread1of1ForFork2_#t~ite20_Out424919007|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In424919007 256)))) (or (and .cse1 (= 0 (mod ~z$r_buff1_thd3~0_In424919007 256))) (and (= 0 (mod ~z$w_buff1_used~0_In424919007 256)) .cse1) (= 0 (mod ~z$w_buff0_used~0_In424919007 256))))) (and (= |P2Thread1of1ForFork2_#t~ite20_In424919007| |P2Thread1of1ForFork2_#t~ite20_Out424919007|) (= ~z$w_buff0~0_In424919007 |P2Thread1of1ForFork2_#t~ite21_Out424919007|) (not .cse0)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In424919007, ~z$w_buff0_used~0=~z$w_buff0_used~0_In424919007, P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_In424919007|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In424919007, ~z$w_buff1_used~0=~z$w_buff1_used~0_In424919007, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In424919007, ~weak$$choice2~0=~weak$$choice2~0_In424919007} OutVars{~z$w_buff0~0=~z$w_buff0~0_In424919007, P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out424919007|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In424919007, P2Thread1of1ForFork2_#t~ite21=|P2Thread1of1ForFork2_#t~ite21_Out424919007|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In424919007, ~z$w_buff1_used~0=~z$w_buff1_used~0_In424919007, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In424919007, ~weak$$choice2~0=~weak$$choice2~0_In424919007} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20, P2Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-18 17:56:57,702 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L762-2-->L762-5: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd2~0_In656798829 256) 0)) (.cse2 (= |P1Thread1of1ForFork1_#t~ite10_Out656798829| |P1Thread1of1ForFork1_#t~ite9_Out656798829|)) (.cse0 (= (mod ~z$w_buff1_used~0_In656798829 256) 0))) (or (and (or .cse0 .cse1) .cse2 (= ~z~0_In656798829 |P1Thread1of1ForFork1_#t~ite9_Out656798829|)) (and (not .cse1) .cse2 (= ~z$w_buff1~0_In656798829 |P1Thread1of1ForFork1_#t~ite9_Out656798829|) (not .cse0)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In656798829, ~z$w_buff1_used~0=~z$w_buff1_used~0_In656798829, ~z$w_buff1~0=~z$w_buff1~0_In656798829, ~z~0=~z~0_In656798829} OutVars{P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out656798829|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In656798829, ~z$w_buff1_used~0=~z$w_buff1_used~0_In656798829, P1Thread1of1ForFork1_#t~ite10=|P1Thread1of1ForFork1_#t~ite10_Out656798829|, ~z$w_buff1~0=~z$w_buff1~0_In656798829, ~z~0=~z~0_In656798829} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10] because there is no mapped edge [2019-12-18 17:56:57,703 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L743-->L743-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd1~0_In-703743591 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-703743591 256)))) (or (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out-703743591| 0) (not .cse1)) (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out-703743591| ~z$w_buff0_used~0_In-703743591)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-703743591, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-703743591} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-703743591|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-703743591, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-703743591} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 17:56:57,705 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L744-->L744-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd1~0_In-1235968731 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In-1235968731 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1235968731 256))) (.cse0 (= (mod ~z$r_buff0_thd1~0_In-1235968731 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-1235968731|)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |P0Thread1of1ForFork0_#t~ite6_Out-1235968731| ~z$w_buff1_used~0_In-1235968731)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1235968731, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1235968731, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1235968731, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1235968731} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1235968731|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1235968731, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1235968731, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1235968731, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1235968731} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 17:56:57,706 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L745-->L746: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd1~0_In-746896350 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-746896350 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 ~z$r_buff0_thd1~0_Out-746896350)) (and (= ~z$r_buff0_thd1~0_In-746896350 ~z$r_buff0_thd1~0_Out-746896350) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-746896350, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-746896350} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-746896350, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-746896350|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-746896350} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 17:56:57,707 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [822] [822] L763-->L763-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1851904382 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In1851904382 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite11_Out1851904382| ~z$w_buff0_used~0_In1851904382) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite11_Out1851904382|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1851904382, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1851904382} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1851904382, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out1851904382|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1851904382} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-18 17:56:57,708 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L764-->L764-2: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In-1701532323 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd2~0_In-1701532323 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd2~0_In-1701532323 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1701532323 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite12_Out-1701532323| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |P1Thread1of1ForFork1_#t~ite12_Out-1701532323| ~z$w_buff1_used~0_In-1701532323)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1701532323, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1701532323, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1701532323, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1701532323} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1701532323, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1701532323, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1701532323, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-1701532323|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1701532323} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 17:56:57,708 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L765-->L765-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-652679437 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-652679437 256) 0))) (or (and (= ~z$r_buff0_thd2~0_In-652679437 |P1Thread1of1ForFork1_#t~ite13_Out-652679437|) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite13_Out-652679437| 0) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-652679437, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-652679437} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-652679437, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-652679437|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-652679437} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-18 17:56:57,709 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L766-->L766-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1592699735 256))) (.cse3 (= (mod ~z$r_buff1_thd2~0_In-1592699735 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-1592699735 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd2~0_In-1592699735 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite14_Out-1592699735|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~z$r_buff1_thd2~0_In-1592699735 |P1Thread1of1ForFork1_#t~ite14_Out-1592699735|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1592699735, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1592699735, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1592699735, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1592699735} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1592699735, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1592699735, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1592699735, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-1592699735|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1592699735} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 17:56:57,709 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [854] [854] L766-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= |v_P1Thread1of1ForFork1_#t~ite14_30| v_~z$r_buff1_thd2~0_92) (= v_~__unbuffered_cnt~0_57 (+ v_~__unbuffered_cnt~0_58 1)) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_30|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_92, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_29|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 17:56:57,710 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] L788-->L789: Formula: (and (= v_~z$r_buff0_thd3~0_137 v_~z$r_buff0_thd3~0_136) (not (= (mod v_~weak$$choice2~0_34 256) 0))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_137, ~weak$$choice2~0=v_~weak$$choice2~0_34} OutVars{P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_12|, P2Thread1of1ForFork2_#t~ite33=|v_P2Thread1of1ForFork2_#t~ite33_9|, P2Thread1of1ForFork2_#t~ite32=|v_P2Thread1of1ForFork2_#t~ite32_11|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_136, ~weak$$choice2~0=v_~weak$$choice2~0_34} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#t~ite33, P2Thread1of1ForFork2_#t~ite32, ~z$r_buff0_thd3~0] because there is no mapped edge [2019-12-18 17:56:57,711 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L789-->L789-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-641150474 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite35_Out-641150474| |P2Thread1of1ForFork2_#t~ite36_Out-641150474|) .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-641150474 256)))) (or (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In-641150474 256))) (and (= 0 (mod ~z$r_buff1_thd3~0_In-641150474 256)) .cse1) (= 0 (mod ~z$w_buff0_used~0_In-641150474 256)))) (= |P2Thread1of1ForFork2_#t~ite35_Out-641150474| ~z$r_buff1_thd3~0_In-641150474)) (and (= |P2Thread1of1ForFork2_#t~ite35_In-641150474| |P2Thread1of1ForFork2_#t~ite35_Out-641150474|) (= ~z$r_buff1_thd3~0_In-641150474 |P2Thread1of1ForFork2_#t~ite36_Out-641150474|) (not .cse0)))) InVars {P2Thread1of1ForFork2_#t~ite35=|P2Thread1of1ForFork2_#t~ite35_In-641150474|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-641150474, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-641150474, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-641150474, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-641150474, ~weak$$choice2~0=~weak$$choice2~0_In-641150474} OutVars{P2Thread1of1ForFork2_#t~ite35=|P2Thread1of1ForFork2_#t~ite35_Out-641150474|, P2Thread1of1ForFork2_#t~ite36=|P2Thread1of1ForFork2_#t~ite36_Out-641150474|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-641150474, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-641150474, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-641150474, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-641150474, ~weak$$choice2~0=~weak$$choice2~0_In-641150474} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite35, P2Thread1of1ForFork2_#t~ite36] because there is no mapped edge [2019-12-18 17:56:57,711 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [813] [813] L791-->L795: Formula: (and (not (= 0 (mod v_~z$flush_delayed~0_10 256))) (= 0 v_~z$flush_delayed~0_9) (= v_~z~0_62 v_~z$mem_tmp~0_7)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_10} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_7, P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_7|, ~z$flush_delayed~0=v_~z$flush_delayed~0_9, ~z~0=v_~z~0_62} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-18 17:56:57,712 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L795-2-->L795-5: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd3~0_In1123886033 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1123886033 256))) (.cse0 (= |P2Thread1of1ForFork2_#t~ite39_Out1123886033| |P2Thread1of1ForFork2_#t~ite38_Out1123886033|))) (or (and (= ~z$w_buff1~0_In1123886033 |P2Thread1of1ForFork2_#t~ite38_Out1123886033|) .cse0 (not .cse1) (not .cse2)) (and (or .cse2 .cse1) .cse0 (= ~z~0_In1123886033 |P2Thread1of1ForFork2_#t~ite38_Out1123886033|)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1123886033, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1123886033, ~z$w_buff1~0=~z$w_buff1~0_In1123886033, ~z~0=~z~0_In1123886033} OutVars{~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1123886033, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1123886033, ~z$w_buff1~0=~z$w_buff1~0_In1123886033, ~z~0=~z~0_In1123886033, P2Thread1of1ForFork2_#t~ite39=|P2Thread1of1ForFork2_#t~ite39_Out1123886033|, P2Thread1of1ForFork2_#t~ite38=|P2Thread1of1ForFork2_#t~ite38_Out1123886033|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite39, P2Thread1of1ForFork2_#t~ite38] because there is no mapped edge [2019-12-18 17:56:57,713 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L796-->L796-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1369180009 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1369180009 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork2_#t~ite40_Out1369180009|)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In1369180009 |P2Thread1of1ForFork2_#t~ite40_Out1369180009|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1369180009, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1369180009} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1369180009, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1369180009, P2Thread1of1ForFork2_#t~ite40=|P2Thread1of1ForFork2_#t~ite40_Out1369180009|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite40] because there is no mapped edge [2019-12-18 17:56:57,714 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L797-->L797-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff0_thd3~0_In1444549271 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In1444549271 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In1444549271 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In1444549271 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite41_Out1444549271| ~z$w_buff1_used~0_In1444549271) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P2Thread1of1ForFork2_#t~ite41_Out1444549271| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1444549271, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1444549271, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1444549271, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1444549271} OutVars{P2Thread1of1ForFork2_#t~ite41=|P2Thread1of1ForFork2_#t~ite41_Out1444549271|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1444549271, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1444549271, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1444549271, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1444549271} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite41] because there is no mapped edge [2019-12-18 17:56:57,714 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L798-->L798-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In802213325 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In802213325 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite42_Out802213325| 0) (not .cse0) (not .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite42_Out802213325| ~z$r_buff0_thd3~0_In802213325) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In802213325, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In802213325} OutVars{P2Thread1of1ForFork2_#t~ite42=|P2Thread1of1ForFork2_#t~ite42_Out802213325|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In802213325, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In802213325} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite42] because there is no mapped edge [2019-12-18 17:56:57,715 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L799-->L799-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd3~0_In396282251 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In396282251 256))) (.cse0 (= (mod ~z$r_buff0_thd3~0_In396282251 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In396282251 256)))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite43_Out396282251|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= ~z$r_buff1_thd3~0_In396282251 |P2Thread1of1ForFork2_#t~ite43_Out396282251|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In396282251, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In396282251, ~z$w_buff1_used~0=~z$w_buff1_used~0_In396282251, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In396282251} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In396282251, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In396282251, P2Thread1of1ForFork2_#t~ite43=|P2Thread1of1ForFork2_#t~ite43_Out396282251|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In396282251, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In396282251} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite43] because there is no mapped edge [2019-12-18 17:56:57,715 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] L799-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_52 1) v_~__unbuffered_cnt~0_51) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= v_~z$r_buff1_thd3~0_167 |v_P2Thread1of1ForFork2_#t~ite43_40|)) InVars {P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_40|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_52} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_167, P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_39|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_51, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite43, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-18 17:56:57,715 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L746-->L746-2: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd1~0_In-1834453913 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1834453913 256))) (.cse2 (= (mod ~z$r_buff0_thd1~0_In-1834453913 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-1834453913 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite8_Out-1834453913| ~z$r_buff1_thd1~0_In-1834453913)) (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-1834453913|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1834453913, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1834453913, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1834453913, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1834453913} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1834453913, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1834453913|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1834453913, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1834453913, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1834453913} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 17:56:57,716 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [870] [870] L746-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~z$r_buff1_thd1~0_159 |v_P0Thread1of1ForFork0_#t~ite8_44|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_90 (+ v_~__unbuffered_cnt~0_91 1))) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_44|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_91} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_43|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_159, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_90} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 17:56:57,716 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L822-1-->L828: Formula: (and (= 3 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 17:56:57,717 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L828-2-->L828-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite47_Out-512995163| |ULTIMATE.start_main_#t~ite48_Out-512995163|)) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-512995163 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In-512995163 256) 0))) (or (and (= ~z~0_In-512995163 |ULTIMATE.start_main_#t~ite47_Out-512995163|) .cse0 (or .cse1 .cse2)) (and .cse0 (= ~z$w_buff1~0_In-512995163 |ULTIMATE.start_main_#t~ite47_Out-512995163|) (not .cse1) (not .cse2)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-512995163, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-512995163, ~z$w_buff1~0=~z$w_buff1~0_In-512995163, ~z~0=~z~0_In-512995163} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-512995163, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-512995163|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-512995163, ~z$w_buff1~0=~z$w_buff1~0_In-512995163, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out-512995163|, ~z~0=~z~0_In-512995163} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 17:56:57,718 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L829-->L829-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-2045110141 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-2045110141 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite49_Out-2045110141|)) (and (= ~z$w_buff0_used~0_In-2045110141 |ULTIMATE.start_main_#t~ite49_Out-2045110141|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2045110141, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2045110141} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2045110141, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2045110141, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-2045110141|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-18 17:56:57,720 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L830-->L830-2: Formula: (let ((.cse3 (= (mod ~z$r_buff0_thd0~0_In43605026 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In43605026 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In43605026 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In43605026 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite50_Out43605026|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$w_buff1_used~0_In43605026 |ULTIMATE.start_main_#t~ite50_Out43605026|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In43605026, ~z$w_buff0_used~0=~z$w_buff0_used~0_In43605026, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In43605026, ~z$w_buff1_used~0=~z$w_buff1_used~0_In43605026} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out43605026|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In43605026, ~z$w_buff0_used~0=~z$w_buff0_used~0_In43605026, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In43605026, ~z$w_buff1_used~0=~z$w_buff1_used~0_In43605026} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-18 17:56:57,721 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L831-->L831-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-746962730 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-746962730 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite51_Out-746962730|)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In-746962730 |ULTIMATE.start_main_#t~ite51_Out-746962730|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-746962730, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-746962730} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-746962730, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-746962730|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-746962730} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-18 17:56:57,722 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [817] [817] L832-->L832-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In739226199 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In739226199 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In739226199 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In739226199 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd0~0_In739226199 |ULTIMATE.start_main_#t~ite52_Out739226199|)) (and (= 0 |ULTIMATE.start_main_#t~ite52_Out739226199|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In739226199, ~z$w_buff0_used~0=~z$w_buff0_used~0_In739226199, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In739226199, ~z$w_buff1_used~0=~z$w_buff1_used~0_In739226199} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out739226199|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In739226199, ~z$w_buff0_used~0=~z$w_buff0_used~0_In739226199, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In739226199, ~z$w_buff1_used~0=~z$w_buff1_used~0_In739226199} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-18 17:56:57,723 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L832-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_17 0) (= 2 v_~x~0_130) (= 0 v_~__unbuffered_p2_EAX~0_21) (= v_~z$r_buff1_thd0~0_167 |v_ULTIMATE.start_main_#t~ite52_35|) (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= v_~y~0_23 2)) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_35|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21, ~y~0=v_~y~0_23, ~x~0=v_~x~0_130} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_34|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_167, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21, ~y~0=v_~y~0_23, ~x~0=v_~x~0_130, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 17:56:57,864 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 05:56:57 BasicIcfg [2019-12-18 17:56:57,864 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 17:56:57,866 INFO L168 Benchmark]: Toolchain (without parser) took 136758.75 ms. Allocated memory was 145.2 MB in the beginning and 3.4 GB in the end (delta: 3.3 GB). Free memory was 102.0 MB in the beginning and 763.1 MB in the end (delta: -661.2 MB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2019-12-18 17:56:57,866 INFO L168 Benchmark]: CDTParser took 0.77 ms. Allocated memory is still 145.2 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-18 17:56:57,866 INFO L168 Benchmark]: CACSL2BoogieTranslator took 855.63 ms. Allocated memory was 145.2 MB in the beginning and 204.5 MB in the end (delta: 59.2 MB). Free memory was 101.7 MB in the beginning and 156.2 MB in the end (delta: -54.4 MB). Peak memory consumption was 21.0 MB. Max. memory is 7.1 GB. [2019-12-18 17:56:57,867 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.07 ms. Allocated memory is still 204.5 MB. Free memory was 156.2 MB in the beginning and 153.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 17:56:57,867 INFO L168 Benchmark]: Boogie Preprocessor took 45.10 ms. Allocated memory is still 204.5 MB. Free memory was 153.4 MB in the beginning and 151.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-18 17:56:57,869 INFO L168 Benchmark]: RCFGBuilder took 931.24 ms. Allocated memory is still 204.5 MB. Free memory was 151.4 MB in the beginning and 101.5 MB in the end (delta: 49.9 MB). Peak memory consumption was 49.9 MB. Max. memory is 7.1 GB. [2019-12-18 17:56:57,869 INFO L168 Benchmark]: TraceAbstraction took 134851.41 ms. Allocated memory was 204.5 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 100.8 MB in the beginning and 763.1 MB in the end (delta: -662.3 MB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2019-12-18 17:56:57,871 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.77 ms. Allocated memory is still 145.2 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 855.63 ms. Allocated memory was 145.2 MB in the beginning and 204.5 MB in the end (delta: 59.2 MB). Free memory was 101.7 MB in the beginning and 156.2 MB in the end (delta: -54.4 MB). Peak memory consumption was 21.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 69.07 ms. Allocated memory is still 204.5 MB. Free memory was 156.2 MB in the beginning and 153.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 45.10 ms. Allocated memory is still 204.5 MB. Free memory was 153.4 MB in the beginning and 151.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 931.24 ms. Allocated memory is still 204.5 MB. Free memory was 151.4 MB in the beginning and 101.5 MB in the end (delta: 49.9 MB). Peak memory consumption was 49.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 134851.41 ms. Allocated memory was 204.5 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 100.8 MB in the beginning and 763.1 MB in the end (delta: -662.3 MB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.1s, 174 ProgramPointsBefore, 92 ProgramPointsAfterwards, 211 TransitionsBefore, 102 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 31 ChoiceCompositions, 6843 VarBasedMoverChecksPositive, 273 VarBasedMoverChecksNegative, 91 SemBasedMoverChecksPositive, 240 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 0 MoverChecksTotal, 77200 CheckedPairsTotal, 114 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L818] FCALL, FORK 0 pthread_create(&t1489, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L820] FCALL, FORK 0 pthread_create(&t1490, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L822] FCALL, FORK 0 pthread_create(&t1491, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L732] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L733] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L734] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L735] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L736] 1 z$r_buff0_thd1 = (_Bool)1 [L739] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] 2 x = 2 [L759] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L776] 3 y = 2 [L779] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L780] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L781] 3 z$flush_delayed = weak$$choice2 [L782] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L783] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L783] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L784] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L785] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))=0, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L786] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))=1, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L786] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L762] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L743] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L744] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L762] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L763] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L764] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L765] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L787] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L789] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L790] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L795] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L795] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L796] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L797] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L798] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L828] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L828] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L829] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L830] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L831] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 165 locations, 2 error locations. Result: UNSAFE, OverallTime: 134.4s, OverallIterations: 49, TraceHistogramMax: 1, AutomataDifference: 58.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 12843 SDtfs, 15625 SDslu, 42310 SDs, 0 SdLazy, 31893 SolverSat, 676 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 28.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 813 GetRequests, 195 SyntacticMatches, 54 SemanticMatches, 564 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2811 ImplicationChecksByTransitivity, 7.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=138429occurred 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: 47.8s AutomataMinimizationTime, 48 MinimizatonAttempts, 565924 StatesRemovedByMinimization, 46 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 2525 NumberOfCodeBlocks, 2525 NumberOfCodeBlocksAsserted, 49 NumberOfCheckSat, 2410 ConstructedInterpolants, 0 QuantifiedInterpolants, 575640 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 48 InterpolantComputations, 48 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...