/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix002_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 15:30:03,774 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 15:30:03,777 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 15:30:03,796 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 15:30:03,796 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 15:30:03,797 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 15:30:03,799 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 15:30:03,813 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 15:30:03,814 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 15:30:03,816 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 15:30:03,818 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 15:30:03,820 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 15:30:03,820 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 15:30:03,821 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 15:30:03,822 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 15:30:03,823 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 15:30:03,824 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 15:30:03,826 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 15:30:03,828 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 15:30:03,832 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 15:30:03,833 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 15:30:03,837 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 15:30:03,838 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 15:30:03,840 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 15:30:03,844 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 15:30:03,844 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 15:30:03,844 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 15:30:03,846 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 15:30:03,848 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 15:30:03,850 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 15:30:03,850 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 15:30:03,852 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 15:30:03,853 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 15:30:03,854 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 15:30:03,858 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 15:30:03,858 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 15:30:03,860 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 15:30:03,860 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 15:30:03,860 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 15:30:03,862 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 15:30:03,863 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 15:30:03,864 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf [2019-12-27 15:30:03,885 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 15:30:03,885 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 15:30:03,887 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 15:30:03,887 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 15:30:03,887 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 15:30:03,888 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 15:30:03,888 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 15:30:03,889 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 15:30:03,889 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 15:30:03,889 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 15:30:03,890 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 15:30:03,890 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 15:30:03,891 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 15:30:03,891 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 15:30:03,891 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 15:30:03,891 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 15:30:03,891 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 15:30:03,892 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 15:30:03,892 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 15:30:03,892 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 15:30:03,892 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 15:30:03,892 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 15:30:03,893 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 15:30:03,893 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 15:30:03,893 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 15:30:03,893 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 15:30:03,893 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 15:30:03,894 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 15:30:03,894 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 15:30:03,894 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 15:30:03,895 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 15:30:04,166 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 15:30:04,187 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 15:30:04,190 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 15:30:04,192 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 15:30:04,192 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 15:30:04,193 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix002_power.oepc.i [2019-12-27 15:30:04,266 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd5adde80/1e11b7b7e0a742e4837beef41fe48299/FLAG192f627a1 [2019-12-27 15:30:04,888 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 15:30:04,889 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix002_power.oepc.i [2019-12-27 15:30:04,908 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd5adde80/1e11b7b7e0a742e4837beef41fe48299/FLAG192f627a1 [2019-12-27 15:30:05,110 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd5adde80/1e11b7b7e0a742e4837beef41fe48299 [2019-12-27 15:30:05,119 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 15:30:05,121 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 15:30:05,122 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 15:30:05,122 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 15:30:05,126 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 15:30:05,127 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:30:05" (1/1) ... [2019-12-27 15:30:05,130 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ba015a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:30:05, skipping insertion in model container [2019-12-27 15:30:05,130 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:30:05" (1/1) ... [2019-12-27 15:30:05,138 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 15:30:05,188 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 15:30:05,755 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 15:30:05,767 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 15:30:05,842 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 15:30:05,926 INFO L208 MainTranslator]: Completed translation [2019-12-27 15:30:05,926 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:30:05 WrapperNode [2019-12-27 15:30:05,926 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 15:30:05,927 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 15:30:05,927 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 15:30:05,927 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 15:30:05,936 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:30:05" (1/1) ... [2019-12-27 15:30:05,958 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:30:05" (1/1) ... [2019-12-27 15:30:05,999 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 15:30:06,000 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 15:30:06,000 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 15:30:06,000 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 15:30:06,008 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:30:05" (1/1) ... [2019-12-27 15:30:06,009 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:30:05" (1/1) ... [2019-12-27 15:30:06,013 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:30:05" (1/1) ... [2019-12-27 15:30:06,014 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:30:05" (1/1) ... [2019-12-27 15:30:06,025 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:30:05" (1/1) ... [2019-12-27 15:30:06,029 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:30:05" (1/1) ... [2019-12-27 15:30:06,033 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:30:05" (1/1) ... [2019-12-27 15:30:06,038 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 15:30:06,039 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 15:30:06,039 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 15:30:06,039 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 15:30:06,040 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:30:05" (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 15:30:06,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 15:30:06,119 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 15:30:06,119 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 15:30:06,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 15:30:06,120 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 15:30:06,120 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 15:30:06,120 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 15:30:06,121 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 15:30:06,121 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 15:30:06,121 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 15:30:06,121 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 15:30:06,121 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 15:30:06,122 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 15:30:06,124 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 15:30:07,098 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 15:30:07,099 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 15:30:07,100 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:30:07 BoogieIcfgContainer [2019-12-27 15:30:07,101 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 15:30:07,102 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 15:30:07,102 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 15:30:07,106 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 15:30:07,107 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 03:30:05" (1/3) ... [2019-12-27 15:30:07,108 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@454384c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:30:07, skipping insertion in model container [2019-12-27 15:30:07,109 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:30:05" (2/3) ... [2019-12-27 15:30:07,109 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@454384c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:30:07, skipping insertion in model container [2019-12-27 15:30:07,110 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:30:07" (3/3) ... [2019-12-27 15:30:07,112 INFO L109 eAbstractionObserver]: Analyzing ICFG mix002_power.oepc.i [2019-12-27 15:30:07,123 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 15:30:07,123 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 15:30:07,134 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 15:30:07,135 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 15:30:07,196 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,197 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,197 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,197 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,197 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,198 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,198 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,198 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,199 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,199 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,200 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,200 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,200 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,200 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,201 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,201 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,201 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,201 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,202 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,202 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,202 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,202 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,203 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,203 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,203 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,203 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,204 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,204 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,204 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,204 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,205 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,205 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,205 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,224 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,225 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,225 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,226 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,226 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,226 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,226 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,226 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,227 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,227 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,227 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,227 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,228 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,228 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,228 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,228 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,228 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,229 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,229 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,229 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,229 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,229 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,232 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,233 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,233 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,233 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,233 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,233 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,233 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,234 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,234 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,234 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,234 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,234 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,235 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,235 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,235 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,235 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,236 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,236 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,236 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,236 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,236 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,237 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,237 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,237 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,237 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,237 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,238 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,238 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,238 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,238 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,238 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,239 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,239 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,239 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,239 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,240 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,240 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,240 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,240 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,240 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,241 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,241 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,241 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,241 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,241 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,242 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,242 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,242 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,242 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,242 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,243 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,243 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,243 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,243 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,243 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,244 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,244 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,244 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,244 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,244 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,245 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,245 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,245 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,245 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,245 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,246 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,246 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,246 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,246 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,246 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,247 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,247 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,247 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,247 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,248 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,248 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,248 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,248 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,248 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,248 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,249 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,249 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,249 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,249 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,249 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,250 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,250 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,250 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,250 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,250 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,251 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,251 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,251 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,251 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,251 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,251 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,252 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,252 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,252 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,252 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,252 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,253 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,253 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,253 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,253 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,253 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,254 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,254 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,254 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,254 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,254 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,255 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,255 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,255 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,255 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,256 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,256 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,256 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,259 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,260 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,264 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,264 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,264 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,264 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,265 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,265 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,265 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,265 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,265 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,265 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,266 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,266 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,266 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,266 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,266 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,267 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,267 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,267 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,267 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,267 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,268 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,268 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,268 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,268 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,268 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,269 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,269 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,269 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,269 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,269 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,270 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,270 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,270 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,276 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,277 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,277 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,277 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,279 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,279 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,279 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,279 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,279 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,280 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,280 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,280 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:30:07,298 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 15:30:07,319 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 15:30:07,320 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 15:30:07,320 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 15:30:07,320 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 15:30:07,320 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 15:30:07,320 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 15:30:07,320 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 15:30:07,321 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 15:30:07,345 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 180 places, 217 transitions [2019-12-27 15:30:07,347 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 217 transitions [2019-12-27 15:30:07,459 INFO L132 PetriNetUnfolder]: 47/214 cut-off events. [2019-12-27 15:30:07,460 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 15:30:07,478 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 434 event pairs. 0/165 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 15:30:07,503 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 217 transitions [2019-12-27 15:30:07,600 INFO L132 PetriNetUnfolder]: 47/214 cut-off events. [2019-12-27 15:30:07,601 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 15:30:07,614 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 434 event pairs. 0/165 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 15:30:07,638 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 15:30:07,639 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 15:30:13,167 WARN L192 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-27 15:30:13,319 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-12-27 15:30:13,481 INFO L206 etLargeBlockEncoding]: Checked pairs total: 93316 [2019-12-27 15:30:13,482 INFO L214 etLargeBlockEncoding]: Total number of compositions: 117 [2019-12-27 15:30:13,485 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 95 places, 104 transitions [2019-12-27 15:30:32,476 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 120347 states. [2019-12-27 15:30:32,478 INFO L276 IsEmpty]: Start isEmpty. Operand 120347 states. [2019-12-27 15:30:32,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 15:30:32,484 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:30:32,485 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 15:30:32,485 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 15:30:32,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:30:32,492 INFO L82 PathProgramCache]: Analyzing trace with hash 922900, now seen corresponding path program 1 times [2019-12-27 15:30:32,502 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:30:32,502 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140641943] [2019-12-27 15:30:32,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:30:32,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:30:32,710 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 15:30:32,710 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140641943] [2019-12-27 15:30:32,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:30:32,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 15:30:32,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [591476230] [2019-12-27 15:30:32,713 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:30:32,716 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:30:32,725 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 15:30:32,726 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:30:32,728 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:30:32,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:30:32,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:30:32,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:30:32,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:30:32,742 INFO L87 Difference]: Start difference. First operand 120347 states. Second operand 3 states. [2019-12-27 15:30:35,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:30:35,633 INFO L93 Difference]: Finished difference Result 119349 states and 508327 transitions. [2019-12-27 15:30:35,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:30:35,636 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 15:30:35,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:30:36,383 INFO L225 Difference]: With dead ends: 119349 [2019-12-27 15:30:36,383 INFO L226 Difference]: Without dead ends: 112420 [2019-12-27 15:30:36,388 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 15:30:43,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112420 states. [2019-12-27 15:30:46,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112420 to 112420. [2019-12-27 15:30:46,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112420 states. [2019-12-27 15:30:46,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112420 states to 112420 states and 478219 transitions. [2019-12-27 15:30:46,937 INFO L78 Accepts]: Start accepts. Automaton has 112420 states and 478219 transitions. Word has length 3 [2019-12-27 15:30:46,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:30:46,937 INFO L462 AbstractCegarLoop]: Abstraction has 112420 states and 478219 transitions. [2019-12-27 15:30:46,937 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:30:46,937 INFO L276 IsEmpty]: Start isEmpty. Operand 112420 states and 478219 transitions. [2019-12-27 15:30:46,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 15:30:46,942 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:30:46,942 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:30:46,942 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 15:30:46,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:30:46,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1739393843, now seen corresponding path program 1 times [2019-12-27 15:30:46,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:30:46,943 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457776671] [2019-12-27 15:30:46,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:30:46,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:30:47,079 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 15:30:47,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457776671] [2019-12-27 15:30:47,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:30:47,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:30:47,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1823451621] [2019-12-27 15:30:47,082 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:30:47,084 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:30:47,091 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 15:30:47,091 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:30:47,091 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:30:47,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 15:30:47,093 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:30:47,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 15:30:47,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:30:47,094 INFO L87 Difference]: Start difference. First operand 112420 states and 478219 transitions. Second operand 4 states. [2019-12-27 15:30:52,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:30:52,517 INFO L93 Difference]: Finished difference Result 179210 states and 732067 transitions. [2019-12-27 15:30:52,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 15:30:52,518 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 15:30:52,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:30:53,340 INFO L225 Difference]: With dead ends: 179210 [2019-12-27 15:30:53,341 INFO L226 Difference]: Without dead ends: 179161 [2019-12-27 15:30:53,342 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 15:31:00,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179161 states. [2019-12-27 15:31:08,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179161 to 162301. [2019-12-27 15:31:08,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162301 states. [2019-12-27 15:31:09,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162301 states to 162301 states and 672031 transitions. [2019-12-27 15:31:09,285 INFO L78 Accepts]: Start accepts. Automaton has 162301 states and 672031 transitions. Word has length 11 [2019-12-27 15:31:09,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:31:09,286 INFO L462 AbstractCegarLoop]: Abstraction has 162301 states and 672031 transitions. [2019-12-27 15:31:09,286 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 15:31:09,286 INFO L276 IsEmpty]: Start isEmpty. Operand 162301 states and 672031 transitions. [2019-12-27 15:31:09,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 15:31:09,291 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:31:09,292 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:31:09,292 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 15:31:09,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:31:09,292 INFO L82 PathProgramCache]: Analyzing trace with hash 53844596, now seen corresponding path program 1 times [2019-12-27 15:31:09,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:31:09,293 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542239060] [2019-12-27 15:31:09,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:31:09,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:31:09,359 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 15:31:09,360 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542239060] [2019-12-27 15:31:09,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:31:09,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:31:09,361 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [89628075] [2019-12-27 15:31:09,361 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:31:09,365 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:31:09,367 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 15:31:09,367 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:31:09,367 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:31:09,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:31:09,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:31:09,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:31:09,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:31:09,368 INFO L87 Difference]: Start difference. First operand 162301 states and 672031 transitions. Second operand 3 states. [2019-12-27 15:31:09,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:31:09,522 INFO L93 Difference]: Finished difference Result 34811 states and 113031 transitions. [2019-12-27 15:31:09,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:31:09,522 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 15:31:09,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:31:09,585 INFO L225 Difference]: With dead ends: 34811 [2019-12-27 15:31:09,585 INFO L226 Difference]: Without dead ends: 34811 [2019-12-27 15:31:09,586 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 15:31:11,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34811 states. [2019-12-27 15:31:11,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34811 to 34811. [2019-12-27 15:31:11,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34811 states. [2019-12-27 15:31:11,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34811 states to 34811 states and 113031 transitions. [2019-12-27 15:31:11,485 INFO L78 Accepts]: Start accepts. Automaton has 34811 states and 113031 transitions. Word has length 13 [2019-12-27 15:31:11,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:31:11,485 INFO L462 AbstractCegarLoop]: Abstraction has 34811 states and 113031 transitions. [2019-12-27 15:31:11,485 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:31:11,485 INFO L276 IsEmpty]: Start isEmpty. Operand 34811 states and 113031 transitions. [2019-12-27 15:31:11,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 15:31:11,488 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:31:11,488 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:31:11,488 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 15:31:11,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:31:11,489 INFO L82 PathProgramCache]: Analyzing trace with hash -2104175705, now seen corresponding path program 1 times [2019-12-27 15:31:11,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:31:11,489 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136742271] [2019-12-27 15:31:11,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:31:11,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:31:11,604 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 15:31:11,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136742271] [2019-12-27 15:31:11,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:31:11,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:31:11,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [292096354] [2019-12-27 15:31:11,606 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:31:11,611 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:31:11,614 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 15:31:11,614 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:31:11,614 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:31:11,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 15:31:11,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:31:11,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 15:31:11,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 15:31:11,616 INFO L87 Difference]: Start difference. First operand 34811 states and 113031 transitions. Second operand 5 states. [2019-12-27 15:31:12,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:31:12,169 INFO L93 Difference]: Finished difference Result 48236 states and 154913 transitions. [2019-12-27 15:31:12,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 15:31:12,170 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 15:31:12,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:31:12,249 INFO L225 Difference]: With dead ends: 48236 [2019-12-27 15:31:12,249 INFO L226 Difference]: Without dead ends: 48236 [2019-12-27 15:31:12,250 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 15:31:12,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48236 states. [2019-12-27 15:31:13,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48236 to 41215. [2019-12-27 15:31:13,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41215 states. [2019-12-27 15:31:13,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41215 states to 41215 states and 133442 transitions. [2019-12-27 15:31:13,864 INFO L78 Accepts]: Start accepts. Automaton has 41215 states and 133442 transitions. Word has length 16 [2019-12-27 15:31:13,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:31:13,865 INFO L462 AbstractCegarLoop]: Abstraction has 41215 states and 133442 transitions. [2019-12-27 15:31:13,865 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 15:31:13,865 INFO L276 IsEmpty]: Start isEmpty. Operand 41215 states and 133442 transitions. [2019-12-27 15:31:13,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 15:31:13,875 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:31:13,875 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 15:31:13,875 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 15:31:13,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:31:13,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1566659883, now seen corresponding path program 1 times [2019-12-27 15:31:13,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:31:13,877 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597008077] [2019-12-27 15:31:13,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:31:13,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:31:13,976 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 15:31:13,976 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597008077] [2019-12-27 15:31:13,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:31:13,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 15:31:13,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1317192616] [2019-12-27 15:31:13,978 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:31:13,981 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:31:13,989 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 37 states and 50 transitions. [2019-12-27 15:31:13,989 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:31:13,991 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:31:13,991 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 15:31:13,991 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:31:13,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 15:31:13,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 15:31:13,992 INFO L87 Difference]: Start difference. First operand 41215 states and 133442 transitions. Second operand 6 states. [2019-12-27 15:31:14,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:31:14,914 INFO L93 Difference]: Finished difference Result 62182 states and 196414 transitions. [2019-12-27 15:31:14,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 15:31:14,916 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 15:31:14,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:31:15,030 INFO L225 Difference]: With dead ends: 62182 [2019-12-27 15:31:15,030 INFO L226 Difference]: Without dead ends: 62175 [2019-12-27 15:31:15,030 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 15:31:15,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62175 states. [2019-12-27 15:31:18,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62175 to 40995. [2019-12-27 15:31:18,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40995 states. [2019-12-27 15:31:18,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40995 states to 40995 states and 132031 transitions. [2019-12-27 15:31:18,444 INFO L78 Accepts]: Start accepts. Automaton has 40995 states and 132031 transitions. Word has length 22 [2019-12-27 15:31:18,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:31:18,445 INFO L462 AbstractCegarLoop]: Abstraction has 40995 states and 132031 transitions. [2019-12-27 15:31:18,445 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 15:31:18,445 INFO L276 IsEmpty]: Start isEmpty. Operand 40995 states and 132031 transitions. [2019-12-27 15:31:18,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 15:31:18,459 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:31:18,459 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 15:31:18,459 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 15:31:18,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:31:18,460 INFO L82 PathProgramCache]: Analyzing trace with hash -1076429505, now seen corresponding path program 1 times [2019-12-27 15:31:18,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:31:18,460 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865565261] [2019-12-27 15:31:18,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:31:18,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:31:18,518 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 15:31:18,519 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865565261] [2019-12-27 15:31:18,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:31:18,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:31:18,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [983657818] [2019-12-27 15:31:18,519 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:31:18,528 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:31:18,539 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 15:31:18,540 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:31:18,541 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:31:18,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 15:31:18,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:31:18,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 15:31:18,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:31:18,542 INFO L87 Difference]: Start difference. First operand 40995 states and 132031 transitions. Second operand 4 states. [2019-12-27 15:31:18,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:31:18,608 INFO L93 Difference]: Finished difference Result 16196 states and 49196 transitions. [2019-12-27 15:31:18,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 15:31:18,608 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 15:31:18,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:31:18,630 INFO L225 Difference]: With dead ends: 16196 [2019-12-27 15:31:18,630 INFO L226 Difference]: Without dead ends: 16196 [2019-12-27 15:31:18,631 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 15:31:18,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16196 states. [2019-12-27 15:31:18,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16196 to 15833. [2019-12-27 15:31:18,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15833 states. [2019-12-27 15:31:18,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15833 states to 15833 states and 48160 transitions. [2019-12-27 15:31:18,879 INFO L78 Accepts]: Start accepts. Automaton has 15833 states and 48160 transitions. Word has length 25 [2019-12-27 15:31:18,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:31:18,879 INFO L462 AbstractCegarLoop]: Abstraction has 15833 states and 48160 transitions. [2019-12-27 15:31:18,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 15:31:18,879 INFO L276 IsEmpty]: Start isEmpty. Operand 15833 states and 48160 transitions. [2019-12-27 15:31:18,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 15:31:18,891 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:31:18,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] [2019-12-27 15:31:18,891 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 15:31:18,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:31:18,891 INFO L82 PathProgramCache]: Analyzing trace with hash -877586735, now seen corresponding path program 1 times [2019-12-27 15:31:18,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:31:18,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932855303] [2019-12-27 15:31:18,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:31:18,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:31:18,939 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 15:31:18,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932855303] [2019-12-27 15:31:18,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:31:18,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:31:18,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1143443395] [2019-12-27 15:31:18,940 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:31:18,945 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:31:18,953 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 15:31:18,953 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:31:18,953 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:31:18,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:31:18,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:31:18,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:31:18,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:31:18,954 INFO L87 Difference]: Start difference. First operand 15833 states and 48160 transitions. Second operand 3 states. [2019-12-27 15:31:19,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:31:19,084 INFO L93 Difference]: Finished difference Result 23073 states and 68792 transitions. [2019-12-27 15:31:19,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:31:19,084 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-27 15:31:19,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:31:19,125 INFO L225 Difference]: With dead ends: 23073 [2019-12-27 15:31:19,126 INFO L226 Difference]: Without dead ends: 23073 [2019-12-27 15:31:19,126 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 15:31:19,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23073 states. [2019-12-27 15:31:19,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23073 to 17600. [2019-12-27 15:31:19,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17600 states. [2019-12-27 15:31:19,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17600 states to 17600 states and 53010 transitions. [2019-12-27 15:31:19,447 INFO L78 Accepts]: Start accepts. Automaton has 17600 states and 53010 transitions. Word has length 27 [2019-12-27 15:31:19,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:31:19,447 INFO L462 AbstractCegarLoop]: Abstraction has 17600 states and 53010 transitions. [2019-12-27 15:31:19,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:31:19,447 INFO L276 IsEmpty]: Start isEmpty. Operand 17600 states and 53010 transitions. [2019-12-27 15:31:19,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 15:31:19,460 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:31:19,460 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 15:31:19,460 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 15:31:19,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:31:19,460 INFO L82 PathProgramCache]: Analyzing trace with hash -603523497, now seen corresponding path program 1 times [2019-12-27 15:31:19,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:31:19,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841273754] [2019-12-27 15:31:19,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:31:19,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:31:19,558 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 15:31:19,558 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841273754] [2019-12-27 15:31:19,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:31:19,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 15:31:19,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1305565577] [2019-12-27 15:31:19,560 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:31:19,565 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:31:19,571 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 15:31:19,571 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:31:19,571 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:31:19,571 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 15:31:19,572 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:31:19,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 15:31:19,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 15:31:19,572 INFO L87 Difference]: Start difference. First operand 17600 states and 53010 transitions. Second operand 6 states. [2019-12-27 15:31:20,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:31:20,135 INFO L93 Difference]: Finished difference Result 24767 states and 72789 transitions. [2019-12-27 15:31:20,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 15:31:20,135 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 15:31:20,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:31:20,171 INFO L225 Difference]: With dead ends: 24767 [2019-12-27 15:31:20,171 INFO L226 Difference]: Without dead ends: 24767 [2019-12-27 15:31:20,171 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 15:31:20,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24767 states. [2019-12-27 15:31:20,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24767 to 20286. [2019-12-27 15:31:20,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20286 states. [2019-12-27 15:31:20,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20286 states to 20286 states and 60759 transitions. [2019-12-27 15:31:20,849 INFO L78 Accepts]: Start accepts. Automaton has 20286 states and 60759 transitions. Word has length 27 [2019-12-27 15:31:20,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:31:20,849 INFO L462 AbstractCegarLoop]: Abstraction has 20286 states and 60759 transitions. [2019-12-27 15:31:20,849 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 15:31:20,850 INFO L276 IsEmpty]: Start isEmpty. Operand 20286 states and 60759 transitions. [2019-12-27 15:31:20,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 15:31:20,873 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:31:20,873 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 15:31:20,873 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 15:31:20,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:31:20,874 INFO L82 PathProgramCache]: Analyzing trace with hash 94968403, now seen corresponding path program 1 times [2019-12-27 15:31:20,874 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:31:20,875 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015582903] [2019-12-27 15:31:20,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:31:20,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:31:20,982 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 15:31:20,982 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015582903] [2019-12-27 15:31:20,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:31:20,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 15:31:20,983 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2006807021] [2019-12-27 15:31:20,983 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:31:20,990 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:31:21,005 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 48 states and 61 transitions. [2019-12-27 15:31:21,005 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:31:21,006 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:31:21,007 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 15:31:21,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:31:21,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 15:31:21,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 15:31:21,007 INFO L87 Difference]: Start difference. First operand 20286 states and 60759 transitions. Second operand 7 states. [2019-12-27 15:31:22,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:31:22,226 INFO L93 Difference]: Finished difference Result 27601 states and 80773 transitions. [2019-12-27 15:31:22,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 15:31:22,226 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-27 15:31:22,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:31:22,268 INFO L225 Difference]: With dead ends: 27601 [2019-12-27 15:31:22,268 INFO L226 Difference]: Without dead ends: 27601 [2019-12-27 15:31:22,269 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-27 15:31:22,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27601 states. [2019-12-27 15:31:22,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27601 to 18412. [2019-12-27 15:31:22,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18412 states. [2019-12-27 15:31:22,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18412 states to 18412 states and 55362 transitions. [2019-12-27 15:31:22,600 INFO L78 Accepts]: Start accepts. Automaton has 18412 states and 55362 transitions. Word has length 33 [2019-12-27 15:31:22,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:31:22,601 INFO L462 AbstractCegarLoop]: Abstraction has 18412 states and 55362 transitions. [2019-12-27 15:31:22,601 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 15:31:22,601 INFO L276 IsEmpty]: Start isEmpty. Operand 18412 states and 55362 transitions. [2019-12-27 15:31:22,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 15:31:22,624 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:31:22,625 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 15:31:22,625 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 15:31:22,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:31:22,625 INFO L82 PathProgramCache]: Analyzing trace with hash 994852703, now seen corresponding path program 1 times [2019-12-27 15:31:22,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:31:22,626 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961247673] [2019-12-27 15:31:22,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:31:22,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:31:22,678 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 15:31:22,679 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961247673] [2019-12-27 15:31:22,679 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:31:22,679 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 15:31:22,679 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1210765511] [2019-12-27 15:31:22,680 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:31:22,688 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:31:22,752 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 170 states and 351 transitions. [2019-12-27 15:31:22,752 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:31:22,754 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:31:22,754 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:31:22,754 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:31:22,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:31:22,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:31:22,755 INFO L87 Difference]: Start difference. First operand 18412 states and 55362 transitions. Second operand 3 states. [2019-12-27 15:31:22,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:31:22,845 INFO L93 Difference]: Finished difference Result 18411 states and 55360 transitions. [2019-12-27 15:31:22,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:31:22,846 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 15:31:22,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:31:22,883 INFO L225 Difference]: With dead ends: 18411 [2019-12-27 15:31:22,884 INFO L226 Difference]: Without dead ends: 18411 [2019-12-27 15:31:22,884 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 15:31:23,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18411 states. [2019-12-27 15:31:23,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18411 to 18411. [2019-12-27 15:31:23,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18411 states. [2019-12-27 15:31:23,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18411 states to 18411 states and 55360 transitions. [2019-12-27 15:31:23,307 INFO L78 Accepts]: Start accepts. Automaton has 18411 states and 55360 transitions. Word has length 39 [2019-12-27 15:31:23,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:31:23,308 INFO L462 AbstractCegarLoop]: Abstraction has 18411 states and 55360 transitions. [2019-12-27 15:31:23,308 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:31:23,308 INFO L276 IsEmpty]: Start isEmpty. Operand 18411 states and 55360 transitions. [2019-12-27 15:31:23,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 15:31:23,338 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:31:23,338 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 15:31:23,338 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 15:31:23,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:31:23,339 INFO L82 PathProgramCache]: Analyzing trace with hash 467911076, now seen corresponding path program 1 times [2019-12-27 15:31:23,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:31:23,340 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081692372] [2019-12-27 15:31:23,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:31:23,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:31:23,435 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 15:31:23,436 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081692372] [2019-12-27 15:31:23,436 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:31:23,436 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:31:23,436 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [358001049] [2019-12-27 15:31:23,437 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:31:23,445 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:31:23,738 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 210 states and 423 transitions. [2019-12-27 15:31:23,738 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:31:23,743 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 15:31:23,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:31:23,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:31:23,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:31:23,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:31:23,745 INFO L87 Difference]: Start difference. First operand 18411 states and 55360 transitions. Second operand 3 states. [2019-12-27 15:31:23,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:31:23,808 INFO L93 Difference]: Finished difference Result 18325 states and 55099 transitions. [2019-12-27 15:31:23,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:31:23,809 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-27 15:31:23,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:31:23,838 INFO L225 Difference]: With dead ends: 18325 [2019-12-27 15:31:23,839 INFO L226 Difference]: Without dead ends: 18325 [2019-12-27 15:31:23,839 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 15:31:23,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18325 states. [2019-12-27 15:31:24,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18325 to 16323. [2019-12-27 15:31:24,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16323 states. [2019-12-27 15:31:24,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16323 states to 16323 states and 49617 transitions. [2019-12-27 15:31:24,115 INFO L78 Accepts]: Start accepts. Automaton has 16323 states and 49617 transitions. Word has length 40 [2019-12-27 15:31:24,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:31:24,115 INFO L462 AbstractCegarLoop]: Abstraction has 16323 states and 49617 transitions. [2019-12-27 15:31:24,115 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:31:24,116 INFO L276 IsEmpty]: Start isEmpty. Operand 16323 states and 49617 transitions. [2019-12-27 15:31:24,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 15:31:24,134 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:31:24,134 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:31:24,135 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 15:31:24,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:31:24,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1873584483, now seen corresponding path program 1 times [2019-12-27 15:31:24,136 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:31:24,136 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705681613] [2019-12-27 15:31:24,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:31:24,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:31:24,202 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 15:31:24,203 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705681613] [2019-12-27 15:31:24,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:31:24,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 15:31:24,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [399807500] [2019-12-27 15:31:24,203 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:31:24,212 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:31:24,319 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 212 states and 417 transitions. [2019-12-27 15:31:24,319 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:31:24,362 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 15:31:24,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 15:31:24,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:31:24,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 15:31:24,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 15:31:24,363 INFO L87 Difference]: Start difference. First operand 16323 states and 49617 transitions. Second operand 6 states. [2019-12-27 15:31:24,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:31:24,453 INFO L93 Difference]: Finished difference Result 15143 states and 47024 transitions. [2019-12-27 15:31:24,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 15:31:24,454 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-27 15:31:24,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:31:24,479 INFO L225 Difference]: With dead ends: 15143 [2019-12-27 15:31:24,480 INFO L226 Difference]: Without dead ends: 15143 [2019-12-27 15:31:24,480 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 15:31:24,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15143 states. [2019-12-27 15:31:24,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15143 to 15143. [2019-12-27 15:31:24,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15143 states. [2019-12-27 15:31:24,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15143 states to 15143 states and 47024 transitions. [2019-12-27 15:31:24,727 INFO L78 Accepts]: Start accepts. Automaton has 15143 states and 47024 transitions. Word has length 41 [2019-12-27 15:31:24,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:31:24,728 INFO L462 AbstractCegarLoop]: Abstraction has 15143 states and 47024 transitions. [2019-12-27 15:31:24,728 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 15:31:24,728 INFO L276 IsEmpty]: Start isEmpty. Operand 15143 states and 47024 transitions. [2019-12-27 15:31:24,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 15:31:24,744 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:31:24,744 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 15:31:24,744 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 15:31:24,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:31:24,745 INFO L82 PathProgramCache]: Analyzing trace with hash 628999064, now seen corresponding path program 1 times [2019-12-27 15:31:24,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:31:24,745 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62996519] [2019-12-27 15:31:24,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:31:24,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:31:24,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 15:31:24,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62996519] [2019-12-27 15:31:24,800 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:31:24,800 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:31:24,800 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1158617759] [2019-12-27 15:31:24,800 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:31:24,823 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:31:25,166 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 313 states and 574 transitions. [2019-12-27 15:31:25,167 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:31:25,179 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 15:31:25,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:31:25,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:31:25,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:31:25,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:31:25,180 INFO L87 Difference]: Start difference. First operand 15143 states and 47024 transitions. Second operand 3 states. [2019-12-27 15:31:25,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:31:25,287 INFO L93 Difference]: Finished difference Result 19655 states and 59985 transitions. [2019-12-27 15:31:25,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:31:25,288 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 15:31:25,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:31:25,324 INFO L225 Difference]: With dead ends: 19655 [2019-12-27 15:31:25,324 INFO L226 Difference]: Without dead ends: 19655 [2019-12-27 15:31:25,324 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 2 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 15:31:25,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19655 states. [2019-12-27 15:31:25,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19655 to 14961. [2019-12-27 15:31:25,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14961 states. [2019-12-27 15:31:25,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14961 states to 14961 states and 45870 transitions. [2019-12-27 15:31:25,723 INFO L78 Accepts]: Start accepts. Automaton has 14961 states and 45870 transitions. Word has length 65 [2019-12-27 15:31:25,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:31:25,723 INFO L462 AbstractCegarLoop]: Abstraction has 14961 states and 45870 transitions. [2019-12-27 15:31:25,723 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:31:25,723 INFO L276 IsEmpty]: Start isEmpty. Operand 14961 states and 45870 transitions. [2019-12-27 15:31:25,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 15:31:25,744 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:31:25,744 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 15:31:25,745 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 15:31:25,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:31:25,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1958678932, now seen corresponding path program 1 times [2019-12-27 15:31:25,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:31:25,746 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588598064] [2019-12-27 15:31:25,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:31:25,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:31:25,832 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 15:31:25,833 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588598064] [2019-12-27 15:31:25,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:31:25,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 15:31:25,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1998904584] [2019-12-27 15:31:25,833 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:31:25,855 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:31:26,139 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 313 states and 574 transitions. [2019-12-27 15:31:26,140 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:31:26,193 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 15:31:26,194 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 15:31:26,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:31:26,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 15:31:26,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 15:31:26,195 INFO L87 Difference]: Start difference. First operand 14961 states and 45870 transitions. Second operand 9 states. [2019-12-27 15:31:29,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:31:29,012 INFO L93 Difference]: Finished difference Result 67643 states and 203328 transitions. [2019-12-27 15:31:29,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-27 15:31:29,013 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-27 15:31:29,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:31:29,085 INFO L225 Difference]: With dead ends: 67643 [2019-12-27 15:31:29,085 INFO L226 Difference]: Without dead ends: 53075 [2019-12-27 15:31:29,086 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=220, Invalid=836, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 15:31:29,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53075 states. [2019-12-27 15:31:29,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53075 to 18596. [2019-12-27 15:31:29,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18596 states. [2019-12-27 15:31:29,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18596 states to 18596 states and 57138 transitions. [2019-12-27 15:31:29,747 INFO L78 Accepts]: Start accepts. Automaton has 18596 states and 57138 transitions. Word has length 65 [2019-12-27 15:31:29,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:31:29,747 INFO L462 AbstractCegarLoop]: Abstraction has 18596 states and 57138 transitions. [2019-12-27 15:31:29,747 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 15:31:29,747 INFO L276 IsEmpty]: Start isEmpty. Operand 18596 states and 57138 transitions. [2019-12-27 15:31:29,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 15:31:29,774 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:31:29,774 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 15:31:29,774 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 15:31:29,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:31:29,774 INFO L82 PathProgramCache]: Analyzing trace with hash -29541862, now seen corresponding path program 2 times [2019-12-27 15:31:29,775 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:31:29,775 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694330242] [2019-12-27 15:31:29,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:31:29,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:31:29,856 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 15:31:29,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694330242] [2019-12-27 15:31:29,857 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:31:29,857 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 15:31:29,857 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [207450549] [2019-12-27 15:31:29,857 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:31:29,879 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:31:30,153 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 261 states and 497 transitions. [2019-12-27 15:31:30,154 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:31:30,170 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 15:31:30,171 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 15:31:30,171 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:31:30,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 15:31:30,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 15:31:30,172 INFO L87 Difference]: Start difference. First operand 18596 states and 57138 transitions. Second operand 8 states. [2019-12-27 15:31:32,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:31:32,665 INFO L93 Difference]: Finished difference Result 69175 states and 210360 transitions. [2019-12-27 15:31:32,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 15:31:32,666 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-27 15:31:32,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:31:32,734 INFO L225 Difference]: With dead ends: 69175 [2019-12-27 15:31:32,734 INFO L226 Difference]: Without dead ends: 48309 [2019-12-27 15:31:32,735 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=167, Invalid=703, Unknown=0, NotChecked=0, Total=870 [2019-12-27 15:31:32,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48309 states. [2019-12-27 15:31:33,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48309 to 23571. [2019-12-27 15:31:33,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23571 states. [2019-12-27 15:31:33,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23571 states to 23571 states and 72094 transitions. [2019-12-27 15:31:33,523 INFO L78 Accepts]: Start accepts. Automaton has 23571 states and 72094 transitions. Word has length 65 [2019-12-27 15:31:33,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:31:33,523 INFO L462 AbstractCegarLoop]: Abstraction has 23571 states and 72094 transitions. [2019-12-27 15:31:33,523 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 15:31:33,523 INFO L276 IsEmpty]: Start isEmpty. Operand 23571 states and 72094 transitions. [2019-12-27 15:31:33,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 15:31:33,550 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:31:33,550 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 15:31:33,550 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 15:31:33,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:31:33,551 INFO L82 PathProgramCache]: Analyzing trace with hash -1604322860, now seen corresponding path program 3 times [2019-12-27 15:31:33,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:31:33,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391487329] [2019-12-27 15:31:33,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:31:33,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:31:33,678 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 15:31:33,679 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391487329] [2019-12-27 15:31:33,681 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:31:33,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 15:31:33,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [634381979] [2019-12-27 15:31:33,681 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:31:33,715 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:31:33,856 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 178 states and 310 transitions. [2019-12-27 15:31:33,856 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:31:33,884 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 15:31:33,885 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 15:31:33,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:31:33,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 15:31:33,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-27 15:31:33,886 INFO L87 Difference]: Start difference. First operand 23571 states and 72094 transitions. Second operand 11 states. [2019-12-27 15:31:36,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:31:36,694 INFO L93 Difference]: Finished difference Result 93089 states and 282056 transitions. [2019-12-27 15:31:36,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-12-27 15:31:36,695 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-12-27 15:31:36,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:31:36,862 INFO L225 Difference]: With dead ends: 93089 [2019-12-27 15:31:36,862 INFO L226 Difference]: Without dead ends: 90467 [2019-12-27 15:31:36,863 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 709 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=489, Invalid=1767, Unknown=0, NotChecked=0, Total=2256 [2019-12-27 15:31:37,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90467 states. [2019-12-27 15:31:37,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90467 to 23764. [2019-12-27 15:31:37,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23764 states. [2019-12-27 15:31:37,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23764 states to 23764 states and 72954 transitions. [2019-12-27 15:31:37,932 INFO L78 Accepts]: Start accepts. Automaton has 23764 states and 72954 transitions. Word has length 65 [2019-12-27 15:31:37,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:31:37,932 INFO L462 AbstractCegarLoop]: Abstraction has 23764 states and 72954 transitions. [2019-12-27 15:31:37,933 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 15:31:37,933 INFO L276 IsEmpty]: Start isEmpty. Operand 23764 states and 72954 transitions. [2019-12-27 15:31:37,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 15:31:37,956 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:31:37,956 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 15:31:37,956 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 15:31:37,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:31:37,957 INFO L82 PathProgramCache]: Analyzing trace with hash -841108452, now seen corresponding path program 4 times [2019-12-27 15:31:37,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:31:37,957 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856854132] [2019-12-27 15:31:37,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:31:37,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:31:38,024 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 15:31:38,024 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856854132] [2019-12-27 15:31:38,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:31:38,025 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:31:38,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1290880958] [2019-12-27 15:31:38,025 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:31:38,045 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:31:38,320 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 340 states and 648 transitions. [2019-12-27 15:31:38,321 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:31:38,325 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 15:31:38,326 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:31:38,326 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:31:38,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:31:38,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:31:38,327 INFO L87 Difference]: Start difference. First operand 23764 states and 72954 transitions. Second operand 3 states. [2019-12-27 15:31:38,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:31:38,438 INFO L93 Difference]: Finished difference Result 26831 states and 82437 transitions. [2019-12-27 15:31:38,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:31:38,439 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 15:31:38,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:31:38,475 INFO L225 Difference]: With dead ends: 26831 [2019-12-27 15:31:38,475 INFO L226 Difference]: Without dead ends: 26831 [2019-12-27 15:31:38,475 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 4 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 15:31:38,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26831 states. [2019-12-27 15:31:38,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26831 to 22448. [2019-12-27 15:31:38,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22448 states. [2019-12-27 15:31:38,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22448 states to 22448 states and 69699 transitions. [2019-12-27 15:31:38,833 INFO L78 Accepts]: Start accepts. Automaton has 22448 states and 69699 transitions. Word has length 65 [2019-12-27 15:31:38,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:31:38,833 INFO L462 AbstractCegarLoop]: Abstraction has 22448 states and 69699 transitions. [2019-12-27 15:31:38,833 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:31:38,833 INFO L276 IsEmpty]: Start isEmpty. Operand 22448 states and 69699 transitions. [2019-12-27 15:31:38,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 15:31:38,857 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:31:38,857 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 15:31:38,857 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 15:31:38,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:31:38,857 INFO L82 PathProgramCache]: Analyzing trace with hash -23971085, now seen corresponding path program 1 times [2019-12-27 15:31:38,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:31:38,858 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318804789] [2019-12-27 15:31:38,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:31:38,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:31:38,947 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 15:31:38,947 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318804789] [2019-12-27 15:31:38,948 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:31:38,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 15:31:38,948 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1729413036] [2019-12-27 15:31:38,948 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:31:38,969 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:31:39,266 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 168 states and 293 transitions. [2019-12-27 15:31:39,266 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:31:39,267 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 15:31:39,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 15:31:39,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:31:39,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 15:31:39,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 15:31:39,268 INFO L87 Difference]: Start difference. First operand 22448 states and 69699 transitions. Second operand 8 states. [2019-12-27 15:31:40,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:31:40,182 INFO L93 Difference]: Finished difference Result 55952 states and 170672 transitions. [2019-12-27 15:31:40,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 15:31:40,182 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 66 [2019-12-27 15:31:40,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:31:40,254 INFO L225 Difference]: With dead ends: 55952 [2019-12-27 15:31:40,255 INFO L226 Difference]: Without dead ends: 52796 [2019-12-27 15:31:40,255 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2019-12-27 15:31:40,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52796 states. [2019-12-27 15:31:40,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52796 to 22532. [2019-12-27 15:31:40,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22532 states. [2019-12-27 15:31:40,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22532 states to 22532 states and 70039 transitions. [2019-12-27 15:31:40,786 INFO L78 Accepts]: Start accepts. Automaton has 22532 states and 70039 transitions. Word has length 66 [2019-12-27 15:31:40,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:31:40,787 INFO L462 AbstractCegarLoop]: Abstraction has 22532 states and 70039 transitions. [2019-12-27 15:31:40,787 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 15:31:40,787 INFO L276 IsEmpty]: Start isEmpty. Operand 22532 states and 70039 transitions. [2019-12-27 15:31:40,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 15:31:40,808 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:31:40,809 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 15:31:40,809 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 15:31:40,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:31:40,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1713623309, now seen corresponding path program 2 times [2019-12-27 15:31:40,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:31:40,810 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522312803] [2019-12-27 15:31:40,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:31:40,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:31:40,919 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 15:31:40,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522312803] [2019-12-27 15:31:40,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:31:40,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 15:31:40,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [526797190] [2019-12-27 15:31:40,920 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:31:40,940 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:31:41,089 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 175 states and 307 transitions. [2019-12-27 15:31:41,089 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:31:41,259 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 15:31:41,260 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 15:31:41,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:31:41,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 15:31:41,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-27 15:31:41,261 INFO L87 Difference]: Start difference. First operand 22532 states and 70039 transitions. Second operand 12 states. [2019-12-27 15:31:42,871 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-12-27 15:31:46,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:31:46,974 INFO L93 Difference]: Finished difference Result 98642 states and 299379 transitions. [2019-12-27 15:31:46,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-12-27 15:31:46,975 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2019-12-27 15:31:46,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:31:47,099 INFO L225 Difference]: With dead ends: 98642 [2019-12-27 15:31:47,099 INFO L226 Difference]: Without dead ends: 83103 [2019-12-27 15:31:47,101 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1690 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=840, Invalid=3990, Unknown=0, NotChecked=0, Total=4830 [2019-12-27 15:31:47,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83103 states. [2019-12-27 15:31:47,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83103 to 24328. [2019-12-27 15:31:47,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24328 states. [2019-12-27 15:31:47,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24328 states to 24328 states and 75952 transitions. [2019-12-27 15:31:47,904 INFO L78 Accepts]: Start accepts. Automaton has 24328 states and 75952 transitions. Word has length 66 [2019-12-27 15:31:47,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:31:47,905 INFO L462 AbstractCegarLoop]: Abstraction has 24328 states and 75952 transitions. [2019-12-27 15:31:47,905 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 15:31:47,905 INFO L276 IsEmpty]: Start isEmpty. Operand 24328 states and 75952 transitions. [2019-12-27 15:31:47,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 15:31:47,929 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:31:47,929 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 15:31:47,929 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 15:31:47,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:31:47,929 INFO L82 PathProgramCache]: Analyzing trace with hash -1583227917, now seen corresponding path program 3 times [2019-12-27 15:31:47,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:31:47,930 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329838009] [2019-12-27 15:31:47,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:31:47,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:31:48,037 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 15:31:48,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329838009] [2019-12-27 15:31:48,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:31:48,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 15:31:48,038 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1498420788] [2019-12-27 15:31:48,038 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:31:48,059 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:31:48,449 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 168 states and 293 transitions. [2019-12-27 15:31:48,449 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:31:48,450 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 15:31:48,451 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 15:31:48,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:31:48,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 15:31:48,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 15:31:48,451 INFO L87 Difference]: Start difference. First operand 24328 states and 75952 transitions. Second operand 9 states. [2019-12-27 15:31:49,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:31:49,796 INFO L93 Difference]: Finished difference Result 72337 states and 218873 transitions. [2019-12-27 15:31:49,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 15:31:49,797 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-27 15:31:49,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:31:49,904 INFO L225 Difference]: With dead ends: 72337 [2019-12-27 15:31:49,904 INFO L226 Difference]: Without dead ends: 68973 [2019-12-27 15:31:49,904 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=159, Invalid=491, Unknown=0, NotChecked=0, Total=650 [2019-12-27 15:31:50,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68973 states. [2019-12-27 15:31:50,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68973 to 24188. [2019-12-27 15:31:50,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24188 states. [2019-12-27 15:31:50,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24188 states to 24188 states and 75284 transitions. [2019-12-27 15:31:50,619 INFO L78 Accepts]: Start accepts. Automaton has 24188 states and 75284 transitions. Word has length 66 [2019-12-27 15:31:50,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:31:50,619 INFO L462 AbstractCegarLoop]: Abstraction has 24188 states and 75284 transitions. [2019-12-27 15:31:50,619 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 15:31:50,619 INFO L276 IsEmpty]: Start isEmpty. Operand 24188 states and 75284 transitions. [2019-12-27 15:31:50,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 15:31:50,644 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:31:50,644 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 15:31:50,644 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 15:31:50,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:31:50,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1805047887, now seen corresponding path program 4 times [2019-12-27 15:31:50,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:31:50,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497058403] [2019-12-27 15:31:50,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:31:50,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:31:50,768 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 15:31:50,769 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497058403] [2019-12-27 15:31:50,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:31:50,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 15:31:50,769 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [623873073] [2019-12-27 15:31:50,769 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:31:50,791 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:31:51,132 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 298 states and 548 transitions. [2019-12-27 15:31:51,132 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:31:51,328 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 15:31:51,329 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 15:31:51,329 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:31:51,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 15:31:51,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-12-27 15:31:51,330 INFO L87 Difference]: Start difference. First operand 24188 states and 75284 transitions. Second operand 13 states. [2019-12-27 15:31:51,781 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 26 [2019-12-27 15:31:55,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:31:55,309 INFO L93 Difference]: Finished difference Result 60752 states and 183596 transitions. [2019-12-27 15:31:55,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 15:31:55,309 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 66 [2019-12-27 15:31:55,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:31:55,420 INFO L225 Difference]: With dead ends: 60752 [2019-12-27 15:31:55,421 INFO L226 Difference]: Without dead ends: 60752 [2019-12-27 15:31:55,421 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=300, Invalid=512, Unknown=0, NotChecked=0, Total=812 [2019-12-27 15:31:55,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60752 states. [2019-12-27 15:31:56,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60752 to 22603. [2019-12-27 15:31:56,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22603 states. [2019-12-27 15:31:56,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22603 states to 22603 states and 69143 transitions. [2019-12-27 15:31:56,079 INFO L78 Accepts]: Start accepts. Automaton has 22603 states and 69143 transitions. Word has length 66 [2019-12-27 15:31:56,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:31:56,079 INFO L462 AbstractCegarLoop]: Abstraction has 22603 states and 69143 transitions. [2019-12-27 15:31:56,079 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 15:31:56,079 INFO L276 IsEmpty]: Start isEmpty. Operand 22603 states and 69143 transitions. [2019-12-27 15:31:56,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 15:31:56,106 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:31:56,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:31:56,106 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 15:31:56,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:31:56,106 INFO L82 PathProgramCache]: Analyzing trace with hash -707932787, now seen corresponding path program 1 times [2019-12-27 15:31:56,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:31:56,107 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362136950] [2019-12-27 15:31:56,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:31:56,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:31:56,176 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 15:31:56,178 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362136950] [2019-12-27 15:31:56,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:31:56,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:31:56,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [229332811] [2019-12-27 15:31:56,178 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:31:56,196 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:31:56,652 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 298 states and 548 transitions. [2019-12-27 15:31:56,652 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:31:56,665 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 15:31:56,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 15:31:56,666 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:31:56,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 15:31:56,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:31:56,667 INFO L87 Difference]: Start difference. First operand 22603 states and 69143 transitions. Second operand 4 states. [2019-12-27 15:31:56,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:31:56,896 INFO L93 Difference]: Finished difference Result 22418 states and 68407 transitions. [2019-12-27 15:31:56,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 15:31:56,897 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-27 15:31:56,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:31:57,195 INFO L225 Difference]: With dead ends: 22418 [2019-12-27 15:31:57,195 INFO L226 Difference]: Without dead ends: 22418 [2019-12-27 15:31:57,195 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 5 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 15:31:57,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22418 states. [2019-12-27 15:31:57,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22418 to 20629. [2019-12-27 15:31:57,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20629 states. [2019-12-27 15:31:57,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20629 states to 20629 states and 63059 transitions. [2019-12-27 15:31:57,734 INFO L78 Accepts]: Start accepts. Automaton has 20629 states and 63059 transitions. Word has length 66 [2019-12-27 15:31:57,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:31:57,734 INFO L462 AbstractCegarLoop]: Abstraction has 20629 states and 63059 transitions. [2019-12-27 15:31:57,734 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 15:31:57,734 INFO L276 IsEmpty]: Start isEmpty. Operand 20629 states and 63059 transitions. [2019-12-27 15:31:57,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 15:31:57,766 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:31:57,766 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 15:31:57,766 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 15:31:57,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:31:57,766 INFO L82 PathProgramCache]: Analyzing trace with hash -1506873112, now seen corresponding path program 1 times [2019-12-27 15:31:57,767 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:31:57,767 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099748920] [2019-12-27 15:31:57,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:31:57,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:31:57,827 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 15:31:57,828 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099748920] [2019-12-27 15:31:57,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:31:57,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:31:57,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [691220516] [2019-12-27 15:31:57,829 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:31:57,846 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:31:58,139 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 308 states and 520 transitions. [2019-12-27 15:31:58,139 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:31:58,147 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 15:31:58,148 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 15:31:58,148 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:31:58,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 15:31:58,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:31:58,149 INFO L87 Difference]: Start difference. First operand 20629 states and 63059 transitions. Second operand 4 states. [2019-12-27 15:31:58,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:31:58,398 INFO L93 Difference]: Finished difference Result 26404 states and 78531 transitions. [2019-12-27 15:31:58,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 15:31:58,398 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-27 15:31:58,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:31:58,435 INFO L225 Difference]: With dead ends: 26404 [2019-12-27 15:31:58,435 INFO L226 Difference]: Without dead ends: 26404 [2019-12-27 15:31:58,435 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 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 15:31:58,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26404 states. [2019-12-27 15:31:58,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26404 to 18386. [2019-12-27 15:31:58,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18386 states. [2019-12-27 15:31:58,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18386 states to 18386 states and 55380 transitions. [2019-12-27 15:31:58,767 INFO L78 Accepts]: Start accepts. Automaton has 18386 states and 55380 transitions. Word has length 66 [2019-12-27 15:31:58,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:31:58,767 INFO L462 AbstractCegarLoop]: Abstraction has 18386 states and 55380 transitions. [2019-12-27 15:31:58,767 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 15:31:58,767 INFO L276 IsEmpty]: Start isEmpty. Operand 18386 states and 55380 transitions. [2019-12-27 15:31:58,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 15:31:58,786 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:31:58,786 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 15:31:58,786 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 15:31:58,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:31:58,787 INFO L82 PathProgramCache]: Analyzing trace with hash 1717710349, now seen corresponding path program 1 times [2019-12-27 15:31:58,787 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:31:58,787 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075271045] [2019-12-27 15:31:58,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:31:58,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:31:58,891 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 15:31:58,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075271045] [2019-12-27 15:31:58,892 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:31:58,892 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 15:31:58,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1105808536] [2019-12-27 15:31:58,892 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:31:58,909 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:31:59,086 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 195 states and 334 transitions. [2019-12-27 15:31:59,087 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:31:59,116 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 15:31:59,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 15:31:59,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:31:59,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 15:31:59,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-27 15:31:59,117 INFO L87 Difference]: Start difference. First operand 18386 states and 55380 transitions. Second operand 9 states. [2019-12-27 15:32:00,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:32:00,714 INFO L93 Difference]: Finished difference Result 34128 states and 101314 transitions. [2019-12-27 15:32:00,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 15:32:00,715 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2019-12-27 15:32:00,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:32:00,755 INFO L225 Difference]: With dead ends: 34128 [2019-12-27 15:32:00,755 INFO L226 Difference]: Without dead ends: 28839 [2019-12-27 15:32:00,756 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=399, Unknown=0, NotChecked=0, Total=506 [2019-12-27 15:32:00,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28839 states. [2019-12-27 15:32:01,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28839 to 19018. [2019-12-27 15:32:01,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19018 states. [2019-12-27 15:32:01,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19018 states to 19018 states and 56984 transitions. [2019-12-27 15:32:01,123 INFO L78 Accepts]: Start accepts. Automaton has 19018 states and 56984 transitions. Word has length 67 [2019-12-27 15:32:01,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:32:01,123 INFO L462 AbstractCegarLoop]: Abstraction has 19018 states and 56984 transitions. [2019-12-27 15:32:01,123 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 15:32:01,123 INFO L276 IsEmpty]: Start isEmpty. Operand 19018 states and 56984 transitions. [2019-12-27 15:32:01,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 15:32:01,143 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:32:01,143 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 15:32:01,143 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 15:32:01,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:32:01,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1715738515, now seen corresponding path program 2 times [2019-12-27 15:32:01,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:32:01,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420773144] [2019-12-27 15:32:01,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:32:01,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:32:01,822 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 15:32:01,823 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420773144] [2019-12-27 15:32:01,823 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:32:01,823 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-12-27 15:32:01,823 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1913363533] [2019-12-27 15:32:01,823 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:32:01,840 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:32:02,121 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 190 states and 324 transitions. [2019-12-27 15:32:02,121 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:32:02,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 15:32:03,010 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 28 times. [2019-12-27 15:32:03,010 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-12-27 15:32:03,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:32:03,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-12-27 15:32:03,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=677, Unknown=0, NotChecked=0, Total=756 [2019-12-27 15:32:03,011 INFO L87 Difference]: Start difference. First operand 19018 states and 56984 transitions. Second operand 28 states. [2019-12-27 15:32:16,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:32:16,909 INFO L93 Difference]: Finished difference Result 38178 states and 113170 transitions. [2019-12-27 15:32:16,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2019-12-27 15:32:16,910 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 67 [2019-12-27 15:32:16,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:32:16,954 INFO L225 Difference]: With dead ends: 38178 [2019-12-27 15:32:16,955 INFO L226 Difference]: Without dead ends: 33899 [2019-12-27 15:32:16,959 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 15 SyntacticMatches, 11 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5833 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=2051, Invalid=14979, Unknown=0, NotChecked=0, Total=17030 [2019-12-27 15:32:17,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33899 states. [2019-12-27 15:32:17,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33899 to 19825. [2019-12-27 15:32:17,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19825 states. [2019-12-27 15:32:17,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19825 states to 19825 states and 59335 transitions. [2019-12-27 15:32:17,348 INFO L78 Accepts]: Start accepts. Automaton has 19825 states and 59335 transitions. Word has length 67 [2019-12-27 15:32:17,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:32:17,348 INFO L462 AbstractCegarLoop]: Abstraction has 19825 states and 59335 transitions. [2019-12-27 15:32:17,348 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-12-27 15:32:17,348 INFO L276 IsEmpty]: Start isEmpty. Operand 19825 states and 59335 transitions. [2019-12-27 15:32:17,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 15:32:17,369 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:32:17,369 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 15:32:17,369 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 15:32:17,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:32:17,370 INFO L82 PathProgramCache]: Analyzing trace with hash -2010664093, now seen corresponding path program 3 times [2019-12-27 15:32:17,370 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:32:17,370 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215673436] [2019-12-27 15:32:17,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:32:17,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:32:17,920 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 15:32:17,921 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215673436] [2019-12-27 15:32:17,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:32:17,921 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-27 15:32:17,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [899503977] [2019-12-27 15:32:17,921 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:32:17,930 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:32:18,218 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 226 states and 424 transitions. [2019-12-27 15:32:18,218 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:32:18,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 15:32:18,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 15:32:19,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 15:32:19,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 15:32:19,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 15:32:19,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 15:32:19,109 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 42 times. [2019-12-27 15:32:19,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-12-27 15:32:19,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:32:19,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-12-27 15:32:19,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=789, Unknown=0, NotChecked=0, Total=870 [2019-12-27 15:32:19,111 INFO L87 Difference]: Start difference. First operand 19825 states and 59335 transitions. Second operand 30 states. [2019-12-27 15:32:44,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:32:44,318 INFO L93 Difference]: Finished difference Result 62064 states and 182420 transitions. [2019-12-27 15:32:44,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 185 states. [2019-12-27 15:32:44,319 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 67 [2019-12-27 15:32:44,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:32:44,399 INFO L225 Difference]: With dead ends: 62064 [2019-12-27 15:32:44,399 INFO L226 Difference]: Without dead ends: 57205 [2019-12-27 15:32:44,408 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 20 SyntacticMatches, 17 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15297 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=3322, Invalid=35684, Unknown=0, NotChecked=0, Total=39006 [2019-12-27 15:32:44,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57205 states. [2019-12-27 15:32:44,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57205 to 20261. [2019-12-27 15:32:44,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20261 states. [2019-12-27 15:32:45,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20261 states to 20261 states and 60532 transitions. [2019-12-27 15:32:45,009 INFO L78 Accepts]: Start accepts. Automaton has 20261 states and 60532 transitions. Word has length 67 [2019-12-27 15:32:45,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:32:45,009 INFO L462 AbstractCegarLoop]: Abstraction has 20261 states and 60532 transitions. [2019-12-27 15:32:45,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-12-27 15:32:45,009 INFO L276 IsEmpty]: Start isEmpty. Operand 20261 states and 60532 transitions. [2019-12-27 15:32:45,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 15:32:45,033 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:32:45,034 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 15:32:45,034 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 15:32:45,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:32:45,034 INFO L82 PathProgramCache]: Analyzing trace with hash 326233707, now seen corresponding path program 4 times [2019-12-27 15:32:45,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:32:45,035 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289486507] [2019-12-27 15:32:45,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:32:45,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:32:45,223 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 15:32:45,224 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289486507] [2019-12-27 15:32:45,224 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:32:45,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 15:32:45,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1983215760] [2019-12-27 15:32:45,225 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:32:45,238 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:32:45,480 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 257 states and 474 transitions. [2019-12-27 15:32:45,481 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:32:45,595 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 15:32:45,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 15:32:45,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:32:45,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 15:32:45,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-12-27 15:32:45,596 INFO L87 Difference]: Start difference. First operand 20261 states and 60532 transitions. Second operand 13 states. [2019-12-27 15:32:48,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:32:48,373 INFO L93 Difference]: Finished difference Result 45304 states and 134551 transitions. [2019-12-27 15:32:48,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-12-27 15:32:48,374 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 67 [2019-12-27 15:32:48,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:32:48,421 INFO L225 Difference]: With dead ends: 45304 [2019-12-27 15:32:48,421 INFO L226 Difference]: Without dead ends: 37310 [2019-12-27 15:32:48,422 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 8 SyntacticMatches, 8 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 514 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=341, Invalid=1639, Unknown=0, NotChecked=0, Total=1980 [2019-12-27 15:32:48,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37310 states. [2019-12-27 15:32:48,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37310 to 18730. [2019-12-27 15:32:48,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18730 states. [2019-12-27 15:32:48,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18730 states to 18730 states and 56027 transitions. [2019-12-27 15:32:48,830 INFO L78 Accepts]: Start accepts. Automaton has 18730 states and 56027 transitions. Word has length 67 [2019-12-27 15:32:48,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:32:48,833 INFO L462 AbstractCegarLoop]: Abstraction has 18730 states and 56027 transitions. [2019-12-27 15:32:48,833 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 15:32:48,833 INFO L276 IsEmpty]: Start isEmpty. Operand 18730 states and 56027 transitions. [2019-12-27 15:32:48,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 15:32:48,860 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:32:48,861 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 15:32:48,861 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 15:32:48,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:32:48,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1475658587, now seen corresponding path program 5 times [2019-12-27 15:32:48,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:32:48,862 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573388309] [2019-12-27 15:32:48,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:32:48,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:32:49,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:32:49,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573388309] [2019-12-27 15:32:49,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:32:49,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 15:32:49,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1312574213] [2019-12-27 15:32:49,007 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:32:49,020 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:32:49,273 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 242 states and 464 transitions. [2019-12-27 15:32:49,273 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:32:49,385 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 15:32:49,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 15:32:49,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:32:49,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 15:32:49,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-27 15:32:49,386 INFO L87 Difference]: Start difference. First operand 18730 states and 56027 transitions. Second operand 12 states. [2019-12-27 15:32:50,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:32:50,284 INFO L93 Difference]: Finished difference Result 31296 states and 92964 transitions. [2019-12-27 15:32:50,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 15:32:50,284 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-27 15:32:50,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:32:50,326 INFO L225 Difference]: With dead ends: 31296 [2019-12-27 15:32:50,326 INFO L226 Difference]: Without dead ends: 31073 [2019-12-27 15:32:50,327 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 7 SyntacticMatches, 5 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=136, Invalid=566, Unknown=0, NotChecked=0, Total=702 [2019-12-27 15:32:50,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31073 states. [2019-12-27 15:32:50,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31073 to 18554. [2019-12-27 15:32:50,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18554 states. [2019-12-27 15:32:50,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18554 states to 18554 states and 55547 transitions. [2019-12-27 15:32:50,677 INFO L78 Accepts]: Start accepts. Automaton has 18554 states and 55547 transitions. Word has length 67 [2019-12-27 15:32:50,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:32:50,678 INFO L462 AbstractCegarLoop]: Abstraction has 18554 states and 55547 transitions. [2019-12-27 15:32:50,678 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 15:32:50,678 INFO L276 IsEmpty]: Start isEmpty. Operand 18554 states and 55547 transitions. [2019-12-27 15:32:50,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 15:32:50,698 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:32:50,698 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 15:32:50,698 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 15:32:50,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:32:50,698 INFO L82 PathProgramCache]: Analyzing trace with hash -200373485, now seen corresponding path program 6 times [2019-12-27 15:32:50,699 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:32:50,699 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558021371] [2019-12-27 15:32:50,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:32:50,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 15:32:50,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 15:32:50,858 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 15:32:50,858 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 15:32:50,864 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [904] [904] ULTIMATE.startENTRY-->L842: Formula: (let ((.cse0 (store |v_#valid_64| 0 0))) (and (= v_~__unbuffered_cnt~0_134 0) (= v_~a$r_buff1_thd0~0_110 0) (= v_~x~0_44 0) (= 0 v_~a$read_delayed_var~0.base_7) (= |v_#valid_62| (store .cse0 |v_ULTIMATE.start_main_~#t38~0.base_23| 1)) (= 0 v_~a$r_buff0_thd1~0_147) (= 0 v_~a$read_delayed~0_7) (= v_~a$read_delayed_var~0.offset_7 0) (= 0 v_~__unbuffered_p0_EAX~0_60) (= 0 v_~a$w_buff0_used~0_862) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t38~0.base_23| 4)) (= v_~__unbuffered_p0_EBX~0_60 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t38~0.base_23|) (= 0 v_~a$r_buff1_thd1~0_105) (= v_~main$tmp_guard1~0_27 0) (= v_~a$flush_delayed~0_24 0) (= 0 v_~__unbuffered_p1_EAX~0_34) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t38~0.base_23| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t38~0.base_23|) |v_ULTIMATE.start_main_~#t38~0.offset_18| 0)) |v_#memory_int_21|) (= v_~a~0_173 0) (= v_~a$r_buff1_thd3~0_219 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~a$r_buff0_thd3~0_314 0) (= 0 v_~__unbuffered_p2_EAX~0_29) (= v_~__unbuffered_p2_EBX~0_35 0) (= 0 v_~a$r_buff1_thd2~0_106) (= 0 |v_#NULL.base_4|) (= v_~__unbuffered_p1_EBX~0_34 0) (= v_~a$w_buff0~0_390 0) (= 0 v_~a$r_buff0_thd2~0_104) (= (select .cse0 |v_ULTIMATE.start_main_~#t38~0.base_23|) 0) (= 0 |v_ULTIMATE.start_main_~#t38~0.offset_18|) (= v_~y~0_53 0) (= v_~a$mem_tmp~0_13 0) (= |v_#NULL.offset_4| 0) (= v_~main$tmp_guard0~0_22 0) (= v_~z~0_20 0) (= 0 v_~a$w_buff1~0_260) (= v_~weak$$choice2~0_108 0) (= v_~a$r_buff0_thd0~0_142 0) (= 0 v_~a$w_buff1_used~0_471) (= 0 v_~weak$$choice0~0_12))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_106, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_83|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_241|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_142, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_45|, ~a~0=v_~a~0_173, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_53|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_60, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_34, ULTIMATE.start_main_~#t40~0.base=|v_ULTIMATE.start_main_~#t40~0.base_20|, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_29, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_35, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_60, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_219, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_862, ULTIMATE.start_main_~#t40~0.offset=|v_ULTIMATE.start_main_~#t40~0.offset_15|, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_147, ULTIMATE.start_main_~#t38~0.offset=|v_ULTIMATE.start_main_~#t38~0.offset_18|, ~weak$$choice0~0=v_~weak$$choice0~0_12, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_7, ~a$w_buff0~0=v_~a$w_buff0~0_390, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_110, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_134, ~x~0=v_~x~0_44, ULTIMATE.start_main_~#t39~0.offset=|v_ULTIMATE.start_main_~#t39~0.offset_18|, ~a$read_delayed~0=v_~a$read_delayed~0_7, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_104, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_27, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_61|, ~a$mem_tmp~0=v_~a$mem_tmp~0_13, ULTIMATE.start_main_~#t39~0.base=|v_ULTIMATE.start_main_~#t39~0.base_23|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_37|, ~a$w_buff1~0=v_~a$w_buff1~0_260, ~y~0=v_~y~0_53, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_34, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_21|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_105, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_314, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, #NULL.base=|v_#NULL.base_4|, ~a$flush_delayed~0=v_~a$flush_delayed~0_24, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~#t38~0.base=|v_ULTIMATE.start_main_~#t38~0.base_23|, ~z~0=v_~z~0_20, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_471, ~weak$$choice2~0=v_~weak$$choice2~0_108, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_7} AuxVars[] AssignedVars[~a$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite50, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t40~0.base, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_#t~nondet45, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ULTIMATE.start_main_~#t40~0.offset, ~a$r_buff0_thd1~0, ULTIMATE.start_main_~#t38~0.offset, ~weak$$choice0~0, ~a$read_delayed_var~0.offset, ~a$w_buff0~0, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t39~0.offset, ~a$read_delayed~0, ~a$r_buff0_thd2~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~a$mem_tmp~0, ULTIMATE.start_main_~#t39~0.base, ULTIMATE.start_main_#t~ite51, ~a$w_buff1~0, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~a$r_buff1_thd1~0, ~a$r_buff0_thd3~0, ~main$tmp_guard0~0, #NULL.base, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t38~0.base, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~a$read_delayed_var~0.base] because there is no mapped edge [2019-12-27 15:32:50,865 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] P0ENTRY-->L4-3: Formula: (and (= ~a$w_buff0_used~0_Out-1460893707 1) (= ~a$w_buff1_used~0_Out-1460893707 ~a$w_buff0_used~0_In-1460893707) (= P0Thread1of1ForFork2_~arg.offset_Out-1460893707 |P0Thread1of1ForFork2_#in~arg.offset_In-1460893707|) (= ~a$w_buff1~0_Out-1460893707 ~a$w_buff0~0_In-1460893707) (= |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression_Out-1460893707| 1) (= P0Thread1of1ForFork2___VERIFIER_assert_~expression_Out-1460893707 |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression_Out-1460893707|) (= P0Thread1of1ForFork2_~arg.base_Out-1460893707 |P0Thread1of1ForFork2_#in~arg.base_In-1460893707|) (= (mod ~a$w_buff1_used~0_Out-1460893707 256) 0) (= 1 ~a$w_buff0~0_Out-1460893707)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|P0Thread1of1ForFork2_#in~arg.offset_In-1460893707|, ~a$w_buff0~0=~a$w_buff0~0_In-1460893707, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1460893707, P0Thread1of1ForFork2_#in~arg.base=|P0Thread1of1ForFork2_#in~arg.base_In-1460893707|} OutVars{~a$w_buff1~0=~a$w_buff1~0_Out-1460893707, P0Thread1of1ForFork2_#in~arg.offset=|P0Thread1of1ForFork2_#in~arg.offset_In-1460893707|, ~a$w_buff0~0=~a$w_buff0~0_Out-1460893707, P0Thread1of1ForFork2_~arg.offset=P0Thread1of1ForFork2_~arg.offset_Out-1460893707, ~a$w_buff0_used~0=~a$w_buff0_used~0_Out-1460893707, P0Thread1of1ForFork2___VERIFIER_assert_~expression=P0Thread1of1ForFork2___VERIFIER_assert_~expression_Out-1460893707, P0Thread1of1ForFork2_#in~arg.base=|P0Thread1of1ForFork2_#in~arg.base_In-1460893707|, ~a$w_buff1_used~0=~a$w_buff1_used~0_Out-1460893707, P0Thread1of1ForFork2_~arg.base=P0Thread1of1ForFork2_~arg.base_Out-1460893707, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression=|P0Thread1of1ForFork2___VERIFIER_assert_#in~expression_Out-1460893707|} AuxVars[] AssignedVars[~a$w_buff1~0, ~a$w_buff0~0, P0Thread1of1ForFork2_~arg.offset, ~a$w_buff0_used~0, P0Thread1of1ForFork2___VERIFIER_assert_~expression, ~a$w_buff1_used~0, P0Thread1of1ForFork2_~arg.base, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 15:32:50,868 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L842-1-->L844: Formula: (and (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t39~0.base_13| 1)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t39~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t39~0.base_13|) |v_ULTIMATE.start_main_~#t39~0.offset_11| 1)) |v_#memory_int_13|) (not (= |v_ULTIMATE.start_main_~#t39~0.base_13| 0)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t39~0.base_13|) (= (select |v_#valid_37| |v_ULTIMATE.start_main_~#t39~0.base_13|) 0) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t39~0.base_13| 4) |v_#length_15|) (= 0 |v_ULTIMATE.start_main_~#t39~0.offset_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t39~0.offset=|v_ULTIMATE.start_main_~#t39~0.offset_11|, ULTIMATE.start_main_~#t39~0.base=|v_ULTIMATE.start_main_~#t39~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t39~0.offset, ULTIMATE.start_main_~#t39~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 15:32:50,873 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L783-2-->L783-5: Formula: (let ((.cse0 (= |P1Thread1of1ForFork0_#t~ite10_Out1015163788| |P1Thread1of1ForFork0_#t~ite9_Out1015163788|)) (.cse1 (= 0 (mod ~a$r_buff1_thd2~0_In1015163788 256))) (.cse2 (= (mod ~a$w_buff1_used~0_In1015163788 256) 0))) (or (and .cse0 (= ~a~0_In1015163788 |P1Thread1of1ForFork0_#t~ite9_Out1015163788|) (or .cse1 .cse2)) (and .cse0 (not .cse1) (not .cse2) (= |P1Thread1of1ForFork0_#t~ite9_Out1015163788| ~a$w_buff1~0_In1015163788)))) InVars {~a~0=~a~0_In1015163788, ~a$w_buff1~0=~a$w_buff1~0_In1015163788, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1015163788, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1015163788} OutVars{~a~0=~a~0_In1015163788, ~a$w_buff1~0=~a$w_buff1~0_In1015163788, P1Thread1of1ForFork0_#t~ite10=|P1Thread1of1ForFork0_#t~ite10_Out1015163788|, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1015163788, P1Thread1of1ForFork0_#t~ite9=|P1Thread1of1ForFork0_#t~ite9_Out1015163788|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1015163788} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite10, P1Thread1of1ForFork0_#t~ite9] because there is no mapped edge [2019-12-27 15:32:50,875 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L784-->L784-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In272174321 256) 0)) (.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In272174321 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork0_#t~ite11_Out272174321|) (not .cse1)) (and (or .cse1 .cse0) (= ~a$w_buff0_used~0_In272174321 |P1Thread1of1ForFork0_#t~ite11_Out272174321|)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In272174321, ~a$w_buff0_used~0=~a$w_buff0_used~0_In272174321} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In272174321, P1Thread1of1ForFork0_#t~ite11=|P1Thread1of1ForFork0_#t~ite11_Out272174321|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In272174321} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite11] because there is no mapped edge [2019-12-27 15:32:50,877 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L785-->L785-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In-202755192 256) 0)) (.cse1 (= (mod ~a$r_buff0_thd2~0_In-202755192 256) 0)) (.cse2 (= 0 (mod ~a$r_buff1_thd2~0_In-202755192 256))) (.cse3 (= (mod ~a$w_buff1_used~0_In-202755192 256) 0))) (or (and (or .cse0 .cse1) (= ~a$w_buff1_used~0_In-202755192 |P1Thread1of1ForFork0_#t~ite12_Out-202755192|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite12_Out-202755192|)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-202755192, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-202755192, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-202755192, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-202755192} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-202755192, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-202755192, P1Thread1of1ForFork0_#t~ite12=|P1Thread1of1ForFork0_#t~ite12_Out-202755192|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-202755192, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-202755192} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-27 15:32:50,878 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [853] [853] L786-->L786-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd2~0_In1047326596 256) 0)) (.cse0 (= (mod ~a$w_buff0_used~0_In1047326596 256) 0))) (or (and (= ~a$r_buff0_thd2~0_In1047326596 |P1Thread1of1ForFork0_#t~ite13_Out1047326596|) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork0_#t~ite13_Out1047326596| 0) (not .cse1) (not .cse0)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1047326596, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1047326596} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1047326596, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1047326596, P1Thread1of1ForFork0_#t~ite13=|P1Thread1of1ForFork0_#t~ite13_Out1047326596|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite13] because there is no mapped edge [2019-12-27 15:32:50,879 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [854] [854] L787-->L787-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff1_used~0_In346392755 256))) (.cse1 (= 0 (mod ~a$r_buff1_thd2~0_In346392755 256))) (.cse2 (= (mod ~a$r_buff0_thd2~0_In346392755 256) 0)) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In346392755 256)))) (or (and (= ~a$r_buff1_thd2~0_In346392755 |P1Thread1of1ForFork0_#t~ite14_Out346392755|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork0_#t~ite14_Out346392755|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In346392755, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In346392755, ~a$w_buff0_used~0=~a$w_buff0_used~0_In346392755, ~a$w_buff1_used~0=~a$w_buff1_used~0_In346392755} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In346392755, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In346392755, ~a$w_buff0_used~0=~a$w_buff0_used~0_In346392755, P1Thread1of1ForFork0_#t~ite14=|P1Thread1of1ForFork0_#t~ite14_Out346392755|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In346392755} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-27 15:32:50,880 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [856] [856] L787-2-->P1EXIT: Formula: (and (= v_~a$r_buff1_thd2~0_53 |v_P1Thread1of1ForFork0_#t~ite14_28|) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_45 1) v_~__unbuffered_cnt~0_44)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45, P1Thread1of1ForFork0_#t~ite14=|v_P1Thread1of1ForFork0_#t~ite14_28|} OutVars{~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_53, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44, P1Thread1of1ForFork0_#t~ite14=|v_P1Thread1of1ForFork0_#t~ite14_27|, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#t~ite14, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-27 15:32:50,880 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L844-1-->L846: Formula: (and (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t40~0.base_12| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t40~0.base_12|) |v_ULTIMATE.start_main_~#t40~0.offset_10| 2))) (not (= |v_ULTIMATE.start_main_~#t40~0.base_12| 0)) (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t40~0.base_12| 1)) (= |v_ULTIMATE.start_main_~#t40~0.offset_10| 0) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t40~0.base_12|) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t40~0.base_12| 4) |v_#length_13|) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t40~0.base_12|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_34|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_6|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t40~0.base=|v_ULTIMATE.start_main_~#t40~0.base_12|, ULTIMATE.start_main_~#t40~0.offset=|v_ULTIMATE.start_main_~#t40~0.offset_10|, #length=|v_#length_13|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t40~0.base, ULTIMATE.start_main_~#t40~0.offset, #length] because there is no mapped edge [2019-12-27 15:32:50,885 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [884] [884] L808-->L808-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1820935429 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite20_In-1820935429| |P2Thread1of1ForFork1_#t~ite20_Out-1820935429|) (= ~a$w_buff0~0_In-1820935429 |P2Thread1of1ForFork1_#t~ite21_Out-1820935429|)) (and (= ~a$w_buff0~0_In-1820935429 |P2Thread1of1ForFork1_#t~ite20_Out-1820935429|) .cse0 (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In-1820935429 256) 0))) (or (and .cse1 (= 0 (mod ~a$w_buff1_used~0_In-1820935429 256))) (and (= (mod ~a$r_buff1_thd3~0_In-1820935429 256) 0) .cse1) (= 0 (mod ~a$w_buff0_used~0_In-1820935429 256)))) (= |P2Thread1of1ForFork1_#t~ite21_Out-1820935429| |P2Thread1of1ForFork1_#t~ite20_Out-1820935429|)))) InVars {P2Thread1of1ForFork1_#t~ite20=|P2Thread1of1ForFork1_#t~ite20_In-1820935429|, ~a$w_buff0~0=~a$w_buff0~0_In-1820935429, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1820935429, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1820935429, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1820935429, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1820935429, ~weak$$choice2~0=~weak$$choice2~0_In-1820935429} OutVars{P2Thread1of1ForFork1_#t~ite20=|P2Thread1of1ForFork1_#t~ite20_Out-1820935429|, P2Thread1of1ForFork1_#t~ite21=|P2Thread1of1ForFork1_#t~ite21_Out-1820935429|, ~a$w_buff0~0=~a$w_buff0~0_In-1820935429, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1820935429, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1820935429, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1820935429, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1820935429, ~weak$$choice2~0=~weak$$choice2~0_In-1820935429} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite20, P2Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-27 15:32:50,888 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [885] [885] L810-->L810-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1861241557 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite27_Out-1861241557| |P2Thread1of1ForFork1_#t~ite26_Out-1861241557|) .cse0 (= ~a$w_buff0_used~0_In-1861241557 |P2Thread1of1ForFork1_#t~ite26_Out-1861241557|) (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In-1861241557 256)))) (or (= 0 (mod ~a$w_buff0_used~0_In-1861241557 256)) (and .cse1 (= (mod ~a$w_buff1_used~0_In-1861241557 256) 0)) (and .cse1 (= 0 (mod ~a$r_buff1_thd3~0_In-1861241557 256)))))) (and (= ~a$w_buff0_used~0_In-1861241557 |P2Thread1of1ForFork1_#t~ite27_Out-1861241557|) (not .cse0) (= |P2Thread1of1ForFork1_#t~ite26_In-1861241557| |P2Thread1of1ForFork1_#t~ite26_Out-1861241557|)))) InVars {P2Thread1of1ForFork1_#t~ite26=|P2Thread1of1ForFork1_#t~ite26_In-1861241557|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1861241557, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1861241557, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1861241557, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1861241557, ~weak$$choice2~0=~weak$$choice2~0_In-1861241557} OutVars{P2Thread1of1ForFork1_#t~ite26=|P2Thread1of1ForFork1_#t~ite26_Out-1861241557|, P2Thread1of1ForFork1_#t~ite27=|P2Thread1of1ForFork1_#t~ite27_Out-1861241557|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1861241557, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1861241557, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1861241557, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1861241557, ~weak$$choice2~0=~weak$$choice2~0_In-1861241557} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite26, P2Thread1of1ForFork1_#t~ite27] because there is no mapped edge [2019-12-27 15:32:50,892 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L812-->L813: Formula: (and (= v_~a$r_buff0_thd3~0_59 v_~a$r_buff0_thd3~0_60) (not (= 0 (mod v_~weak$$choice2~0_15 256)))) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_15} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_9|, P2Thread1of1ForFork1_#t~ite31=|v_P2Thread1of1ForFork1_#t~ite31_8|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_9|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_59, ~weak$$choice2~0=v_~weak$$choice2~0_15} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite31, P2Thread1of1ForFork1_#t~ite33, ~a$r_buff0_thd3~0] because there is no mapped edge [2019-12-27 15:32:50,895 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L815-->L819: Formula: (and (not (= 0 (mod v_~a$flush_delayed~0_8 256))) (= v_~a$flush_delayed~0_7 0) (= v_~a~0_42 v_~a$mem_tmp~0_5)) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_8} OutVars{~a~0=v_~a~0_42, ~a$mem_tmp~0=v_~a$mem_tmp~0_5, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_7|, ~a$flush_delayed~0=v_~a$flush_delayed~0_7} AuxVars[] AssignedVars[~a~0, P2Thread1of1ForFork1_#t~ite37, ~a$flush_delayed~0] because there is no mapped edge [2019-12-27 15:32:50,896 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L819-2-->L819-4: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff1_thd3~0_In215130025 256))) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In215130025 256)))) (or (and (not .cse0) (= ~a$w_buff1~0_In215130025 |P2Thread1of1ForFork1_#t~ite38_Out215130025|) (not .cse1)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite38_Out215130025| ~a~0_In215130025)))) InVars {~a~0=~a~0_In215130025, ~a$w_buff1~0=~a$w_buff1~0_In215130025, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In215130025, ~a$w_buff1_used~0=~a$w_buff1_used~0_In215130025} OutVars{~a~0=~a~0_In215130025, P2Thread1of1ForFork1_#t~ite38=|P2Thread1of1ForFork1_#t~ite38_Out215130025|, ~a$w_buff1~0=~a$w_buff1~0_In215130025, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In215130025, ~a$w_buff1_used~0=~a$w_buff1_used~0_In215130025} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite38] because there is no mapped edge [2019-12-27 15:32:50,896 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L819-4-->L820: Formula: (= v_~a~0_31 |v_P2Thread1of1ForFork1_#t~ite38_14|) InVars {P2Thread1of1ForFork1_#t~ite38=|v_P2Thread1of1ForFork1_#t~ite38_14|} OutVars{~a~0=v_~a~0_31, P2Thread1of1ForFork1_#t~ite38=|v_P2Thread1of1ForFork1_#t~ite38_13|, P2Thread1of1ForFork1_#t~ite39=|v_P2Thread1of1ForFork1_#t~ite39_13|} AuxVars[] AssignedVars[~a~0, P2Thread1of1ForFork1_#t~ite38, P2Thread1of1ForFork1_#t~ite39] because there is no mapped edge [2019-12-27 15:32:50,897 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L820-->L820-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In-2139685312 256) 0)) (.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In-2139685312 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite40_Out-2139685312| 0) (not .cse1)) (and (or .cse1 .cse0) (= ~a$w_buff0_used~0_In-2139685312 |P2Thread1of1ForFork1_#t~ite40_Out-2139685312|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-2139685312, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-2139685312} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-2139685312, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-2139685312, P2Thread1of1ForFork1_#t~ite40=|P2Thread1of1ForFork1_#t~ite40_Out-2139685312|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite40] because there is no mapped edge [2019-12-27 15:32:50,898 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L821-->L821-2: Formula: (let ((.cse2 (= (mod ~a$w_buff0_used~0_In-334631047 256) 0)) (.cse3 (= 0 (mod ~a$r_buff0_thd3~0_In-334631047 256))) (.cse1 (= (mod ~a$r_buff1_thd3~0_In-334631047 256) 0)) (.cse0 (= (mod ~a$w_buff1_used~0_In-334631047 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork1_#t~ite41_Out-334631047| ~a$w_buff1_used~0_In-334631047)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |P2Thread1of1ForFork1_#t~ite41_Out-334631047| 0)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-334631047, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-334631047, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-334631047, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-334631047} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-334631047, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-334631047, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-334631047, P2Thread1of1ForFork1_#t~ite41=|P2Thread1of1ForFork1_#t~ite41_Out-334631047|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-334631047} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite41] because there is no mapped edge [2019-12-27 15:32:50,900 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L822-->L822-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1382726100 256))) (.cse0 (= (mod ~a$r_buff0_thd3~0_In-1382726100 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite42_Out-1382726100| ~a$r_buff0_thd3~0_In-1382726100)) (and (not .cse1) (= |P2Thread1of1ForFork1_#t~ite42_Out-1382726100| 0) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1382726100, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1382726100} OutVars{P2Thread1of1ForFork1_#t~ite42=|P2Thread1of1ForFork1_#t~ite42_Out-1382726100|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1382726100, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1382726100} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite42] because there is no mapped edge [2019-12-27 15:32:50,901 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L823-->L823-2: Formula: (let ((.cse3 (= (mod ~a$w_buff1_used~0_In2143124214 256) 0)) (.cse2 (= 0 (mod ~a$r_buff1_thd3~0_In2143124214 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In2143124214 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd3~0_In2143124214 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork1_#t~ite43_Out2143124214|)) (and (= ~a$r_buff1_thd3~0_In2143124214 |P2Thread1of1ForFork1_#t~ite43_Out2143124214|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In2143124214, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2143124214, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In2143124214, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2143124214} OutVars{P2Thread1of1ForFork1_#t~ite43=|P2Thread1of1ForFork1_#t~ite43_Out2143124214|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In2143124214, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2143124214, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In2143124214, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2143124214} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite43] because there is no mapped edge [2019-12-27 15:32:50,901 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_~__unbuffered_cnt~0_54 (+ v_~__unbuffered_cnt~0_55 1)) (= v_~a$r_buff1_thd3~0_109 |v_P2Thread1of1ForFork1_#t~ite43_34|)) InVars {P2Thread1of1ForFork1_#t~ite43=|v_P2Thread1of1ForFork1_#t~ite43_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55} OutVars{P2Thread1of1ForFork1_#t~ite43=|v_P2Thread1of1ForFork1_#t~ite43_33|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_109, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite43, P2Thread1of1ForFork1_#res.base, ~a$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-27 15:32:50,902 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L761-->L761-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd1~0_In1035401326 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In1035401326 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite5_Out1035401326| ~a$w_buff0_used~0_In1035401326) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P0Thread1of1ForFork2_#t~ite5_Out1035401326| 0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1035401326, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1035401326} OutVars{P0Thread1of1ForFork2_#t~ite5=|P0Thread1of1ForFork2_#t~ite5_Out1035401326|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1035401326, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1035401326} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-27 15:32:50,903 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L762-->L762-2: Formula: (let ((.cse2 (= (mod ~a$r_buff0_thd1~0_In2131112532 256) 0)) (.cse3 (= (mod ~a$w_buff0_used~0_In2131112532 256) 0)) (.cse1 (= (mod ~a$w_buff1_used~0_In2131112532 256) 0)) (.cse0 (= 0 (mod ~a$r_buff1_thd1~0_In2131112532 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite6_Out2131112532| ~a$w_buff1_used~0_In2131112532) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |P0Thread1of1ForFork2_#t~ite6_Out2131112532| 0)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In2131112532, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2131112532, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In2131112532, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2131112532} OutVars{~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In2131112532, P0Thread1of1ForFork2_#t~ite6=|P0Thread1of1ForFork2_#t~ite6_Out2131112532|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2131112532, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In2131112532, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2131112532} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-27 15:32:50,904 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L763-->L764: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd1~0_In-514955518 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-514955518 256)))) (or (and (= ~a$r_buff0_thd1~0_Out-514955518 0) (not .cse0) (not .cse1)) (and (= ~a$r_buff0_thd1~0_Out-514955518 ~a$r_buff0_thd1~0_In-514955518) (or .cse1 .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-514955518, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-514955518} OutVars{P0Thread1of1ForFork2_#t~ite7=|P0Thread1of1ForFork2_#t~ite7_Out-514955518|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-514955518, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-514955518} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 15:32:50,904 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L764-->L764-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff1_used~0_In532435719 256))) (.cse0 (= 0 (mod ~a$r_buff1_thd1~0_In532435719 256))) (.cse2 (= (mod ~a$w_buff0_used~0_In532435719 256) 0)) (.cse3 (= 0 (mod ~a$r_buff0_thd1~0_In532435719 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork2_#t~ite8_Out532435719| ~a$r_buff1_thd1~0_In532435719)) (and (= |P0Thread1of1ForFork2_#t~ite8_Out532435719| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In532435719, ~a$w_buff0_used~0=~a$w_buff0_used~0_In532435719, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In532435719, ~a$w_buff1_used~0=~a$w_buff1_used~0_In532435719} OutVars{P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out532435719|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In532435719, ~a$w_buff0_used~0=~a$w_buff0_used~0_In532435719, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In532435719, ~a$w_buff1_used~0=~a$w_buff1_used~0_In532435719} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 15:32:50,904 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L764-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#res.offset_5| 0) (= 0 |v_P0Thread1of1ForFork2_#res.base_5|) (= |v_P0Thread1of1ForFork2_#t~ite8_44| v_~a$r_buff1_thd1~0_72) (= v_~__unbuffered_cnt~0_77 (+ v_~__unbuffered_cnt~0_78 1))) InVars {P0Thread1of1ForFork2_#t~ite8=|v_P0Thread1of1ForFork2_#t~ite8_44|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78} OutVars{P0Thread1of1ForFork2_#t~ite8=|v_P0Thread1of1ForFork2_#t~ite8_43|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_72, P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8, ~a$r_buff1_thd1~0, P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 15:32:50,905 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] 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 15:32:50,905 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L852-2-->L852-4: Formula: (let ((.cse0 (= (mod ~a$w_buff1_used~0_In1484633834 256) 0)) (.cse1 (= 0 (mod ~a$r_buff1_thd0~0_In1484633834 256)))) (or (and (= |ULTIMATE.start_main_#t~ite47_Out1484633834| ~a$w_buff1~0_In1484633834) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite47_Out1484633834| ~a~0_In1484633834) (or .cse0 .cse1)))) InVars {~a~0=~a~0_In1484633834, ~a$w_buff1~0=~a$w_buff1~0_In1484633834, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1484633834, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1484633834} OutVars{~a~0=~a~0_In1484633834, ~a$w_buff1~0=~a$w_buff1~0_In1484633834, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out1484633834|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1484633834, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1484633834} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-27 15:32:50,906 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [802] [802] L852-4-->L853: Formula: (= v_~a~0_58 |v_ULTIMATE.start_main_#t~ite47_13|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_13|} OutVars{~a~0=v_~a~0_58, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_12|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_12|} AuxVars[] AssignedVars[~a~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 15:32:50,906 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L853-->L853-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In2112937129 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd0~0_In2112937129 256)))) (or (and (= ~a$w_buff0_used~0_In2112937129 |ULTIMATE.start_main_#t~ite49_Out2112937129|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite49_Out2112937129|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In2112937129, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In2112937129} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In2112937129, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out2112937129|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In2112937129} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 15:32:50,907 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L854-->L854-2: Formula: (let ((.cse1 (= (mod ~a$w_buff1_used~0_In-849867830 256) 0)) (.cse0 (= (mod ~a$r_buff1_thd0~0_In-849867830 256) 0)) (.cse3 (= (mod ~a$w_buff0_used~0_In-849867830 256) 0)) (.cse2 (= 0 (mod ~a$r_buff0_thd0~0_In-849867830 256)))) (or (and (= |ULTIMATE.start_main_#t~ite50_Out-849867830| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~a$w_buff1_used~0_In-849867830 |ULTIMATE.start_main_#t~ite50_Out-849867830|) (or .cse3 .cse2)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-849867830, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-849867830, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-849867830, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-849867830} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-849867830|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-849867830, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-849867830, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-849867830, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-849867830} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 15:32:50,909 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L855-->L855-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In859145994 256))) (.cse1 (= (mod ~a$r_buff0_thd0~0_In859145994 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite51_Out859145994| ~a$r_buff0_thd0~0_In859145994)) (and (= |ULTIMATE.start_main_#t~ite51_Out859145994| 0) (not .cse0) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In859145994, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In859145994} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out859145994|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In859145994, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In859145994} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 15:32:50,910 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] L856-->L856-2: Formula: (let ((.cse3 (= (mod ~a$r_buff1_thd0~0_In-1745997577 256) 0)) (.cse2 (= (mod ~a$w_buff1_used~0_In-1745997577 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In-1745997577 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd0~0_In-1745997577 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite52_Out-1745997577| ~a$r_buff1_thd0~0_In-1745997577)) (and (= |ULTIMATE.start_main_#t~ite52_Out-1745997577| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1745997577, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1745997577, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1745997577, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1745997577} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-1745997577|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1745997577, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1745997577, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1745997577, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1745997577} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 15:32:50,911 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [894] [894] L856-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p0_EBX~0_54 0) (= v_~__unbuffered_p1_EBX~0_27 0) (= v_~main$tmp_guard1~0_21 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_21 256)) (= 1 v_~__unbuffered_p1_EAX~0_27) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_~a$r_buff1_thd0~0_104 |v_ULTIMATE.start_main_#t~ite52_44|) (= v_~__unbuffered_p2_EBX~0_30 0) (= 1 v_~__unbuffered_p0_EAX~0_54) (= 1 v_~__unbuffered_p2_EAX~0_24)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_54, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_44|, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_54, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_27, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_30, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_27, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_24} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_54, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_43|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_54, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_27, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_30, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_27, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_104, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_24, 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, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 15:32:51,050 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 03:32:51 BasicIcfg [2019-12-27 15:32:51,050 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 15:32:51,052 INFO L168 Benchmark]: Toolchain (without parser) took 165931.62 ms. Allocated memory was 138.4 MB in the beginning and 3.2 GB in the end (delta: 3.1 GB). Free memory was 99.7 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2019-12-27 15:32:51,053 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 138.4 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-27 15:32:51,054 INFO L168 Benchmark]: CACSL2BoogieTranslator took 804.48 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 99.3 MB in the beginning and 156.3 MB in the end (delta: -57.0 MB). Peak memory consumption was 25.1 MB. Max. memory is 7.1 GB. [2019-12-27 15:32:51,054 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.34 ms. Allocated memory is still 202.9 MB. Free memory was 156.3 MB in the beginning and 153.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 15:32:51,055 INFO L168 Benchmark]: Boogie Preprocessor took 39.05 ms. Allocated memory is still 202.9 MB. Free memory was 153.7 MB in the beginning and 151.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 15:32:51,055 INFO L168 Benchmark]: RCFGBuilder took 1061.75 ms. Allocated memory is still 202.9 MB. Free memory was 151.0 MB in the beginning and 100.6 MB in the end (delta: 50.4 MB). Peak memory consumption was 50.4 MB. Max. memory is 7.1 GB. [2019-12-27 15:32:51,056 INFO L168 Benchmark]: TraceAbstraction took 163948.42 ms. Allocated memory was 202.9 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 100.0 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2019-12-27 15:32:51,061 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.18 ms. Allocated memory is still 138.4 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 804.48 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 99.3 MB in the beginning and 156.3 MB in the end (delta: -57.0 MB). Peak memory consumption was 25.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 72.34 ms. Allocated memory is still 202.9 MB. Free memory was 156.3 MB in the beginning and 153.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.05 ms. Allocated memory is still 202.9 MB. Free memory was 153.7 MB in the beginning and 151.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1061.75 ms. Allocated memory is still 202.9 MB. Free memory was 151.0 MB in the beginning and 100.6 MB in the end (delta: 50.4 MB). Peak memory consumption was 50.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 163948.42 ms. Allocated memory was 202.9 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 100.0 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.1s, 180 ProgramPointsBefore, 95 ProgramPointsAfterwards, 217 TransitionsBefore, 104 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 8 FixpointIterations, 37 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 32 ChoiceCompositions, 7415 VarBasedMoverChecksPositive, 242 VarBasedMoverChecksNegative, 41 SemBasedMoverChecksPositive, 273 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 0 MoverChecksTotal, 93316 CheckedPairsTotal, 117 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(&t38, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L744] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L745] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L746] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L747] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L748] 1 a$r_buff0_thd1 = (_Bool)1 [L751] 1 x = 1 [L754] 1 __unbuffered_p0_EAX = x [L757] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L760] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L844] FCALL, FORK 0 pthread_create(&t39, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L774] 2 y = 1 [L777] 2 __unbuffered_p1_EAX = y [L780] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L783] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L760] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L783] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L784] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L785] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L786] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L846] FCALL, FORK 0 pthread_create(&t40, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L797] 3 z = 1 [L800] 3 __unbuffered_p2_EAX = z [L803] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L804] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L805] 3 a$flush_delayed = weak$$choice2 [L806] 3 a$mem_tmp = a VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L807] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L807] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L808] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L809] EXPR 3 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1))=0, x=1, y=1, z=1] [L809] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L810] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L811] EXPR 3 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L811] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L813] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L813] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L814] 3 __unbuffered_p2_EBX = a VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L819] 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L820] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L821] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L822] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L761] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L762] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L852] 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L853] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L854] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L855] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 171 locations, 2 error locations. Result: UNSAFE, OverallTime: 163.5s, OverallIterations: 29, TraceHistogramMax: 1, AutomataDifference: 80.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8402 SDtfs, 15017 SDslu, 38666 SDs, 0 SdLazy, 41429 SolverSat, 1072 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 37.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 937 GetRequests, 158 SyntacticMatches, 60 SemanticMatches, 719 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25153 ImplicationChecksByTransitivity, 23.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=162301occurred 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: 44.8s AutomataMinimizationTime, 28 MinimizatonAttempts, 475284 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 1420 NumberOfCodeBlocks, 1420 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 1325 ConstructedInterpolants, 0 QuantifiedInterpolants, 357118 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 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...