/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/mix032_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 02:16:23,844 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 02:16:23,846 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 02:16:23,865 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 02:16:23,866 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 02:16:23,869 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 02:16:23,872 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 02:16:23,882 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 02:16:23,885 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 02:16:23,888 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 02:16:23,890 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 02:16:23,892 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 02:16:23,892 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 02:16:23,894 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 02:16:23,896 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 02:16:23,898 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 02:16:23,899 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 02:16:23,900 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 02:16:23,901 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 02:16:23,906 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 02:16:23,910 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 02:16:23,914 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 02:16:23,915 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 02:16:23,916 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 02:16:23,917 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 02:16:23,918 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 02:16:23,918 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 02:16:23,919 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 02:16:23,919 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 02:16:23,920 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 02:16:23,920 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 02:16:23,921 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 02:16:23,921 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 02:16:23,922 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 02:16:23,923 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 02:16:23,923 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 02:16:23,924 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 02:16:23,924 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 02:16:23,924 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 02:16:23,925 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 02:16:23,925 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 02:16:23,926 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-27 02:16:23,939 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 02:16:23,940 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 02:16:23,941 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 02:16:23,941 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 02:16:23,941 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 02:16:23,941 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 02:16:23,942 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 02:16:23,942 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 02:16:23,942 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 02:16:23,942 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 02:16:23,942 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 02:16:23,943 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 02:16:23,943 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 02:16:23,943 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 02:16:23,943 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 02:16:23,943 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 02:16:23,943 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 02:16:23,944 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 02:16:23,944 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 02:16:23,944 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 02:16:23,944 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 02:16:23,944 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 02:16:23,945 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 02:16:23,945 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 02:16:23,945 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 02:16:23,945 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 02:16:23,945 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 02:16:23,946 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 02:16:23,946 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 02:16:24,219 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 02:16:24,238 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 02:16:24,243 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 02:16:24,244 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 02:16:24,244 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 02:16:24,245 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix032_tso.oepc.i [2019-12-27 02:16:24,318 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1671fea8b/4105f393f3bb42f493430499e0cf5951/FLAGd62656fa5 [2019-12-27 02:16:24,846 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 02:16:24,847 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix032_tso.oepc.i [2019-12-27 02:16:24,870 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1671fea8b/4105f393f3bb42f493430499e0cf5951/FLAGd62656fa5 [2019-12-27 02:16:25,194 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1671fea8b/4105f393f3bb42f493430499e0cf5951 [2019-12-27 02:16:25,203 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 02:16:25,204 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 02:16:25,205 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 02:16:25,205 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 02:16:25,209 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 02:16:25,210 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:16:25" (1/1) ... [2019-12-27 02:16:25,213 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4419eb39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:16:25, skipping insertion in model container [2019-12-27 02:16:25,213 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:16:25" (1/1) ... [2019-12-27 02:16:25,221 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 02:16:25,270 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 02:16:25,826 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 02:16:25,838 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 02:16:25,905 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 02:16:25,997 INFO L208 MainTranslator]: Completed translation [2019-12-27 02:16:25,997 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:16:25 WrapperNode [2019-12-27 02:16:25,998 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 02:16:25,999 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 02:16:25,999 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 02:16:25,999 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 02:16:26,007 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:16:25" (1/1) ... [2019-12-27 02:16:26,028 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:16:25" (1/1) ... [2019-12-27 02:16:26,059 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 02:16:26,059 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 02:16:26,060 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 02:16:26,060 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 02:16:26,072 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:16:25" (1/1) ... [2019-12-27 02:16:26,073 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:16:25" (1/1) ... [2019-12-27 02:16:26,080 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:16:25" (1/1) ... [2019-12-27 02:16:26,081 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:16:25" (1/1) ... [2019-12-27 02:16:26,101 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:16:25" (1/1) ... [2019-12-27 02:16:26,107 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:16:25" (1/1) ... [2019-12-27 02:16:26,111 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:16:25" (1/1) ... [2019-12-27 02:16:26,118 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 02:16:26,119 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 02:16:26,119 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 02:16:26,119 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 02:16:26,120 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:16:25" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 02:16:26,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 02:16:26,171 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 02:16:26,171 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 02:16:26,173 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 02:16:26,173 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 02:16:26,173 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 02:16:26,173 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 02:16:26,173 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 02:16:26,174 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 02:16:26,174 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 02:16:26,175 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 02:16:26,175 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 02:16:26,175 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 02:16:26,179 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 02:16:26,963 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 02:16:26,963 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 02:16:26,965 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:16:26 BoogieIcfgContainer [2019-12-27 02:16:26,965 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 02:16:26,966 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 02:16:26,966 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 02:16:26,969 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 02:16:26,970 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 02:16:25" (1/3) ... [2019-12-27 02:16:26,971 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50d6670f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:16:26, skipping insertion in model container [2019-12-27 02:16:26,971 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:16:25" (2/3) ... [2019-12-27 02:16:26,971 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50d6670f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:16:26, skipping insertion in model container [2019-12-27 02:16:26,972 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:16:26" (3/3) ... [2019-12-27 02:16:26,973 INFO L109 eAbstractionObserver]: Analyzing ICFG mix032_tso.oepc.i [2019-12-27 02:16:26,984 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 02:16:26,984 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 02:16:26,992 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 02:16:26,993 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 02:16:27,033 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,033 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,033 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,034 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,034 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,034 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,035 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,035 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,036 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,036 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,036 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,036 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,037 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,037 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,037 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,038 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,038 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,038 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,038 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,039 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,039 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,039 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,039 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,040 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,040 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,040 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,041 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,041 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,041 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,041 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,042 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,042 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,042 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,042 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,043 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,043 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,043 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,044 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,044 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,044 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,044 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,045 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,045 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,045 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,045 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,046 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,046 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,046 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,046 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,047 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,047 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,047 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,047 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,048 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,048 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,048 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,048 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,049 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,049 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,049 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,049 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,050 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,050 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,050 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,051 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,051 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,052 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,052 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,052 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,052 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,052 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,053 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,053 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,053 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,053 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,054 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,054 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,054 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,054 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,055 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,055 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,055 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,055 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,056 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,056 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,056 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,056 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,057 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,057 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,057 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,057 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,058 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,058 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,058 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,058 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,058 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,059 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,059 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,059 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,059 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,060 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,060 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,060 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,060 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,061 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,061 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,061 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,061 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,062 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,062 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,062 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,062 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,063 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,063 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,063 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,063 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,064 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,081 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,081 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,082 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,082 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,082 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,082 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,083 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,083 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,083 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,083 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,083 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,084 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,084 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,084 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,084 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,084 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,085 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,085 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,085 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,085 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,085 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,086 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,086 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,086 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,086 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,086 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,087 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,087 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,087 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,087 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,087 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,088 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,088 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,088 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,088 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,088 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,089 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,089 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,089 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,089 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,089 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,089 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,090 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,090 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,090 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,090 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,090 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,091 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,091 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,091 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,091 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,091 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,092 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,092 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,092 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,092 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,092 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,093 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,093 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,093 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,093 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,093 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,094 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,094 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,094 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,097 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,098 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,102 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,103 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,103 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,103 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,103 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,104 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,104 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,104 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,104 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,104 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,105 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,105 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,105 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,105 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,105 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,105 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,106 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,106 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,106 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,106 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,106 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,107 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,107 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,107 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,107 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,107 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,107 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,108 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,108 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,108 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,108 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,108 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,109 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,115 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,115 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,116 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,116 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,116 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,116 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,121 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,121 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,122 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,122 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,129 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:27,148 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 02:16:27,169 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 02:16:27,170 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 02:16:27,170 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 02:16:27,170 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 02:16:27,170 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 02:16:27,170 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 02:16:27,170 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 02:16:27,170 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 02:16:27,196 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 180 places, 217 transitions [2019-12-27 02:16:27,198 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 217 transitions [2019-12-27 02:16:27,322 INFO L132 PetriNetUnfolder]: 47/214 cut-off events. [2019-12-27 02:16:27,322 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 02:16:27,339 INFO L76 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 214 events. 47/214 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 436 event pairs. 0/165 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 02:16:27,362 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 217 transitions [2019-12-27 02:16:27,437 INFO L132 PetriNetUnfolder]: 47/214 cut-off events. [2019-12-27 02:16:27,437 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 02:16:27,446 INFO L76 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 214 events. 47/214 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 436 event pairs. 0/165 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 02:16:27,467 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 02:16:27,469 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 02:16:32,230 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-12-27 02:16:33,050 WARN L192 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-27 02:16:33,181 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-12-27 02:16:33,213 INFO L206 etLargeBlockEncoding]: Checked pairs total: 83556 [2019-12-27 02:16:33,214 INFO L214 etLargeBlockEncoding]: Total number of compositions: 115 [2019-12-27 02:16:33,218 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 96 places, 105 transitions [2019-12-27 02:16:56,522 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 129602 states. [2019-12-27 02:16:56,525 INFO L276 IsEmpty]: Start isEmpty. Operand 129602 states. [2019-12-27 02:16:56,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 02:16:56,531 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:16:56,531 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 02:16:56,532 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:16:56,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:16:56,537 INFO L82 PathProgramCache]: Analyzing trace with hash 923865, now seen corresponding path program 1 times [2019-12-27 02:16:56,545 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:16:56,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112238271] [2019-12-27 02:16:56,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:16:56,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:16: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-27 02:16:56,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112238271] [2019-12-27 02:16:56,801 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:16:56,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 02:16:56,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473260698] [2019-12-27 02:16:56,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:16:56,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:16:56,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:16:56,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:16:56,828 INFO L87 Difference]: Start difference. First operand 129602 states. Second operand 3 states. [2019-12-27 02:16:59,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:16:59,003 INFO L93 Difference]: Finished difference Result 128376 states and 546782 transitions. [2019-12-27 02:16:59,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:16:59,004 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 02:16:59,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:17:02,405 INFO L225 Difference]: With dead ends: 128376 [2019-12-27 02:17:02,405 INFO L226 Difference]: Without dead ends: 120914 [2019-12-27 02:17:02,406 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:17:07,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120914 states. [2019-12-27 02:17:14,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120914 to 120914. [2019-12-27 02:17:14,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120914 states. [2019-12-27 02:17:15,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120914 states to 120914 states and 514358 transitions. [2019-12-27 02:17:15,468 INFO L78 Accepts]: Start accepts. Automaton has 120914 states and 514358 transitions. Word has length 3 [2019-12-27 02:17:15,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:17:15,469 INFO L462 AbstractCegarLoop]: Abstraction has 120914 states and 514358 transitions. [2019-12-27 02:17:15,469 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:17:15,469 INFO L276 IsEmpty]: Start isEmpty. Operand 120914 states and 514358 transitions. [2019-12-27 02:17:15,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 02:17:15,474 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:17:15,474 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:17:15,474 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:17:15,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:17:15,475 INFO L82 PathProgramCache]: Analyzing trace with hash 2102120012, now seen corresponding path program 1 times [2019-12-27 02:17:15,475 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:17:15,476 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326444838] [2019-12-27 02:17:15,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:17:15,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:17:15,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:17:15,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326444838] [2019-12-27 02:17:15,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:17:15,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:17:15,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508829690] [2019-12-27 02:17:15,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:17:15,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:17:15,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:17:15,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:17:15,608 INFO L87 Difference]: Start difference. First operand 120914 states and 514358 transitions. Second operand 4 states. [2019-12-27 02:17:21,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:17:21,356 INFO L93 Difference]: Finished difference Result 187704 states and 768206 transitions. [2019-12-27 02:17:21,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:17:21,357 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 02:17:21,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:17:22,064 INFO L225 Difference]: With dead ends: 187704 [2019-12-27 02:17:22,065 INFO L226 Difference]: Without dead ends: 187655 [2019-12-27 02:17:22,065 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:17:29,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187655 states. [2019-12-27 02:17:33,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187655 to 171775. [2019-12-27 02:17:33,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171775 states. [2019-12-27 02:17:39,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171775 states to 171775 states and 711726 transitions. [2019-12-27 02:17:39,965 INFO L78 Accepts]: Start accepts. Automaton has 171775 states and 711726 transitions. Word has length 11 [2019-12-27 02:17:39,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:17:39,965 INFO L462 AbstractCegarLoop]: Abstraction has 171775 states and 711726 transitions. [2019-12-27 02:17:39,965 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:17:39,965 INFO L276 IsEmpty]: Start isEmpty. Operand 171775 states and 711726 transitions. [2019-12-27 02:17:39,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 02:17:39,972 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:17:39,973 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:17:39,973 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:17:39,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:17:39,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1617299066, now seen corresponding path program 1 times [2019-12-27 02:17:39,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:17:39,974 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862587569] [2019-12-27 02:17:39,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:17:40,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:17:40,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:17:40,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862587569] [2019-12-27 02:17:40,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:17:40,033 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:17:40,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160372527] [2019-12-27 02:17:40,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:17:40,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:17:40,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:17:40,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:17:40,036 INFO L87 Difference]: Start difference. First operand 171775 states and 711726 transitions. Second operand 3 states. [2019-12-27 02:17:40,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:17:40,227 INFO L93 Difference]: Finished difference Result 36261 states and 117727 transitions. [2019-12-27 02:17:40,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:17:40,228 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 02:17:40,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:17:40,308 INFO L225 Difference]: With dead ends: 36261 [2019-12-27 02:17:40,308 INFO L226 Difference]: Without dead ends: 36261 [2019-12-27 02:17:40,308 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:17:40,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36261 states. [2019-12-27 02:17:42,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36261 to 36261. [2019-12-27 02:17:42,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36261 states. [2019-12-27 02:17:42,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36261 states to 36261 states and 117727 transitions. [2019-12-27 02:17:42,341 INFO L78 Accepts]: Start accepts. Automaton has 36261 states and 117727 transitions. Word has length 13 [2019-12-27 02:17:42,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:17:42,341 INFO L462 AbstractCegarLoop]: Abstraction has 36261 states and 117727 transitions. [2019-12-27 02:17:42,341 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:17:42,341 INFO L276 IsEmpty]: Start isEmpty. Operand 36261 states and 117727 transitions. [2019-12-27 02:17:42,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 02:17:42,345 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:17:42,345 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:17:42,345 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:17:42,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:17:42,345 INFO L82 PathProgramCache]: Analyzing trace with hash 947448332, now seen corresponding path program 1 times [2019-12-27 02:17:42,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:17:42,346 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735702290] [2019-12-27 02:17:42,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:17:42,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:17:42,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:17:42,437 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735702290] [2019-12-27 02:17:42,438 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:17:42,438 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:17:42,438 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132964268] [2019-12-27 02:17:42,438 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:17:42,439 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:17:42,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:17:42,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:17:42,439 INFO L87 Difference]: Start difference. First operand 36261 states and 117727 transitions. Second operand 5 states. [2019-12-27 02:17:42,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:17:42,993 INFO L93 Difference]: Finished difference Result 50300 states and 161544 transitions. [2019-12-27 02:17:42,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 02:17:42,993 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 02:17:42,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:17:43,074 INFO L225 Difference]: With dead ends: 50300 [2019-12-27 02:17:43,075 INFO L226 Difference]: Without dead ends: 50300 [2019-12-27 02:17:43,075 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:17:43,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50300 states. [2019-12-27 02:17:43,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50300 to 43029. [2019-12-27 02:17:43,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43029 states. [2019-12-27 02:17:44,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43029 states to 43029 states and 139308 transitions. [2019-12-27 02:17:44,989 INFO L78 Accepts]: Start accepts. Automaton has 43029 states and 139308 transitions. Word has length 16 [2019-12-27 02:17:44,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:17:44,990 INFO L462 AbstractCegarLoop]: Abstraction has 43029 states and 139308 transitions. [2019-12-27 02:17:44,991 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:17:44,991 INFO L276 IsEmpty]: Start isEmpty. Operand 43029 states and 139308 transitions. [2019-12-27 02:17:45,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 02:17:45,000 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:17:45,000 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:17:45,000 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:17:45,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:17:45,001 INFO L82 PathProgramCache]: Analyzing trace with hash -282717849, now seen corresponding path program 1 times [2019-12-27 02:17:45,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:17:45,001 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430622662] [2019-12-27 02:17:45,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:17:45,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:17:45,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:17:45,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430622662] [2019-12-27 02:17:45,148 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:17:45,148 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 02:17:45,148 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316432960] [2019-12-27 02:17:45,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:17:45,149 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:17:45,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:17:45,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:17:45,150 INFO L87 Difference]: Start difference. First operand 43029 states and 139308 transitions. Second operand 6 states. [2019-12-27 02:17:46,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:17:46,070 INFO L93 Difference]: Finished difference Result 64122 states and 202692 transitions. [2019-12-27 02:17:46,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 02:17:46,070 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 02:17:46,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:17:46,174 INFO L225 Difference]: With dead ends: 64122 [2019-12-27 02:17:46,174 INFO L226 Difference]: Without dead ends: 64115 [2019-12-27 02:17:46,175 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 02:17:46,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64115 states. [2019-12-27 02:17:47,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64115 to 42953. [2019-12-27 02:17:47,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42953 states. [2019-12-27 02:17:48,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42953 states to 42953 states and 138310 transitions. [2019-12-27 02:17:48,092 INFO L78 Accepts]: Start accepts. Automaton has 42953 states and 138310 transitions. Word has length 22 [2019-12-27 02:17:48,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:17:48,093 INFO L462 AbstractCegarLoop]: Abstraction has 42953 states and 138310 transitions. [2019-12-27 02:17:48,093 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:17:48,093 INFO L276 IsEmpty]: Start isEmpty. Operand 42953 states and 138310 transitions. [2019-12-27 02:17:48,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 02:17:48,106 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:17:48,106 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:17:48,106 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:17:48,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:17:48,106 INFO L82 PathProgramCache]: Analyzing trace with hash -71664384, now seen corresponding path program 1 times [2019-12-27 02:17:48,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:17:48,107 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275924888] [2019-12-27 02:17:48,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:17:48,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:17:48,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:17:48,178 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275924888] [2019-12-27 02:17:48,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:17:48,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:17:48,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680970533] [2019-12-27 02:17:48,178 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:17:48,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:17:48,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:17:48,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:17:48,179 INFO L87 Difference]: Start difference. First operand 42953 states and 138310 transitions. Second operand 4 states. [2019-12-27 02:17:48,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:17:48,253 INFO L93 Difference]: Finished difference Result 17024 states and 51836 transitions. [2019-12-27 02:17:48,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 02:17:48,253 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 02:17:48,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:17:48,285 INFO L225 Difference]: With dead ends: 17024 [2019-12-27 02:17:48,285 INFO L226 Difference]: Without dead ends: 17024 [2019-12-27 02:17:48,286 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:17:48,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17024 states. [2019-12-27 02:17:48,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17024 to 16731. [2019-12-27 02:17:48,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16731 states. [2019-12-27 02:17:48,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16731 states to 16731 states and 51000 transitions. [2019-12-27 02:17:48,579 INFO L78 Accepts]: Start accepts. Automaton has 16731 states and 51000 transitions. Word has length 25 [2019-12-27 02:17:48,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:17:48,579 INFO L462 AbstractCegarLoop]: Abstraction has 16731 states and 51000 transitions. [2019-12-27 02:17:48,579 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:17:48,579 INFO L276 IsEmpty]: Start isEmpty. Operand 16731 states and 51000 transitions. [2019-12-27 02:17:48,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 02:17:48,591 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:17:48,591 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:17:48,591 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:17:48,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:17:48,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1418175430, now seen corresponding path program 1 times [2019-12-27 02:17:48,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:17:48,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460252997] [2019-12-27 02:17:48,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:17:48,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:17:48,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:17:48,646 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460252997] [2019-12-27 02:17:48,646 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:17:48,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:17:48,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987292260] [2019-12-27 02:17:48,647 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:17:48,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:17:48,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:17:48,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:17:48,648 INFO L87 Difference]: Start difference. First operand 16731 states and 51000 transitions. Second operand 3 states. [2019-12-27 02:17:48,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:17:48,752 INFO L93 Difference]: Finished difference Result 24375 states and 72822 transitions. [2019-12-27 02:17:48,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:17:48,752 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-27 02:17:48,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:17:48,784 INFO L225 Difference]: With dead ends: 24375 [2019-12-27 02:17:48,784 INFO L226 Difference]: Without dead ends: 24375 [2019-12-27 02:17:48,785 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:17:48,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24375 states. [2019-12-27 02:17:49,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24375 to 18589. [2019-12-27 02:17:49,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18589 states. [2019-12-27 02:17:49,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18589 states to 18589 states and 56096 transitions. [2019-12-27 02:17:49,105 INFO L78 Accepts]: Start accepts. Automaton has 18589 states and 56096 transitions. Word has length 27 [2019-12-27 02:17:49,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:17:49,105 INFO L462 AbstractCegarLoop]: Abstraction has 18589 states and 56096 transitions. [2019-12-27 02:17:49,105 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:17:49,105 INFO L276 IsEmpty]: Start isEmpty. Operand 18589 states and 56096 transitions. [2019-12-27 02:17:49,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 02:17:49,118 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:17:49,118 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:17:49,118 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:17:49,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:17:49,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1834697800, now seen corresponding path program 1 times [2019-12-27 02:17:49,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:17:49,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288772424] [2019-12-27 02:17:49,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:17:49,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:17:49,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:17:49,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288772424] [2019-12-27 02:17:49,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:17:49,225 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 02:17:49,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793642166] [2019-12-27 02:17:49,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:17:49,226 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:17:49,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:17:49,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:17:49,227 INFO L87 Difference]: Start difference. First operand 18589 states and 56096 transitions. Second operand 6 states. [2019-12-27 02:17:49,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:17:49,805 INFO L93 Difference]: Finished difference Result 26038 states and 76681 transitions. [2019-12-27 02:17:49,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 02:17:49,806 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 02:17:49,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:17:49,841 INFO L225 Difference]: With dead ends: 26038 [2019-12-27 02:17:49,841 INFO L226 Difference]: Without dead ends: 26038 [2019-12-27 02:17:49,842 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 02:17:49,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26038 states. [2019-12-27 02:17:50,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26038 to 21331. [2019-12-27 02:17:50,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21331 states. [2019-12-27 02:17:50,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21331 states to 21331 states and 64000 transitions. [2019-12-27 02:17:50,917 INFO L78 Accepts]: Start accepts. Automaton has 21331 states and 64000 transitions. Word has length 27 [2019-12-27 02:17:50,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:17:50,917 INFO L462 AbstractCegarLoop]: Abstraction has 21331 states and 64000 transitions. [2019-12-27 02:17:50,918 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:17:50,918 INFO L276 IsEmpty]: Start isEmpty. Operand 21331 states and 64000 transitions. [2019-12-27 02:17:50,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 02:17:50,939 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:17:50,939 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:17:50,939 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:17:50,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:17:50,940 INFO L82 PathProgramCache]: Analyzing trace with hash -2065332723, now seen corresponding path program 1 times [2019-12-27 02:17:50,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:17:50,940 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217664502] [2019-12-27 02:17:50,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:17:50,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:17:51,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:17:51,028 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217664502] [2019-12-27 02:17:51,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:17:51,029 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 02:17:51,029 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166513010] [2019-12-27 02:17:51,029 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:17:51,030 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:17:51,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:17:51,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:17:51,030 INFO L87 Difference]: Start difference. First operand 21331 states and 64000 transitions. Second operand 7 states. [2019-12-27 02:17:52,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:17:52,275 INFO L93 Difference]: Finished difference Result 28794 states and 84449 transitions. [2019-12-27 02:17:52,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 02:17:52,275 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-27 02:17:52,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:17:52,312 INFO L225 Difference]: With dead ends: 28794 [2019-12-27 02:17:52,312 INFO L226 Difference]: Without dead ends: 28794 [2019-12-27 02:17:52,312 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-27 02:17:52,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28794 states. [2019-12-27 02:17:52,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28794 to 19492. [2019-12-27 02:17:52,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19492 states. [2019-12-27 02:17:52,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19492 states to 19492 states and 58703 transitions. [2019-12-27 02:17:52,668 INFO L78 Accepts]: Start accepts. Automaton has 19492 states and 58703 transitions. Word has length 33 [2019-12-27 02:17:52,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:17:52,669 INFO L462 AbstractCegarLoop]: Abstraction has 19492 states and 58703 transitions. [2019-12-27 02:17:52,669 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:17:52,669 INFO L276 IsEmpty]: Start isEmpty. Operand 19492 states and 58703 transitions. [2019-12-27 02:17:52,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 02:17:52,692 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:17:52,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] [2019-12-27 02:17:52,693 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:17:52,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:17:52,693 INFO L82 PathProgramCache]: Analyzing trace with hash 603828080, now seen corresponding path program 1 times [2019-12-27 02:17:52,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:17:52,694 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588969590] [2019-12-27 02:17:52,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:17:52,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:17:52,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:17:52,791 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588969590] [2019-12-27 02:17:52,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:17:52,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:17:52,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544162853] [2019-12-27 02:17:52,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:17:52,793 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:17:52,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:17:52,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:17:52,794 INFO L87 Difference]: Start difference. First operand 19492 states and 58703 transitions. Second operand 4 states. [2019-12-27 02:17:52,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:17:52,938 INFO L93 Difference]: Finished difference Result 33180 states and 100186 transitions. [2019-12-27 02:17:52,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 02:17:52,938 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-12-27 02:17:52,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:17:52,969 INFO L225 Difference]: With dead ends: 33180 [2019-12-27 02:17:52,970 INFO L226 Difference]: Without dead ends: 16657 [2019-12-27 02:17:52,970 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:17:53,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16657 states. [2019-12-27 02:17:54,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16657 to 16583. [2019-12-27 02:17:54,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16583 states. [2019-12-27 02:17:54,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16583 states to 16583 states and 49025 transitions. [2019-12-27 02:17:54,852 INFO L78 Accepts]: Start accepts. Automaton has 16583 states and 49025 transitions. Word has length 39 [2019-12-27 02:17:54,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:17:54,852 INFO L462 AbstractCegarLoop]: Abstraction has 16583 states and 49025 transitions. [2019-12-27 02:17:54,852 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:17:54,852 INFO L276 IsEmpty]: Start isEmpty. Operand 16583 states and 49025 transitions. [2019-12-27 02:17:54,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 02:17:54,872 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:17:54,872 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:17:54,872 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:17:54,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:17:54,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1247651138, now seen corresponding path program 2 times [2019-12-27 02:17:54,873 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:17:54,873 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875834927] [2019-12-27 02:17:54,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:17:54,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:17:54,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:17:54,930 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875834927] [2019-12-27 02:17:54,930 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:17:54,931 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 02:17:54,931 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175176153] [2019-12-27 02:17:54,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:17:54,931 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:17:54,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:17:54,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:17:54,932 INFO L87 Difference]: Start difference. First operand 16583 states and 49025 transitions. Second operand 3 states. [2019-12-27 02:17:55,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:17:55,000 INFO L93 Difference]: Finished difference Result 16582 states and 49023 transitions. [2019-12-27 02:17:55,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:17:55,001 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 02:17:55,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:17:55,032 INFO L225 Difference]: With dead ends: 16582 [2019-12-27 02:17:55,032 INFO L226 Difference]: Without dead ends: 16582 [2019-12-27 02:17:55,032 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:17:55,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16582 states. [2019-12-27 02:17:55,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16582 to 16582. [2019-12-27 02:17:55,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16582 states. [2019-12-27 02:17:55,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16582 states to 16582 states and 49023 transitions. [2019-12-27 02:17:55,309 INFO L78 Accepts]: Start accepts. Automaton has 16582 states and 49023 transitions. Word has length 39 [2019-12-27 02:17:55,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:17:55,309 INFO L462 AbstractCegarLoop]: Abstraction has 16582 states and 49023 transitions. [2019-12-27 02:17:55,309 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:17:55,309 INFO L276 IsEmpty]: Start isEmpty. Operand 16582 states and 49023 transitions. [2019-12-27 02:17:55,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 02:17:55,325 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:17:55,325 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:17:55,325 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:17:55,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:17:55,325 INFO L82 PathProgramCache]: Analyzing trace with hash -2020108147, now seen corresponding path program 1 times [2019-12-27 02:17:55,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:17:55,326 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363354514] [2019-12-27 02:17:55,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:17:55,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:17:55,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:17:55,390 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363354514] [2019-12-27 02:17:55,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:17:55,390 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:17:55,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495226921] [2019-12-27 02:17:55,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:17:55,391 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:17:55,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:17:55,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:17:55,393 INFO L87 Difference]: Start difference. First operand 16582 states and 49023 transitions. Second operand 4 states. [2019-12-27 02:17:55,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:17:55,500 INFO L93 Difference]: Finished difference Result 26060 states and 77460 transitions. [2019-12-27 02:17:55,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 02:17:55,500 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-12-27 02:17:55,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:17:55,524 INFO L225 Difference]: With dead ends: 26060 [2019-12-27 02:17:55,525 INFO L226 Difference]: Without dead ends: 11670 [2019-12-27 02:17:55,525 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:17:55,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11670 states. [2019-12-27 02:17:55,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11670 to 11605. [2019-12-27 02:17:55,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11605 states. [2019-12-27 02:17:55,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11605 states to 11605 states and 33387 transitions. [2019-12-27 02:17:55,762 INFO L78 Accepts]: Start accepts. Automaton has 11605 states and 33387 transitions. Word has length 40 [2019-12-27 02:17:55,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:17:55,762 INFO L462 AbstractCegarLoop]: Abstraction has 11605 states and 33387 transitions. [2019-12-27 02:17:55,762 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:17:55,762 INFO L276 IsEmpty]: Start isEmpty. Operand 11605 states and 33387 transitions. [2019-12-27 02:17:55,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 02:17:55,773 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:17:55,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-27 02:17:55,773 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:17:55,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:17:55,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1707989501, now seen corresponding path program 2 times [2019-12-27 02:17:55,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:17:55,774 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205190156] [2019-12-27 02:17:55,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:17:55,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:17:55,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:17:55,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205190156] [2019-12-27 02:17:55,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:17:55,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 02:17:55,852 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854989996] [2019-12-27 02:17:55,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:17:55,852 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:17:55,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:17:55,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:17:55,855 INFO L87 Difference]: Start difference. First operand 11605 states and 33387 transitions. Second operand 5 states. [2019-12-27 02:17:55,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:17:55,922 INFO L93 Difference]: Finished difference Result 10656 states and 31273 transitions. [2019-12-27 02:17:55,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:17:55,922 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 02:17:55,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:17:55,936 INFO L225 Difference]: With dead ends: 10656 [2019-12-27 02:17:55,936 INFO L226 Difference]: Without dead ends: 7573 [2019-12-27 02:17:55,936 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:17:55,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7573 states. [2019-12-27 02:17:56,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7573 to 7573. [2019-12-27 02:17:56,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7573 states. [2019-12-27 02:17:56,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7573 states to 7573 states and 24358 transitions. [2019-12-27 02:17:56,074 INFO L78 Accepts]: Start accepts. Automaton has 7573 states and 24358 transitions. Word has length 40 [2019-12-27 02:17:56,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:17:56,074 INFO L462 AbstractCegarLoop]: Abstraction has 7573 states and 24358 transitions. [2019-12-27 02:17:56,074 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:17:56,074 INFO L276 IsEmpty]: Start isEmpty. Operand 7573 states and 24358 transitions. [2019-12-27 02:17:56,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 02:17:56,084 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:17:56,084 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:17:56,084 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:17:56,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:17:56,085 INFO L82 PathProgramCache]: Analyzing trace with hash -1827713058, now seen corresponding path program 1 times [2019-12-27 02:17:56,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:17:56,085 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088178084] [2019-12-27 02:17:56,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:17:56,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:17:56,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:17:56,135 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088178084] [2019-12-27 02:17:56,135 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:17:56,136 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:17:56,136 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273225033] [2019-12-27 02:17:56,136 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:17:56,136 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:17:56,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:17:56,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:17:56,137 INFO L87 Difference]: Start difference. First operand 7573 states and 24358 transitions. Second operand 3 states. [2019-12-27 02:17:56,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:17:56,203 INFO L93 Difference]: Finished difference Result 10082 states and 31704 transitions. [2019-12-27 02:17:56,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:17:56,204 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 02:17:56,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:17:56,216 INFO L225 Difference]: With dead ends: 10082 [2019-12-27 02:17:56,217 INFO L226 Difference]: Without dead ends: 10082 [2019-12-27 02:17:56,217 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:17:56,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10082 states. [2019-12-27 02:17:56,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10082 to 7729. [2019-12-27 02:17:56,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7729 states. [2019-12-27 02:17:56,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7729 states to 7729 states and 24514 transitions. [2019-12-27 02:17:56,381 INFO L78 Accepts]: Start accepts. Automaton has 7729 states and 24514 transitions. Word has length 64 [2019-12-27 02:17:56,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:17:56,382 INFO L462 AbstractCegarLoop]: Abstraction has 7729 states and 24514 transitions. [2019-12-27 02:17:56,382 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:17:56,382 INFO L276 IsEmpty]: Start isEmpty. Operand 7729 states and 24514 transitions. [2019-12-27 02:17:56,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 02:17:56,392 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:17:56,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] [2019-12-27 02:17:56,392 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:17:56,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:17:56,392 INFO L82 PathProgramCache]: Analyzing trace with hash 572197328, now seen corresponding path program 1 times [2019-12-27 02:17:56,393 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:17:56,393 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096669497] [2019-12-27 02:17:56,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:17:56,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:17:56,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:17:56,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096669497] [2019-12-27 02:17:56,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:17:56,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 02:17:56,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795131871] [2019-12-27 02:17:56,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:17:56,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:17:56,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:17:56,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:17:56,522 INFO L87 Difference]: Start difference. First operand 7729 states and 24514 transitions. Second operand 7 states. [2019-12-27 02:17:57,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:17:57,028 INFO L93 Difference]: Finished difference Result 15437 states and 48014 transitions. [2019-12-27 02:17:57,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 02:17:57,028 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 02:17:57,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:17:57,046 INFO L225 Difference]: With dead ends: 15437 [2019-12-27 02:17:57,046 INFO L226 Difference]: Without dead ends: 11573 [2019-12-27 02:17:57,046 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-27 02:17:57,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11573 states. [2019-12-27 02:17:57,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11573 to 9445. [2019-12-27 02:17:57,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9445 states. [2019-12-27 02:17:57,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9445 states to 9445 states and 29808 transitions. [2019-12-27 02:17:57,227 INFO L78 Accepts]: Start accepts. Automaton has 9445 states and 29808 transitions. Word has length 64 [2019-12-27 02:17:57,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:17:57,227 INFO L462 AbstractCegarLoop]: Abstraction has 9445 states and 29808 transitions. [2019-12-27 02:17:57,227 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:17:57,227 INFO L276 IsEmpty]: Start isEmpty. Operand 9445 states and 29808 transitions. [2019-12-27 02:17:57,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 02:17:57,237 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:17:57,238 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:17:57,238 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:17:57,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:17:57,238 INFO L82 PathProgramCache]: Analyzing trace with hash -22937850, now seen corresponding path program 2 times [2019-12-27 02:17:57,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:17:57,238 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138147042] [2019-12-27 02:17:57,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:17:57,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:17:57,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:17:57,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138147042] [2019-12-27 02:17:57,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:17:57,333 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 02:17:57,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095746626] [2019-12-27 02:17:57,333 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:17:57,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:17:57,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:17:57,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:17:57,334 INFO L87 Difference]: Start difference. First operand 9445 states and 29808 transitions. Second operand 7 states. [2019-12-27 02:17:57,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:17:57,619 INFO L93 Difference]: Finished difference Result 17385 states and 53705 transitions. [2019-12-27 02:17:57,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 02:17:57,620 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 02:17:57,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:17:57,639 INFO L225 Difference]: With dead ends: 17385 [2019-12-27 02:17:57,639 INFO L226 Difference]: Without dead ends: 13105 [2019-12-27 02:17:57,640 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-27 02:17:57,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13105 states. [2019-12-27 02:17:57,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13105 to 10746. [2019-12-27 02:17:57,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10746 states. [2019-12-27 02:17:57,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10746 states to 10746 states and 33681 transitions. [2019-12-27 02:17:57,842 INFO L78 Accepts]: Start accepts. Automaton has 10746 states and 33681 transitions. Word has length 64 [2019-12-27 02:17:57,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:17:57,842 INFO L462 AbstractCegarLoop]: Abstraction has 10746 states and 33681 transitions. [2019-12-27 02:17:57,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:17:57,842 INFO L276 IsEmpty]: Start isEmpty. Operand 10746 states and 33681 transitions. [2019-12-27 02:17:57,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 02:17:57,854 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:17:57,854 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:17:57,854 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:17:57,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:17:57,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1388618928, now seen corresponding path program 3 times [2019-12-27 02:17:57,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:17:57,855 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374676427] [2019-12-27 02:17:57,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:17:57,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:17:57,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:17:57,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374676427] [2019-12-27 02:17:57,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:17:57,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 02:17:57,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521931341] [2019-12-27 02:17:57,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 02:17:57,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:17:57,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 02:17:57,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 02:17:57,980 INFO L87 Difference]: Start difference. First operand 10746 states and 33681 transitions. Second operand 9 states. [2019-12-27 02:17:59,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:17:59,031 INFO L93 Difference]: Finished difference Result 24832 states and 76056 transitions. [2019-12-27 02:17:59,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-27 02:17:59,031 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-27 02:17:59,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:17:59,061 INFO L225 Difference]: With dead ends: 24832 [2019-12-27 02:17:59,061 INFO L226 Difference]: Without dead ends: 22344 [2019-12-27 02:17:59,062 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=163, Invalid=539, Unknown=0, NotChecked=0, Total=702 [2019-12-27 02:17:59,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22344 states. [2019-12-27 02:17:59,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22344 to 10578. [2019-12-27 02:17:59,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10578 states. [2019-12-27 02:17:59,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10578 states to 10578 states and 33121 transitions. [2019-12-27 02:17:59,331 INFO L78 Accepts]: Start accepts. Automaton has 10578 states and 33121 transitions. Word has length 64 [2019-12-27 02:17:59,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:17:59,331 INFO L462 AbstractCegarLoop]: Abstraction has 10578 states and 33121 transitions. [2019-12-27 02:17:59,331 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 02:17:59,331 INFO L276 IsEmpty]: Start isEmpty. Operand 10578 states and 33121 transitions. [2019-12-27 02:17:59,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 02:17:59,343 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:17:59,343 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:17:59,343 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:17:59,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:17:59,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1527941036, now seen corresponding path program 4 times [2019-12-27 02:17:59,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:17:59,344 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535135394] [2019-12-27 02:17:59,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:17:59,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:17:59,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:17:59,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535135394] [2019-12-27 02:17:59,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:17:59,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 02:17:59,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612055027] [2019-12-27 02:17:59,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 02:17:59,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:17:59,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 02:17:59,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 02:17:59,485 INFO L87 Difference]: Start difference. First operand 10578 states and 33121 transitions. Second operand 9 states. [2019-12-27 02:18:00,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:18:00,832 INFO L93 Difference]: Finished difference Result 28772 states and 88210 transitions. [2019-12-27 02:18:00,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 02:18:00,832 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-27 02:18:00,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:18:00,885 INFO L225 Difference]: With dead ends: 28772 [2019-12-27 02:18:00,885 INFO L226 Difference]: Without dead ends: 26348 [2019-12-27 02:18:00,886 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=154, Invalid=496, Unknown=0, NotChecked=0, Total=650 [2019-12-27 02:18:01,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26348 states. [2019-12-27 02:18:01,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26348 to 10606. [2019-12-27 02:18:01,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10606 states. [2019-12-27 02:18:01,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10606 states to 10606 states and 33275 transitions. [2019-12-27 02:18:01,220 INFO L78 Accepts]: Start accepts. Automaton has 10606 states and 33275 transitions. Word has length 64 [2019-12-27 02:18:01,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:18:01,220 INFO L462 AbstractCegarLoop]: Abstraction has 10606 states and 33275 transitions. [2019-12-27 02:18:01,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 02:18:01,220 INFO L276 IsEmpty]: Start isEmpty. Operand 10606 states and 33275 transitions. [2019-12-27 02:18:01,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 02:18:01,232 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:18:01,232 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:18:01,232 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:18:01,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:18:01,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1911526292, now seen corresponding path program 5 times [2019-12-27 02:18:01,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:18:01,233 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435558297] [2019-12-27 02:18:01,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:18:01,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:18:01,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:18:01,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435558297] [2019-12-27 02:18:01,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:18:01,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:18:01,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735160326] [2019-12-27 02:18:01,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:18:01,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:18:01,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:18:01,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:18:01,296 INFO L87 Difference]: Start difference. First operand 10606 states and 33275 transitions. Second operand 3 states. [2019-12-27 02:18:01,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:18:01,390 INFO L93 Difference]: Finished difference Result 12322 states and 38579 transitions. [2019-12-27 02:18:01,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:18:01,391 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 02:18:01,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:18:01,416 INFO L225 Difference]: With dead ends: 12322 [2019-12-27 02:18:01,416 INFO L226 Difference]: Without dead ends: 12322 [2019-12-27 02:18:01,416 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:18:01,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12322 states. [2019-12-27 02:18:01,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12322 to 11074. [2019-12-27 02:18:01,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11074 states. [2019-12-27 02:18:01,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11074 states to 11074 states and 34835 transitions. [2019-12-27 02:18:01,625 INFO L78 Accepts]: Start accepts. Automaton has 11074 states and 34835 transitions. Word has length 64 [2019-12-27 02:18:01,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:18:01,625 INFO L462 AbstractCegarLoop]: Abstraction has 11074 states and 34835 transitions. [2019-12-27 02:18:01,625 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:18:01,625 INFO L276 IsEmpty]: Start isEmpty. Operand 11074 states and 34835 transitions. [2019-12-27 02:18:01,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 02:18:01,638 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:18:01,638 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:18:01,638 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:18:01,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:18:01,638 INFO L82 PathProgramCache]: Analyzing trace with hash -2140458066, now seen corresponding path program 1 times [2019-12-27 02:18:01,639 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:18:01,639 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197087325] [2019-12-27 02:18:01,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:18:01,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:18:01,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:18:01,736 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197087325] [2019-12-27 02:18:01,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:18:01,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 02:18:01,737 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261089868] [2019-12-27 02:18:01,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 02:18:01,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:18:01,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 02:18:01,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 02:18:01,739 INFO L87 Difference]: Start difference. First operand 11074 states and 34835 transitions. Second operand 8 states. [2019-12-27 02:18:02,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:18:02,543 INFO L93 Difference]: Finished difference Result 29477 states and 90578 transitions. [2019-12-27 02:18:02,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 02:18:02,543 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-27 02:18:02,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:18:02,577 INFO L225 Difference]: With dead ends: 29477 [2019-12-27 02:18:02,577 INFO L226 Difference]: Without dead ends: 26544 [2019-12-27 02:18:02,578 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2019-12-27 02:18:02,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26544 states. [2019-12-27 02:18:02,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26544 to 11347. [2019-12-27 02:18:02,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11347 states. [2019-12-27 02:18:02,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11347 states to 11347 states and 35865 transitions. [2019-12-27 02:18:02,877 INFO L78 Accepts]: Start accepts. Automaton has 11347 states and 35865 transitions. Word has length 65 [2019-12-27 02:18:02,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:18:02,878 INFO L462 AbstractCegarLoop]: Abstraction has 11347 states and 35865 transitions. [2019-12-27 02:18:02,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 02:18:02,878 INFO L276 IsEmpty]: Start isEmpty. Operand 11347 states and 35865 transitions. [2019-12-27 02:18:02,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 02:18:02,891 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:18:02,891 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:18:02,891 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:18:02,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:18:02,891 INFO L82 PathProgramCache]: Analyzing trace with hash -281745782, now seen corresponding path program 2 times [2019-12-27 02:18:02,891 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:18:02,891 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21321526] [2019-12-27 02:18:02,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:18:02,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:18:02,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:18:02,998 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21321526] [2019-12-27 02:18:02,998 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:18:02,998 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 02:18:02,998 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683707328] [2019-12-27 02:18:02,998 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 02:18:02,999 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:18:02,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 02:18:02,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 02:18:02,999 INFO L87 Difference]: Start difference. First operand 11347 states and 35865 transitions. Second operand 9 states. [2019-12-27 02:18:04,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:18:04,033 INFO L93 Difference]: Finished difference Result 32061 states and 97811 transitions. [2019-12-27 02:18:04,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 02:18:04,033 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-27 02:18:04,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:18:04,072 INFO L225 Difference]: With dead ends: 32061 [2019-12-27 02:18:04,072 INFO L226 Difference]: Without dead ends: 29128 [2019-12-27 02:18:04,073 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=423, Unknown=0, NotChecked=0, Total=552 [2019-12-27 02:18:04,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29128 states. [2019-12-27 02:18:04,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29128 to 11355. [2019-12-27 02:18:04,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11355 states. [2019-12-27 02:18:04,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11355 states to 11355 states and 35880 transitions. [2019-12-27 02:18:04,393 INFO L78 Accepts]: Start accepts. Automaton has 11355 states and 35880 transitions. Word has length 65 [2019-12-27 02:18:04,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:18:04,394 INFO L462 AbstractCegarLoop]: Abstraction has 11355 states and 35880 transitions. [2019-12-27 02:18:04,394 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 02:18:04,394 INFO L276 IsEmpty]: Start isEmpty. Operand 11355 states and 35880 transitions. [2019-12-27 02:18:04,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 02:18:04,406 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:18:04,406 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:18:04,406 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:18:04,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:18:04,407 INFO L82 PathProgramCache]: Analyzing trace with hash -1813356122, now seen corresponding path program 3 times [2019-12-27 02:18:04,407 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:18:04,407 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086654738] [2019-12-27 02:18:04,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:18:04,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:18:04,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:18:04,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086654738] [2019-12-27 02:18:04,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:18:04,509 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 02:18:04,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120704406] [2019-12-27 02:18:04,510 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 02:18:04,513 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:18:04,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 02:18:04,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 02:18:04,514 INFO L87 Difference]: Start difference. First operand 11355 states and 35880 transitions. Second operand 9 states. [2019-12-27 02:18:05,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:18:05,704 INFO L93 Difference]: Finished difference Result 33909 states and 103392 transitions. [2019-12-27 02:18:05,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 02:18:05,705 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-27 02:18:05,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:18:05,744 INFO L225 Difference]: With dead ends: 33909 [2019-12-27 02:18:05,744 INFO L226 Difference]: Without dead ends: 30991 [2019-12-27 02:18:05,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=388, Unknown=0, NotChecked=0, Total=506 [2019-12-27 02:18:05,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30991 states. [2019-12-27 02:18:06,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30991 to 11298. [2019-12-27 02:18:06,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11298 states. [2019-12-27 02:18:06,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11298 states to 11298 states and 35607 transitions. [2019-12-27 02:18:06,063 INFO L78 Accepts]: Start accepts. Automaton has 11298 states and 35607 transitions. Word has length 65 [2019-12-27 02:18:06,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:18:06,064 INFO L462 AbstractCegarLoop]: Abstraction has 11298 states and 35607 transitions. [2019-12-27 02:18:06,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 02:18:06,064 INFO L276 IsEmpty]: Start isEmpty. Operand 11298 states and 35607 transitions. [2019-12-27 02:18:06,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 02:18:06,078 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:18:06,078 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:18:06,078 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:18:06,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:18:06,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1724524394, now seen corresponding path program 4 times [2019-12-27 02:18:06,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:18:06,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682916502] [2019-12-27 02:18:06,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:18:06,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:18:06,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:18:06,167 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682916502] [2019-12-27 02:18:06,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:18:06,167 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:18:06,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107243410] [2019-12-27 02:18:06,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:18:06,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:18:06,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:18:06,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:18:06,169 INFO L87 Difference]: Start difference. First operand 11298 states and 35607 transitions. Second operand 4 states. [2019-12-27 02:18:06,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:18:06,283 INFO L93 Difference]: Finished difference Result 11142 states and 34983 transitions. [2019-12-27 02:18:06,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 02:18:06,284 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-27 02:18:06,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:18:06,303 INFO L225 Difference]: With dead ends: 11142 [2019-12-27 02:18:06,303 INFO L226 Difference]: Without dead ends: 11142 [2019-12-27 02:18:06,304 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:18:06,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11142 states. [2019-12-27 02:18:06,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11142 to 10674. [2019-12-27 02:18:06,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10674 states. [2019-12-27 02:18:06,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10674 states to 10674 states and 33423 transitions. [2019-12-27 02:18:06,609 INFO L78 Accepts]: Start accepts. Automaton has 10674 states and 33423 transitions. Word has length 65 [2019-12-27 02:18:06,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:18:06,609 INFO L462 AbstractCegarLoop]: Abstraction has 10674 states and 33423 transitions. [2019-12-27 02:18:06,609 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:18:06,609 INFO L276 IsEmpty]: Start isEmpty. Operand 10674 states and 33423 transitions. [2019-12-27 02:18:06,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 02:18:06,622 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:18:06,622 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:18:06,622 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:18:06,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:18:06,623 INFO L82 PathProgramCache]: Analyzing trace with hash 837718325, now seen corresponding path program 1 times [2019-12-27 02:18:06,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:18:06,623 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465362676] [2019-12-27 02:18:06,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:18:06,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:18:06,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:18:06,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465362676] [2019-12-27 02:18:06,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:18:06,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:18:06,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859879051] [2019-12-27 02:18:06,694 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:18:06,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:18:06,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:18:06,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:18:06,695 INFO L87 Difference]: Start difference. First operand 10674 states and 33423 transitions. Second operand 3 states. [2019-12-27 02:18:06,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:18:06,745 INFO L93 Difference]: Finished difference Result 10673 states and 33421 transitions. [2019-12-27 02:18:06,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:18:06,745 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 02:18:06,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:18:06,765 INFO L225 Difference]: With dead ends: 10673 [2019-12-27 02:18:06,765 INFO L226 Difference]: Without dead ends: 10673 [2019-12-27 02:18:06,765 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:18:06,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10673 states. [2019-12-27 02:18:06,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10673 to 10673. [2019-12-27 02:18:06,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10673 states. [2019-12-27 02:18:06,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10673 states to 10673 states and 33421 transitions. [2019-12-27 02:18:06,981 INFO L78 Accepts]: Start accepts. Automaton has 10673 states and 33421 transitions. Word has length 65 [2019-12-27 02:18:06,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:18:06,981 INFO L462 AbstractCegarLoop]: Abstraction has 10673 states and 33421 transitions. [2019-12-27 02:18:06,981 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:18:06,982 INFO L276 IsEmpty]: Start isEmpty. Operand 10673 states and 33421 transitions. [2019-12-27 02:18:06,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 02:18:06,993 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:18:06,993 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:18:06,994 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:18:06,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:18:06,994 INFO L82 PathProgramCache]: Analyzing trace with hash 1101261716, now seen corresponding path program 1 times [2019-12-27 02:18:06,994 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:18:06,994 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923737507] [2019-12-27 02:18:06,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:18:07,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:18:07,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:18:07,049 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923737507] [2019-12-27 02:18:07,049 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:18:07,049 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:18:07,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015620783] [2019-12-27 02:18:07,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:18:07,050 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:18:07,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:18:07,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:18:07,050 INFO L87 Difference]: Start difference. First operand 10673 states and 33421 transitions. Second operand 3 states. [2019-12-27 02:18:07,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:18:07,093 INFO L93 Difference]: Finished difference Result 8641 states and 26214 transitions. [2019-12-27 02:18:07,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:18:07,094 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 02:18:07,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:18:07,108 INFO L225 Difference]: With dead ends: 8641 [2019-12-27 02:18:07,108 INFO L226 Difference]: Without dead ends: 8641 [2019-12-27 02:18:07,108 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:18:07,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8641 states. [2019-12-27 02:18:07,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8641 to 8368. [2019-12-27 02:18:07,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8368 states. [2019-12-27 02:18:07,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8368 states to 8368 states and 25353 transitions. [2019-12-27 02:18:07,326 INFO L78 Accepts]: Start accepts. Automaton has 8368 states and 25353 transitions. Word has length 66 [2019-12-27 02:18:07,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:18:07,327 INFO L462 AbstractCegarLoop]: Abstraction has 8368 states and 25353 transitions. [2019-12-27 02:18:07,327 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:18:07,327 INFO L276 IsEmpty]: Start isEmpty. Operand 8368 states and 25353 transitions. [2019-12-27 02:18:07,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 02:18:07,339 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:18:07,339 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:18:07,340 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:18:07,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:18:07,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1000943315, now seen corresponding path program 1 times [2019-12-27 02:18:07,340 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:18:07,341 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402201351] [2019-12-27 02:18:07,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:18:07,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:18:07,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:18:07,630 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402201351] [2019-12-27 02:18:07,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:18:07,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 02:18:07,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426783941] [2019-12-27 02:18:07,632 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 02:18:07,632 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:18:07,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 02:18:07,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-27 02:18:07,633 INFO L87 Difference]: Start difference. First operand 8368 states and 25353 transitions. Second operand 10 states. [2019-12-27 02:18:08,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:18:08,904 INFO L93 Difference]: Finished difference Result 14716 states and 43783 transitions. [2019-12-27 02:18:08,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 02:18:08,905 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-27 02:18:08,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:18:08,919 INFO L225 Difference]: With dead ends: 14716 [2019-12-27 02:18:08,919 INFO L226 Difference]: Without dead ends: 11117 [2019-12-27 02:18:08,919 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2019-12-27 02:18:08,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11117 states. [2019-12-27 02:18:09,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11117 to 8666. [2019-12-27 02:18:09,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8666 states. [2019-12-27 02:18:09,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8666 states to 8666 states and 26101 transitions. [2019-12-27 02:18:09,078 INFO L78 Accepts]: Start accepts. Automaton has 8666 states and 26101 transitions. Word has length 67 [2019-12-27 02:18:09,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:18:09,078 INFO L462 AbstractCegarLoop]: Abstraction has 8666 states and 26101 transitions. [2019-12-27 02:18:09,078 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 02:18:09,078 INFO L276 IsEmpty]: Start isEmpty. Operand 8666 states and 26101 transitions. [2019-12-27 02:18:09,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 02:18:09,087 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:18:09,087 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:18:09,087 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:18:09,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:18:09,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1387520431, now seen corresponding path program 2 times [2019-12-27 02:18:09,087 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:18:09,087 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721082130] [2019-12-27 02:18:09,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:18:09,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:18:09,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:18:09,271 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721082130] [2019-12-27 02:18:09,272 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:18:09,272 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 02:18:09,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123440236] [2019-12-27 02:18:09,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 02:18:09,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:18:09,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 02:18:09,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-27 02:18:09,273 INFO L87 Difference]: Start difference. First operand 8666 states and 26101 transitions. Second operand 10 states. [2019-12-27 02:18:10,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:18:10,583 INFO L93 Difference]: Finished difference Result 15216 states and 44769 transitions. [2019-12-27 02:18:10,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 02:18:10,583 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-27 02:18:10,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:18:10,599 INFO L225 Difference]: With dead ends: 15216 [2019-12-27 02:18:10,599 INFO L226 Difference]: Without dead ends: 12165 [2019-12-27 02:18:10,599 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2019-12-27 02:18:10,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12165 states. [2019-12-27 02:18:10,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12165 to 9002. [2019-12-27 02:18:10,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9002 states. [2019-12-27 02:18:10,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9002 states to 9002 states and 26931 transitions. [2019-12-27 02:18:10,770 INFO L78 Accepts]: Start accepts. Automaton has 9002 states and 26931 transitions. Word has length 67 [2019-12-27 02:18:10,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:18:10,771 INFO L462 AbstractCegarLoop]: Abstraction has 9002 states and 26931 transitions. [2019-12-27 02:18:10,771 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 02:18:10,771 INFO L276 IsEmpty]: Start isEmpty. Operand 9002 states and 26931 transitions. [2019-12-27 02:18:10,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 02:18:10,780 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:18:10,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, 1, 1, 1] [2019-12-27 02:18:10,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-27 02:18:10,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:18:10,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1156359029, now seen corresponding path program 3 times [2019-12-27 02:18:10,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:18:10,780 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197218151] [2019-12-27 02:18:10,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:18:10,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:18:10,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:18:10,972 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197218151] [2019-12-27 02:18:10,972 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:18:10,972 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 02:18:10,973 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152794402] [2019-12-27 02:18:10,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 02:18:10,973 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:18:10,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 02:18:10,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 02:18:10,974 INFO L87 Difference]: Start difference. First operand 9002 states and 26931 transitions. Second operand 11 states. [2019-12-27 02:18:12,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:18:12,345 INFO L93 Difference]: Finished difference Result 14588 states and 42742 transitions. [2019-12-27 02:18:12,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 02:18:12,346 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-27 02:18:12,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:18:12,363 INFO L225 Difference]: With dead ends: 14588 [2019-12-27 02:18:12,363 INFO L226 Difference]: Without dead ends: 11765 [2019-12-27 02:18:12,363 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2019-12-27 02:18:12,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11765 states. [2019-12-27 02:18:12,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11765 to 8714. [2019-12-27 02:18:12,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8714 states. [2019-12-27 02:18:12,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8714 states to 8714 states and 26091 transitions. [2019-12-27 02:18:12,532 INFO L78 Accepts]: Start accepts. Automaton has 8714 states and 26091 transitions. Word has length 67 [2019-12-27 02:18:12,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:18:12,532 INFO L462 AbstractCegarLoop]: Abstraction has 8714 states and 26091 transitions. [2019-12-27 02:18:12,533 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 02:18:12,533 INFO L276 IsEmpty]: Start isEmpty. Operand 8714 states and 26091 transitions. [2019-12-27 02:18:12,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 02:18:12,541 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:18:12,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, 1, 1, 1] [2019-12-27 02:18:12,542 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:18:12,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:18:12,542 INFO L82 PathProgramCache]: Analyzing trace with hash -1555205525, now seen corresponding path program 4 times [2019-12-27 02:18:12,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:18:12,542 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047362419] [2019-12-27 02:18:12,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:18:12,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:18:12,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:18:12,727 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047362419] [2019-12-27 02:18:12,727 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:18:12,727 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 02:18:12,728 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740685676] [2019-12-27 02:18:12,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 02:18:12,728 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:18:12,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 02:18:12,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-12-27 02:18:12,729 INFO L87 Difference]: Start difference. First operand 8714 states and 26091 transitions. Second operand 11 states. [2019-12-27 02:18:13,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:18:13,998 INFO L93 Difference]: Finished difference Result 10605 states and 31433 transitions. [2019-12-27 02:18:13,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 02:18:13,998 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-27 02:18:13,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:18:14,011 INFO L225 Difference]: With dead ends: 10605 [2019-12-27 02:18:14,011 INFO L226 Difference]: Without dead ends: 9442 [2019-12-27 02:18:14,012 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-12-27 02:18:14,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9442 states. [2019-12-27 02:18:14,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9442 to 8898. [2019-12-27 02:18:14,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8898 states. [2019-12-27 02:18:14,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8898 states to 8898 states and 26560 transitions. [2019-12-27 02:18:14,157 INFO L78 Accepts]: Start accepts. Automaton has 8898 states and 26560 transitions. Word has length 67 [2019-12-27 02:18:14,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:18:14,157 INFO L462 AbstractCegarLoop]: Abstraction has 8898 states and 26560 transitions. [2019-12-27 02:18:14,157 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 02:18:14,157 INFO L276 IsEmpty]: Start isEmpty. Operand 8898 states and 26560 transitions. [2019-12-27 02:18:14,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 02:18:14,166 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:18:14,166 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:18:14,166 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:18:14,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:18:14,166 INFO L82 PathProgramCache]: Analyzing trace with hash -2131583359, now seen corresponding path program 5 times [2019-12-27 02:18:14,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:18:14,166 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624077055] [2019-12-27 02:18:14,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:18:14,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:18:14,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:18:14,361 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624077055] [2019-12-27 02:18:14,361 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:18:14,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 02:18:14,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423666829] [2019-12-27 02:18:14,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 02:18:14,362 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:18:14,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 02:18:14,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 02:18:14,363 INFO L87 Difference]: Start difference. First operand 8898 states and 26560 transitions. Second operand 11 states. [2019-12-27 02:18:15,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:18:15,375 INFO L93 Difference]: Finished difference Result 13327 states and 39386 transitions. [2019-12-27 02:18:15,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 02:18:15,376 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-27 02:18:15,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:18:15,398 INFO L225 Difference]: With dead ends: 13327 [2019-12-27 02:18:15,398 INFO L226 Difference]: Without dead ends: 12308 [2019-12-27 02:18:15,399 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=148, Invalid=608, Unknown=0, NotChecked=0, Total=756 [2019-12-27 02:18:15,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12308 states. [2019-12-27 02:18:15,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12308 to 10298. [2019-12-27 02:18:15,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10298 states. [2019-12-27 02:18:15,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10298 states to 10298 states and 30723 transitions. [2019-12-27 02:18:15,650 INFO L78 Accepts]: Start accepts. Automaton has 10298 states and 30723 transitions. Word has length 67 [2019-12-27 02:18:15,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:18:15,650 INFO L462 AbstractCegarLoop]: Abstraction has 10298 states and 30723 transitions. [2019-12-27 02:18:15,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 02:18:15,650 INFO L276 IsEmpty]: Start isEmpty. Operand 10298 states and 30723 transitions. [2019-12-27 02:18:15,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 02:18:15,660 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:18:15,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, 1, 1, 1] [2019-12-27 02:18:15,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-27 02:18:15,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:18:15,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1250353067, now seen corresponding path program 6 times [2019-12-27 02:18:15,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:18:15,661 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246526707] [2019-12-27 02:18:15,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:18:15,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:18:15,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-27 02:18:15,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246526707] [2019-12-27 02:18:15,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:18:15,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 02:18:15,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058553697] [2019-12-27 02:18:15,808 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 02:18:15,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:18:15,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 02:18:15,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 02:18:15,809 INFO L87 Difference]: Start difference. First operand 10298 states and 30723 transitions. Second operand 11 states. [2019-12-27 02:18:16,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:18:16,599 INFO L93 Difference]: Finished difference Result 12574 states and 36849 transitions. [2019-12-27 02:18:16,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 02:18:16,599 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-27 02:18:16,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:18:16,613 INFO L225 Difference]: With dead ends: 12574 [2019-12-27 02:18:16,613 INFO L226 Difference]: Without dead ends: 10559 [2019-12-27 02:18:16,613 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2019-12-27 02:18:16,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10559 states. [2019-12-27 02:18:16,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10559 to 8416. [2019-12-27 02:18:16,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8416 states. [2019-12-27 02:18:16,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8416 states to 8416 states and 25159 transitions. [2019-12-27 02:18:16,778 INFO L78 Accepts]: Start accepts. Automaton has 8416 states and 25159 transitions. Word has length 67 [2019-12-27 02:18:16,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:18:16,779 INFO L462 AbstractCegarLoop]: Abstraction has 8416 states and 25159 transitions. [2019-12-27 02:18:16,779 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 02:18:16,779 INFO L276 IsEmpty]: Start isEmpty. Operand 8416 states and 25159 transitions. [2019-12-27 02:18:16,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 02:18:16,788 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:18:16,788 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:18:16,789 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-27 02:18:16,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:18:16,789 INFO L82 PathProgramCache]: Analyzing trace with hash -945042827, now seen corresponding path program 7 times [2019-12-27 02:18:16,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:18:16,789 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794478498] [2019-12-27 02:18:16,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:18:16,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:18:16,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:18:16,945 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794478498] [2019-12-27 02:18:16,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:18:16,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 02:18:16,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6850781] [2019-12-27 02:18:16,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 02:18:16,946 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:18:16,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 02:18:16,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 02:18:16,947 INFO L87 Difference]: Start difference. First operand 8416 states and 25159 transitions. Second operand 11 states. [2019-12-27 02:18:17,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:18:17,694 INFO L93 Difference]: Finished difference Result 10608 states and 31112 transitions. [2019-12-27 02:18:17,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 02:18:17,694 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-27 02:18:17,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:18:17,708 INFO L225 Difference]: With dead ends: 10608 [2019-12-27 02:18:17,709 INFO L226 Difference]: Without dead ends: 10397 [2019-12-27 02:18:17,709 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=128, Invalid=522, Unknown=0, NotChecked=0, Total=650 [2019-12-27 02:18:17,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10397 states. [2019-12-27 02:18:17,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10397 to 8240. [2019-12-27 02:18:17,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8240 states. [2019-12-27 02:18:17,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8240 states to 8240 states and 24675 transitions. [2019-12-27 02:18:17,861 INFO L78 Accepts]: Start accepts. Automaton has 8240 states and 24675 transitions. Word has length 67 [2019-12-27 02:18:17,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:18:17,862 INFO L462 AbstractCegarLoop]: Abstraction has 8240 states and 24675 transitions. [2019-12-27 02:18:17,862 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 02:18:17,862 INFO L276 IsEmpty]: Start isEmpty. Operand 8240 states and 24675 transitions. [2019-12-27 02:18:17,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 02:18:17,870 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:18:17,870 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:18:17,870 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-27 02:18:17,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:18:17,870 INFO L82 PathProgramCache]: Analyzing trace with hash -1748623595, now seen corresponding path program 8 times [2019-12-27 02:18:17,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:18:17,870 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320553130] [2019-12-27 02:18:17,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:18:17,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 02:18:17,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 02:18:17,999 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 02:18:17,999 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 02:18:18,004 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [905] [905] ULTIMATE.startENTRY-->L842: Formula: (let ((.cse0 (store |v_#valid_67| 0 0))) (and (= v_~b$r_buff1_thd0~0_230 0) (= v_~b$w_buff1~0_176 0) (= v_~b$mem_tmp~0_20 0) (= v_~weak$$choice2~0_144 0) (= 0 v_~b$r_buff1_thd3~0_337) (= 0 v_~b$read_delayed~0_7) (= 0 v_~b$r_buff0_thd2~0_182) (= 0 v_~__unbuffered_p0_EAX~0_176) (= v_~__unbuffered_p1_EBX~0_38 0) (= v_~main$tmp_guard1~0_34 0) (= v_~y~0_19 0) (= 0 v_~__unbuffered_p1_EAX~0_38) (= v_~b$r_buff0_thd0~0_204 0) (< 0 |v_#StackHeapBarrier_17|) (= 0 v_~b$r_buff1_thd1~0_215) (= v_~a~0_14 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t867~0.base_25|)) (= 0 v_~x~0_124) (= 0 v_~b$r_buff0_thd3~0_395) (= v_~__unbuffered_p2_EBX~0_38 0) (= v_~b$read_delayed_var~0.offset_7 0) (= v_~z~0_23 0) (= 0 |v_#NULL.base_4|) (= 0 v_~__unbuffered_p2_EAX~0_34) (= 0 v_~b$w_buff0_used~0_787) (= |v_#valid_65| (store .cse0 |v_ULTIMATE.start_main_~#t867~0.base_25| 1)) (= |v_#NULL.offset_4| 0) (= 0 v_~b$w_buff0~0_250) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t867~0.base_25|) (= v_~__unbuffered_cnt~0_137 0) (= 0 |v_ULTIMATE.start_main_~#t867~0.offset_17|) (= 0 v_~b$w_buff1_used~0_450) (= 0 v_~b$r_buff1_thd2~0_222) (= 0 v_~weak$$choice0~0_13) (= v_~b~0_186 0) (= v_~main$tmp_guard0~0_24 0) (= v_~b$flush_delayed~0_35 0) (= |v_#memory_int_23| (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t867~0.base_25| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t867~0.base_25|) |v_ULTIMATE.start_main_~#t867~0.offset_17| 0))) (= 0 v_~b$read_delayed_var~0.base_7) (= (store |v_#length_26| |v_ULTIMATE.start_main_~#t867~0.base_25| 4) |v_#length_25|) (= 0 v_~b$r_buff0_thd1~0_323))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_67|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_395, ~b$r_buff1_thd1~0=v_~b$r_buff1_thd1~0_215, ~b$read_delayed_var~0.offset=v_~b$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t868~0.offset=|v_ULTIMATE.start_main_~#t868~0.offset_17|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_35|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_245|, ULTIMATE.start_main_~#t867~0.base=|v_ULTIMATE.start_main_~#t867~0.base_25|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_51|, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_787, ~a~0=v_~a~0_14, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_68|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_176, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_38, #length=|v_#length_25|, ~b$w_buff0~0=v_~b$w_buff0~0_250, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_34, ~b$r_buff0_thd0~0=v_~b$r_buff0_thd0~0_204, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_182, ~b$mem_tmp~0=v_~b$mem_tmp~0_20, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_38, ~b$flush_delayed~0=v_~b$flush_delayed~0_35, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ~b$read_delayed~0=v_~b$read_delayed~0_7, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_~#t867~0.offset=|v_ULTIMATE.start_main_~#t867~0.offset_17|, ~b$w_buff1~0=v_~b$w_buff1~0_176, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_137, ~x~0=v_~x~0_124, ~b$r_buff0_thd1~0=v_~b$r_buff0_thd1~0_323, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_34, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_37|, ULTIMATE.start_main_~#t869~0.base=|v_ULTIMATE.start_main_~#t869~0.base_21|, ULTIMATE.start_main_~#t869~0.offset=|v_ULTIMATE.start_main_~#t869~0.offset_17|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_45|, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_450, ~y~0=v_~y~0_19, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_222, ~b$r_buff1_thd0~0=v_~b$r_buff1_thd0~0_230, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_38, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_23|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, #NULL.base=|v_#NULL.base_4|, ~b$read_delayed_var~0.base=v_~b$read_delayed_var~0.base_7, ~b~0=v_~b~0_186, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_28|, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_~#t868~0.base=|v_ULTIMATE.start_main_~#t868~0.base_21|, ~z~0=v_~z~0_23, ~weak$$choice2~0=v_~weak$$choice2~0_144, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_337} AuxVars[] AssignedVars[~b$r_buff0_thd3~0, ~b$r_buff1_thd1~0, ~b$read_delayed_var~0.offset, ULTIMATE.start_main_~#t868~0.offset, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_~#t867~0.base, ULTIMATE.start_main_#t~ite50, ~b$w_buff0_used~0, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~b$w_buff0~0, ~__unbuffered_p2_EAX~0, ~b$r_buff0_thd0~0, ~b$r_buff0_thd2~0, ~b$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~b$flush_delayed~0, ULTIMATE.start_main_#t~nondet45, ~b$read_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_~#t867~0.offset, ~b$w_buff1~0, ~__unbuffered_cnt~0, ~x~0, ~b$r_buff0_thd1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_~#t869~0.base, ULTIMATE.start_main_~#t869~0.offset, ULTIMATE.start_main_#t~ite51, ~b$w_buff1_used~0, ~y~0, ~b$r_buff1_thd2~0, ~b$r_buff1_thd0~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~main$tmp_guard0~0, #NULL.base, ~b$read_delayed_var~0.base, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t868~0.base, ~z~0, ~weak$$choice2~0, ~b$r_buff1_thd3~0] because there is no mapped edge [2019-12-27 02:18:18,005 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [864] [864] L842-1-->L844: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t868~0.base_10|)) (= |v_ULTIMATE.start_main_~#t868~0.offset_9| 0) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t868~0.base_10| 1) |v_#valid_27|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t868~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t868~0.base_10|) |v_ULTIMATE.start_main_~#t868~0.offset_9| 1)) |v_#memory_int_11|) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t868~0.base_10|) 0) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t868~0.base_10| 4) |v_#length_13|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t868~0.base_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t868~0.offset=|v_ULTIMATE.start_main_~#t868~0.offset_9|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t868~0.base=|v_ULTIMATE.start_main_~#t868~0.base_10|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t868~0.offset, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, ULTIMATE.start_main_~#t868~0.base, #length] because there is no mapped edge [2019-12-27 02:18:18,005 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L844-1-->L846: Formula: (and (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t869~0.base_13|) (= |v_ULTIMATE.start_main_~#t869~0.offset_11| 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t869~0.base_13| 4)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t869~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t869~0.base_13|) |v_ULTIMATE.start_main_~#t869~0.offset_11| 2)) |v_#memory_int_15|) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t869~0.base_13| 1)) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t869~0.base_13|)) (not (= |v_ULTIMATE.start_main_~#t869~0.base_13| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t869~0.base=|v_ULTIMATE.start_main_~#t869~0.base_13|, ULTIMATE.start_main_~#t869~0.offset=|v_ULTIMATE.start_main_~#t869~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_36|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_6|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t869~0.base, ULTIMATE.start_main_~#t869~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length] because there is no mapped edge [2019-12-27 02:18:18,008 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L4-->L754: Formula: (and (= ~x~0_In800831541 ~__unbuffered_p0_EAX~0_Out800831541) (= ~b$r_buff1_thd0~0_Out800831541 ~b$r_buff0_thd0~0_In800831541) (= ~b$r_buff1_thd3~0_Out800831541 ~b$r_buff0_thd3~0_In800831541) (= ~b$r_buff1_thd1~0_Out800831541 ~b$r_buff0_thd1~0_In800831541) (not (= 0 P0Thread1of1ForFork2___VERIFIER_assert_~expression_In800831541)) (= ~b$r_buff0_thd1~0_Out800831541 1) (= ~b$r_buff1_thd2~0_Out800831541 ~b$r_buff0_thd2~0_In800831541)) InVars {~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In800831541, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In800831541, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In800831541, P0Thread1of1ForFork2___VERIFIER_assert_~expression=P0Thread1of1ForFork2___VERIFIER_assert_~expression_In800831541, ~x~0=~x~0_In800831541, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In800831541} OutVars{~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_Out800831541, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In800831541, ~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out800831541, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In800831541, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_Out800831541, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_Out800831541, P0Thread1of1ForFork2___VERIFIER_assert_~expression=P0Thread1of1ForFork2___VERIFIER_assert_~expression_In800831541, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_Out800831541, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_Out800831541, ~x~0=~x~0_In800831541, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In800831541} AuxVars[] AssignedVars[~b$r_buff0_thd1~0, ~__unbuffered_p0_EAX~0, ~b$r_buff1_thd1~0, ~b$r_buff1_thd0~0, ~b$r_buff1_thd2~0, ~b$r_buff1_thd3~0] because there is no mapped edge [2019-12-27 02:18:18,010 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L780-2-->L780-4: Formula: (let ((.cse1 (= (mod ~b$w_buff1_used~0_In1323269510 256) 0)) (.cse0 (= (mod ~b$r_buff1_thd2~0_In1323269510 256) 0))) (or (and (or .cse0 .cse1) (= ~b~0_In1323269510 |P1Thread1of1ForFork0_#t~ite9_Out1323269510|)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork0_#t~ite9_Out1323269510| ~b$w_buff1~0_In1323269510)))) InVars {~b$w_buff1_used~0=~b$w_buff1_used~0_In1323269510, ~b~0=~b~0_In1323269510, ~b$w_buff1~0=~b$w_buff1~0_In1323269510, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In1323269510} OutVars{~b$w_buff1_used~0=~b$w_buff1_used~0_In1323269510, ~b~0=~b~0_In1323269510, ~b$w_buff1~0=~b$w_buff1~0_In1323269510, P1Thread1of1ForFork0_#t~ite9=|P1Thread1of1ForFork0_#t~ite9_Out1323269510|, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In1323269510} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite9] because there is no mapped edge [2019-12-27 02:18:18,011 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L780-4-->L781: Formula: (= v_~b~0_66 |v_P1Thread1of1ForFork0_#t~ite9_34|) InVars {P1Thread1of1ForFork0_#t~ite9=|v_P1Thread1of1ForFork0_#t~ite9_34|} OutVars{~b~0=v_~b~0_66, P1Thread1of1ForFork0_#t~ite10=|v_P1Thread1of1ForFork0_#t~ite10_53|, P1Thread1of1ForFork0_#t~ite9=|v_P1Thread1of1ForFork0_#t~ite9_33|} AuxVars[] AssignedVars[~b~0, P1Thread1of1ForFork0_#t~ite10, P1Thread1of1ForFork0_#t~ite9] because there is no mapped edge [2019-12-27 02:18:18,011 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L781-->L781-2: Formula: (let ((.cse0 (= 0 (mod ~b$r_buff0_thd2~0_In-942477542 256))) (.cse1 (= 0 (mod ~b$w_buff0_used~0_In-942477542 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite11_Out-942477542| ~b$w_buff0_used~0_In-942477542) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork0_#t~ite11_Out-942477542| 0)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-942477542, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-942477542} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-942477542, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-942477542, P1Thread1of1ForFork0_#t~ite11=|P1Thread1of1ForFork0_#t~ite11_Out-942477542|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite11] because there is no mapped edge [2019-12-27 02:18:18,011 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L782-->L782-2: Formula: (let ((.cse2 (= (mod ~b$w_buff1_used~0_In1742055758 256) 0)) (.cse3 (= (mod ~b$r_buff1_thd2~0_In1742055758 256) 0)) (.cse1 (= 0 (mod ~b$w_buff0_used~0_In1742055758 256))) (.cse0 (= (mod ~b$r_buff0_thd2~0_In1742055758 256) 0))) (or (and (or .cse0 .cse1) (= ~b$w_buff1_used~0_In1742055758 |P1Thread1of1ForFork0_#t~ite12_Out1742055758|) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork0_#t~ite12_Out1742055758| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In1742055758, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In1742055758, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1742055758, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In1742055758} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In1742055758, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In1742055758, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1742055758, P1Thread1of1ForFork0_#t~ite12=|P1Thread1of1ForFork0_#t~ite12_Out1742055758|, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In1742055758} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-27 02:18:18,012 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L783-->L783-2: Formula: (let ((.cse1 (= 0 (mod ~b$r_buff0_thd2~0_In196435051 256))) (.cse0 (= (mod ~b$w_buff0_used~0_In196435051 256) 0))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork0_#t~ite13_Out196435051|) (not .cse1)) (and (or .cse1 .cse0) (= ~b$r_buff0_thd2~0_In196435051 |P1Thread1of1ForFork0_#t~ite13_Out196435051|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In196435051, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In196435051} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In196435051, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In196435051, P1Thread1of1ForFork0_#t~ite13=|P1Thread1of1ForFork0_#t~ite13_Out196435051|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite13] because there is no mapped edge [2019-12-27 02:18:18,013 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L784-->L784-2: Formula: (let ((.cse0 (= 0 (mod ~b$w_buff0_used~0_In-596614709 256))) (.cse1 (= 0 (mod ~b$r_buff0_thd2~0_In-596614709 256))) (.cse3 (= 0 (mod ~b$w_buff1_used~0_In-596614709 256))) (.cse2 (= (mod ~b$r_buff1_thd2~0_In-596614709 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite14_Out-596614709|)) (and (or .cse0 .cse1) (= ~b$r_buff1_thd2~0_In-596614709 |P1Thread1of1ForFork0_#t~ite14_Out-596614709|) (or .cse3 .cse2)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-596614709, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-596614709, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-596614709, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In-596614709} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-596614709, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-596614709, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-596614709, P1Thread1of1ForFork0_#t~ite14=|P1Thread1of1ForFork0_#t~ite14_Out-596614709|, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In-596614709} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-27 02:18:18,013 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [860] [860] L784-2-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_68 (+ v_~__unbuffered_cnt~0_69 1)) (= v_~b$r_buff1_thd2~0_85 |v_P1Thread1of1ForFork0_#t~ite14_32|) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69, P1Thread1of1ForFork0_#t~ite14=|v_P1Thread1of1ForFork0_#t~ite14_32|} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68, P1Thread1of1ForFork0_#t~ite14=|v_P1Thread1of1ForFork0_#t~ite14_31|, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_85, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[~__unbuffered_cnt~0, P1Thread1of1ForFork0_#t~ite14, P1Thread1of1ForFork0_#res.offset, ~b$r_buff1_thd2~0, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-27 02:18:18,015 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [884] [884] L808-->L808-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In1141933146 256)))) (or (and (let ((.cse0 (= 0 (mod ~b$r_buff0_thd3~0_In1141933146 256)))) (or (= 0 (mod ~b$w_buff0_used~0_In1141933146 256)) (and .cse0 (= 0 (mod ~b$w_buff1_used~0_In1141933146 256))) (and (= (mod ~b$r_buff1_thd3~0_In1141933146 256) 0) .cse0))) (= ~b$w_buff0~0_In1141933146 |P2Thread1of1ForFork1_#t~ite20_Out1141933146|) .cse1 (= |P2Thread1of1ForFork1_#t~ite21_Out1141933146| |P2Thread1of1ForFork1_#t~ite20_Out1141933146|)) (and (not .cse1) (= |P2Thread1of1ForFork1_#t~ite20_In1141933146| |P2Thread1of1ForFork1_#t~ite20_Out1141933146|) (= |P2Thread1of1ForFork1_#t~ite21_Out1141933146| ~b$w_buff0~0_In1141933146)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In1141933146, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In1141933146, P2Thread1of1ForFork1_#t~ite20=|P2Thread1of1ForFork1_#t~ite20_In1141933146|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1141933146, ~b$w_buff0~0=~b$w_buff0~0_In1141933146, ~weak$$choice2~0=~weak$$choice2~0_In1141933146, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In1141933146} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In1141933146, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In1141933146, P2Thread1of1ForFork1_#t~ite20=|P2Thread1of1ForFork1_#t~ite20_Out1141933146|, P2Thread1of1ForFork1_#t~ite21=|P2Thread1of1ForFork1_#t~ite21_Out1141933146|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1141933146, ~b$w_buff0~0=~b$w_buff0~0_In1141933146, ~weak$$choice2~0=~weak$$choice2~0_In1141933146, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In1141933146} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite20, P2Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-27 02:18:18,017 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [885] [885] L810-->L810-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1480443862 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite26_Out-1480443862| |P2Thread1of1ForFork1_#t~ite27_Out-1480443862|) .cse0 (= |P2Thread1of1ForFork1_#t~ite26_Out-1480443862| ~b$w_buff0_used~0_In-1480443862) (let ((.cse1 (= (mod ~b$r_buff0_thd3~0_In-1480443862 256) 0))) (or (= (mod ~b$w_buff0_used~0_In-1480443862 256) 0) (and (= 0 (mod ~b$w_buff1_used~0_In-1480443862 256)) .cse1) (and (= 0 (mod ~b$r_buff1_thd3~0_In-1480443862 256)) .cse1)))) (and (= ~b$w_buff0_used~0_In-1480443862 |P2Thread1of1ForFork1_#t~ite27_Out-1480443862|) (not .cse0) (= |P2Thread1of1ForFork1_#t~ite26_In-1480443862| |P2Thread1of1ForFork1_#t~ite26_Out-1480443862|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-1480443862, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-1480443862, P2Thread1of1ForFork1_#t~ite26=|P2Thread1of1ForFork1_#t~ite26_In-1480443862|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1480443862, ~weak$$choice2~0=~weak$$choice2~0_In-1480443862, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-1480443862} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-1480443862, P2Thread1of1ForFork1_#t~ite26=|P2Thread1of1ForFork1_#t~ite26_Out-1480443862|, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-1480443862, P2Thread1of1ForFork1_#t~ite27=|P2Thread1of1ForFork1_#t~ite27_Out-1480443862|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1480443862, ~weak$$choice2~0=~weak$$choice2~0_In-1480443862, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-1480443862} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite26, P2Thread1of1ForFork1_#t~ite27] because there is no mapped edge [2019-12-27 02:18:18,019 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L812-->L813: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_15 256))) (= v_~b$r_buff0_thd3~0_79 v_~b$r_buff0_thd3~0_78)) InVars {~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_79, ~weak$$choice2~0=v_~weak$$choice2~0_15} OutVars{~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_78, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_9|, P2Thread1of1ForFork1_#t~ite31=|v_P2Thread1of1ForFork1_#t~ite31_8|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_9|, ~weak$$choice2~0=v_~weak$$choice2~0_15} AuxVars[] AssignedVars[~b$r_buff0_thd3~0, P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite31, P2Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-27 02:18:18,020 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L815-->L819: Formula: (and (= v_~b$flush_delayed~0_7 0) (not (= (mod v_~b$flush_delayed~0_8 256) 0)) (= v_~b~0_30 v_~b$mem_tmp~0_5)) InVars {~b$mem_tmp~0=v_~b$mem_tmp~0_5, ~b$flush_delayed~0=v_~b$flush_delayed~0_8} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_5, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_7|, ~b~0=v_~b~0_30, ~b$flush_delayed~0=v_~b$flush_delayed~0_7} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, ~b~0, ~b$flush_delayed~0] because there is no mapped edge [2019-12-27 02:18:18,021 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L819-2-->L819-4: Formula: (let ((.cse0 (= 0 (mod ~b$r_buff1_thd3~0_In1844593704 256))) (.cse1 (= (mod ~b$w_buff1_used~0_In1844593704 256) 0))) (or (and (= ~b~0_In1844593704 |P2Thread1of1ForFork1_#t~ite38_Out1844593704|) (or .cse0 .cse1)) (and (= ~b$w_buff1~0_In1844593704 |P2Thread1of1ForFork1_#t~ite38_Out1844593704|) (not .cse0) (not .cse1)))) InVars {~b$w_buff1_used~0=~b$w_buff1_used~0_In1844593704, ~b~0=~b~0_In1844593704, ~b$w_buff1~0=~b$w_buff1~0_In1844593704, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In1844593704} OutVars{P2Thread1of1ForFork1_#t~ite38=|P2Thread1of1ForFork1_#t~ite38_Out1844593704|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1844593704, ~b~0=~b~0_In1844593704, ~b$w_buff1~0=~b$w_buff1~0_In1844593704, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In1844593704} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite38] because there is no mapped edge [2019-12-27 02:18:18,021 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L819-4-->L820: Formula: (= v_~b~0_46 |v_P2Thread1of1ForFork1_#t~ite38_12|) InVars {P2Thread1of1ForFork1_#t~ite38=|v_P2Thread1of1ForFork1_#t~ite38_12|} OutVars{P2Thread1of1ForFork1_#t~ite38=|v_P2Thread1of1ForFork1_#t~ite38_11|, ~b~0=v_~b~0_46, P2Thread1of1ForFork1_#t~ite39=|v_P2Thread1of1ForFork1_#t~ite39_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite38, ~b~0, P2Thread1of1ForFork1_#t~ite39] because there is no mapped edge [2019-12-27 02:18:18,021 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L820-->L820-2: Formula: (let ((.cse0 (= (mod ~b$w_buff0_used~0_In1242003515 256) 0)) (.cse1 (= (mod ~b$r_buff0_thd3~0_In1242003515 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork1_#t~ite40_Out1242003515| 0)) (and (= ~b$w_buff0_used~0_In1242003515 |P2Thread1of1ForFork1_#t~ite40_Out1242003515|) (or .cse0 .cse1)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In1242003515, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In1242003515} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In1242003515, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In1242003515, P2Thread1of1ForFork1_#t~ite40=|P2Thread1of1ForFork1_#t~ite40_Out1242003515|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite40] because there is no mapped edge [2019-12-27 02:18:18,022 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L821-->L821-2: Formula: (let ((.cse1 (= (mod ~b$r_buff1_thd3~0_In-512266728 256) 0)) (.cse0 (= (mod ~b$w_buff1_used~0_In-512266728 256) 0)) (.cse3 (= 0 (mod ~b$r_buff0_thd3~0_In-512266728 256))) (.cse2 (= (mod ~b$w_buff0_used~0_In-512266728 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork1_#t~ite41_Out-512266728| 0)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork1_#t~ite41_Out-512266728| ~b$w_buff1_used~0_In-512266728) (or .cse3 .cse2)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-512266728, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-512266728, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-512266728, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-512266728} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-512266728, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-512266728, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-512266728, P2Thread1of1ForFork1_#t~ite41=|P2Thread1of1ForFork1_#t~ite41_Out-512266728|, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-512266728} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite41] because there is no mapped edge [2019-12-27 02:18:18,023 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L822-->L822-2: Formula: (let ((.cse0 (= (mod ~b$w_buff0_used~0_In-1230442807 256) 0)) (.cse1 (= (mod ~b$r_buff0_thd3~0_In-1230442807 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite42_Out-1230442807| ~b$r_buff0_thd3~0_In-1230442807)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork1_#t~ite42_Out-1230442807| 0)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-1230442807, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-1230442807} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-1230442807, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-1230442807, P2Thread1of1ForFork1_#t~ite42=|P2Thread1of1ForFork1_#t~ite42_Out-1230442807|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite42] because there is no mapped edge [2019-12-27 02:18:18,023 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L823-->L823-2: Formula: (let ((.cse2 (= (mod ~b$r_buff1_thd3~0_In1589963394 256) 0)) (.cse3 (= 0 (mod ~b$w_buff1_used~0_In1589963394 256))) (.cse0 (= 0 (mod ~b$r_buff0_thd3~0_In1589963394 256))) (.cse1 (= (mod ~b$w_buff0_used~0_In1589963394 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite43_Out1589963394| ~b$r_buff1_thd3~0_In1589963394) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |P2Thread1of1ForFork1_#t~ite43_Out1589963394| 0)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In1589963394, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In1589963394, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1589963394, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In1589963394} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In1589963394, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In1589963394, P2Thread1of1ForFork1_#t~ite43=|P2Thread1of1ForFork1_#t~ite43_Out1589963394|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1589963394, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In1589963394} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite43] because there is no mapped edge [2019-12-27 02:18:18,024 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L823-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= |v_P2Thread1of1ForFork1_#t~ite43_44| v_~b$r_buff1_thd3~0_140) (= (+ v_~__unbuffered_cnt~0_63 1) v_~__unbuffered_cnt~0_62)) InVars {P2Thread1of1ForFork1_#t~ite43=|v_P2Thread1of1ForFork1_#t~ite43_44|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63} OutVars{P2Thread1of1ForFork1_#t~ite43=|v_P2Thread1of1ForFork1_#t~ite43_43|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_140, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite43, P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, ~b$r_buff1_thd3~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-27 02:18:18,024 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L755-->L755-2: Formula: (let ((.cse1 (= (mod ~b$r_buff0_thd1~0_In1908922775 256) 0)) (.cse0 (= 0 (mod ~b$w_buff0_used~0_In1908922775 256)))) (or (and (= ~b$w_buff0_used~0_In1908922775 |P0Thread1of1ForFork2_#t~ite5_Out1908922775|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P0Thread1of1ForFork2_#t~ite5_Out1908922775|) (not .cse0)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In1908922775, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In1908922775} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In1908922775, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In1908922775, P0Thread1of1ForFork2_#t~ite5=|P0Thread1of1ForFork2_#t~ite5_Out1908922775|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-27 02:18:18,024 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L756-->L756-2: Formula: (let ((.cse3 (= (mod ~b$r_buff1_thd1~0_In894177691 256) 0)) (.cse2 (= 0 (mod ~b$w_buff1_used~0_In894177691 256))) (.cse1 (= 0 (mod ~b$w_buff0_used~0_In894177691 256))) (.cse0 (= (mod ~b$r_buff0_thd1~0_In894177691 256) 0))) (or (and (or .cse0 .cse1) (= ~b$w_buff1_used~0_In894177691 |P0Thread1of1ForFork2_#t~ite6_Out894177691|) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |P0Thread1of1ForFork2_#t~ite6_Out894177691|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In894177691, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In894177691, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_In894177691, ~b$w_buff1_used~0=~b$w_buff1_used~0_In894177691} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In894177691, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In894177691, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_In894177691, ~b$w_buff1_used~0=~b$w_buff1_used~0_In894177691, P0Thread1of1ForFork2_#t~ite6=|P0Thread1of1ForFork2_#t~ite6_Out894177691|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-27 02:18:18,025 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L757-->L758: Formula: (let ((.cse0 (= 0 (mod ~b$r_buff0_thd1~0_In891824981 256))) (.cse1 (= (mod ~b$w_buff0_used~0_In891824981 256) 0))) (or (and (not .cse0) (= 0 ~b$r_buff0_thd1~0_Out891824981) (not .cse1)) (and (or .cse0 .cse1) (= ~b$r_buff0_thd1~0_In891824981 ~b$r_buff0_thd1~0_Out891824981)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In891824981, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In891824981} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In891824981, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_Out891824981, P0Thread1of1ForFork2_#t~ite7=|P0Thread1of1ForFork2_#t~ite7_Out891824981|} AuxVars[] AssignedVars[~b$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-27 02:18:18,025 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L758-->L758-2: Formula: (let ((.cse2 (= 0 (mod ~b$w_buff1_used~0_In-1410789225 256))) (.cse3 (= (mod ~b$r_buff1_thd1~0_In-1410789225 256) 0)) (.cse1 (= 0 (mod ~b$r_buff0_thd1~0_In-1410789225 256))) (.cse0 (= (mod ~b$w_buff0_used~0_In-1410789225 256) 0))) (or (and (= 0 |P0Thread1of1ForFork2_#t~ite8_Out-1410789225|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |P0Thread1of1ForFork2_#t~ite8_Out-1410789225| ~b$r_buff1_thd1~0_In-1410789225)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-1410789225, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In-1410789225, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_In-1410789225, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1410789225} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-1410789225, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In-1410789225, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_In-1410789225, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1410789225, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out-1410789225|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 02:18:18,026 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L758-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#res.offset_5| 0) (= 0 |v_P0Thread1of1ForFork2_#res.base_5|) (= |v_P0Thread1of1ForFork2_#t~ite8_36| v_~b$r_buff1_thd1~0_103) (= (+ v_~__unbuffered_cnt~0_81 1) v_~__unbuffered_cnt~0_80)) InVars {P0Thread1of1ForFork2_#t~ite8=|v_P0Thread1of1ForFork2_#t~ite8_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_81} OutVars{~b$r_buff1_thd1~0=v_~b$r_buff1_thd1~0_103, P0Thread1of1ForFork2_#t~ite8=|v_P0Thread1of1ForFork2_#t~ite8_35|, P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_80, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[~b$r_buff1_thd1~0, P0Thread1of1ForFork2_#t~ite8, P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 02:18:18,026 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L846-1-->L852: Formula: (and (= 3 v_~__unbuffered_cnt~0_33) (= v_~main$tmp_guard0~0_8 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 02:18:18,026 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L852-2-->L852-4: Formula: (let ((.cse0 (= 0 (mod ~b$w_buff1_used~0_In700895104 256))) (.cse1 (= 0 (mod ~b$r_buff1_thd0~0_In700895104 256)))) (or (and (= ~b~0_In700895104 |ULTIMATE.start_main_#t~ite47_Out700895104|) (or .cse0 .cse1)) (and (= ~b$w_buff1~0_In700895104 |ULTIMATE.start_main_#t~ite47_Out700895104|) (not .cse0) (not .cse1)))) InVars {~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In700895104, ~b$w_buff1_used~0=~b$w_buff1_used~0_In700895104, ~b~0=~b~0_In700895104, ~b$w_buff1~0=~b$w_buff1~0_In700895104} OutVars{~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In700895104, ~b$w_buff1_used~0=~b$w_buff1_used~0_In700895104, ~b~0=~b~0_In700895104, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out700895104|, ~b$w_buff1~0=~b$w_buff1~0_In700895104} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-27 02:18:18,026 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L852-4-->L853: Formula: (= v_~b~0_51 |v_ULTIMATE.start_main_#t~ite47_11|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_11|} OutVars{~b~0=v_~b~0_51, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_10|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_6|} AuxVars[] AssignedVars[~b~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 02:18:18,026 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L853-->L853-2: Formula: (let ((.cse0 (= (mod ~b$r_buff0_thd0~0_In-515522677 256) 0)) (.cse1 (= 0 (mod ~b$w_buff0_used~0_In-515522677 256)))) (or (and (= ~b$w_buff0_used~0_In-515522677 |ULTIMATE.start_main_#t~ite49_Out-515522677|) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite49_Out-515522677|) (not .cse0) (not .cse1)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-515522677, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-515522677} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-515522677, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-515522677|, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-515522677} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 02:18:18,027 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [853] [853] L854-->L854-2: Formula: (let ((.cse2 (= (mod ~b$w_buff1_used~0_In-1525156330 256) 0)) (.cse3 (= (mod ~b$r_buff1_thd0~0_In-1525156330 256) 0)) (.cse0 (= (mod ~b$w_buff0_used~0_In-1525156330 256) 0)) (.cse1 (= 0 (mod ~b$r_buff0_thd0~0_In-1525156330 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~b$w_buff1_used~0_In-1525156330 |ULTIMATE.start_main_#t~ite50_Out-1525156330|)) (and (= |ULTIMATE.start_main_#t~ite50_Out-1525156330| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-1525156330, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In-1525156330, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1525156330, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-1525156330} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-1525156330|, ~b$w_buff0_used~0=~b$w_buff0_used~0_In-1525156330, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In-1525156330, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1525156330, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-1525156330} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 02:18:18,028 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L855-->L855-2: Formula: (let ((.cse1 (= (mod ~b$r_buff0_thd0~0_In1303887060 256) 0)) (.cse0 (= (mod ~b$w_buff0_used~0_In1303887060 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite51_Out1303887060|)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite51_Out1303887060| ~b$r_buff0_thd0~0_In1303887060)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In1303887060, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In1303887060} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In1303887060, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out1303887060|, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In1303887060} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 02:18:18,029 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L856-->L856-2: Formula: (let ((.cse2 (= 0 (mod ~b$r_buff1_thd0~0_In-1603551867 256))) (.cse3 (= 0 (mod ~b$w_buff1_used~0_In-1603551867 256))) (.cse1 (= (mod ~b$r_buff0_thd0~0_In-1603551867 256) 0)) (.cse0 (= (mod ~b$w_buff0_used~0_In-1603551867 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite52_Out-1603551867|)) (and (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite52_Out-1603551867| ~b$r_buff1_thd0~0_In-1603551867) (or .cse1 .cse0)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-1603551867, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In-1603551867, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1603551867, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-1603551867} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-1603551867, ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-1603551867|, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In-1603551867, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1603551867, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-1603551867} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 02:18:18,029 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [890] [890] L856-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 1 v_~__unbuffered_p2_EAX~0_19) (= v_~b$r_buff1_thd0~0_185 |v_ULTIMATE.start_main_#t~ite52_39|) (= v_~main$tmp_guard1~0_18 0) (= v_~__unbuffered_p1_EBX~0_20 0) (= 1 v_~__unbuffered_p1_EAX~0_20) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= 0 v_~__unbuffered_p0_EAX~0_139) (= v_~__unbuffered_p2_EBX~0_26 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_18 256))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_139, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_39|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_20, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_19} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_139, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_38|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_20, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_26, ~b$r_buff1_thd0~0=v_~b$r_buff1_thd0~0_185, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_20, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_19, 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, ~b$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 02:18:18,127 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 02:18:18 BasicIcfg [2019-12-27 02:18:18,128 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 02:18:18,129 INFO L168 Benchmark]: Toolchain (without parser) took 112925.33 ms. Allocated memory was 135.3 MB in the beginning and 2.8 GB in the end (delta: 2.7 GB). Free memory was 98.7 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2019-12-27 02:18:18,130 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 135.3 MB. Free memory was 118.5 MB in the beginning and 118.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 02:18:18,130 INFO L168 Benchmark]: CACSL2BoogieTranslator took 792.97 ms. Allocated memory was 135.3 MB in the beginning and 200.8 MB in the end (delta: 65.5 MB). Free memory was 98.3 MB in the beginning and 153.8 MB in the end (delta: -55.5 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. [2019-12-27 02:18:18,130 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.71 ms. Allocated memory is still 200.8 MB. Free memory was 153.8 MB in the beginning and 150.9 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-27 02:18:18,131 INFO L168 Benchmark]: Boogie Preprocessor took 59.26 ms. Allocated memory is still 200.8 MB. Free memory was 150.9 MB in the beginning and 148.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-27 02:18:18,131 INFO L168 Benchmark]: RCFGBuilder took 846.03 ms. Allocated memory is still 200.8 MB. Free memory was 148.8 MB in the beginning and 97.6 MB in the end (delta: 51.2 MB). Peak memory consumption was 51.2 MB. Max. memory is 7.1 GB. [2019-12-27 02:18:18,132 INFO L168 Benchmark]: TraceAbstraction took 111161.62 ms. Allocated memory was 200.8 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 97.6 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-12-27 02:18:18,134 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.22 ms. Allocated memory is still 135.3 MB. Free memory was 118.5 MB in the beginning and 118.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 792.97 ms. Allocated memory was 135.3 MB in the beginning and 200.8 MB in the end (delta: 65.5 MB). Free memory was 98.3 MB in the beginning and 153.8 MB in the end (delta: -55.5 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 60.71 ms. Allocated memory is still 200.8 MB. Free memory was 153.8 MB in the beginning and 150.9 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 59.26 ms. Allocated memory is still 200.8 MB. Free memory was 150.9 MB in the beginning and 148.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 846.03 ms. Allocated memory is still 200.8 MB. Free memory was 148.8 MB in the beginning and 97.6 MB in the end (delta: 51.2 MB). Peak memory consumption was 51.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 111161.62 ms. Allocated memory was 200.8 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 97.6 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.0s, 180 ProgramPointsBefore, 96 ProgramPointsAfterwards, 217 TransitionsBefore, 105 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 32 ChoiceCompositions, 7698 VarBasedMoverChecksPositive, 261 VarBasedMoverChecksNegative, 64 SemBasedMoverChecksPositive, 271 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 0 MoverChecksTotal, 83556 CheckedPairsTotal, 115 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L842] FCALL, FORK 0 pthread_create(&t867, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L844] FCALL, FORK 0 pthread_create(&t868, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L846] FCALL, FORK 0 pthread_create(&t869, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L739] 1 b$w_buff1 = b$w_buff0 [L740] 1 b$w_buff0 = 1 [L741] 1 b$w_buff1_used = b$w_buff0_used [L742] 1 b$w_buff0_used = (_Bool)1 [L754] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L768] 2 x = 1 [L771] 2 y = 1 [L774] 2 __unbuffered_p1_EAX = y [L777] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L780] 2 b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L754] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L781] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L782] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L783] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L794] 3 z = 1 [L797] 3 a = 1 [L800] 3 __unbuffered_p2_EAX = a [L803] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L804] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L805] 3 b$flush_delayed = weak$$choice2 [L806] 3 b$mem_tmp = b VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L807] EXPR 3 !b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff1) VAL [!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L807] 3 b = !b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff1) [L808] 3 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff0)) [L809] EXPR 3 weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff1 : b$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff1 : b$w_buff1))=0, x=1, y=1, z=1] [L809] 3 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff1 : b$w_buff1)) [L810] 3 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used)) [L811] EXPR 3 weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L811] 3 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L813] EXPR 3 weak$$choice2 ? b$r_buff1_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff1_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? b$r_buff1_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff1_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L813] 3 b$r_buff1_thd3 = weak$$choice2 ? b$r_buff1_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff1_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L814] 3 __unbuffered_p2_EBX = b VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L819] 3 b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L820] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L821] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L822] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L755] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L756] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L852] 0 b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L853] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L854] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L855] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 171 locations, 2 error locations. Result: UNSAFE, OverallTime: 110.8s, OverallIterations: 33, TraceHistogramMax: 1, AutomataDifference: 31.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7004 SDtfs, 10914 SDslu, 24590 SDs, 0 SdLazy, 11907 SolverSat, 432 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 421 GetRequests, 70 SyntacticMatches, 11 SemanticMatches, 340 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1187 ImplicationChecksByTransitivity, 4.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=171775occurred 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: 45.6s AutomataMinimizationTime, 32 MinimizatonAttempts, 169059 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 1646 NumberOfCodeBlocks, 1646 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 1547 ConstructedInterpolants, 0 QuantifiedInterpolants, 285161 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 32 InterpolantComputations, 32 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...