/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe029_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 00:12:54,876 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 00:12:54,879 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 00:12:54,891 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 00:12:54,891 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 00:12:54,892 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 00:12:54,894 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 00:12:54,896 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 00:12:54,897 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 00:12:54,898 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 00:12:54,899 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 00:12:54,900 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 00:12:54,901 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 00:12:54,902 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 00:12:54,903 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 00:12:54,904 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 00:12:54,905 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 00:12:54,906 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 00:12:54,907 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 00:12:54,909 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 00:12:54,910 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 00:12:54,911 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 00:12:54,912 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 00:12:54,913 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 00:12:54,915 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 00:12:54,916 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 00:12:54,916 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 00:12:54,917 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 00:12:54,917 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 00:12:54,918 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 00:12:54,918 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 00:12:54,919 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 00:12:54,920 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 00:12:54,920 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 00:12:54,921 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 00:12:54,922 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 00:12:54,922 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 00:12:54,922 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 00:12:54,923 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 00:12:54,923 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 00:12:54,924 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 00:12:54,925 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-27 00:12:54,943 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 00:12:54,943 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 00:12:54,945 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 00:12:54,945 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 00:12:54,946 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 00:12:54,946 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 00:12:54,946 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 00:12:54,946 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 00:12:54,946 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 00:12:54,947 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 00:12:54,948 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 00:12:54,948 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 00:12:54,948 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 00:12:54,948 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 00:12:54,949 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 00:12:54,949 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 00:12:54,949 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 00:12:54,949 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 00:12:54,949 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 00:12:54,950 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 00:12:54,950 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 00:12:54,950 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 00:12:54,950 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 00:12:54,951 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 00:12:54,951 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 00:12:54,951 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 00:12:54,951 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 00:12:54,951 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 00:12:54,951 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-27 00:12:54,952 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 00:12:55,226 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 00:12:55,243 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 00:12:55,248 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 00:12:55,250 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 00:12:55,250 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 00:12:55,251 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe029_rmo.oepc.i [2019-12-27 00:12:55,325 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/837d153b2/12737e85504645c491aeef44d1d1abb4/FLAG70a7d2c2b [2019-12-27 00:12:55,893 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 00:12:55,894 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_rmo.oepc.i [2019-12-27 00:12:55,912 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/837d153b2/12737e85504645c491aeef44d1d1abb4/FLAG70a7d2c2b [2019-12-27 00:12:56,216 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/837d153b2/12737e85504645c491aeef44d1d1abb4 [2019-12-27 00:12:56,227 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 00:12:56,228 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 00:12:56,229 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 00:12:56,230 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 00:12:56,233 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 00:12:56,234 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 12:12:56" (1/1) ... [2019-12-27 00:12:56,237 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a53435a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:12:56, skipping insertion in model container [2019-12-27 00:12:56,237 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 12:12:56" (1/1) ... [2019-12-27 00:12:56,245 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 00:12:56,316 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 00:12:56,824 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 00:12:56,839 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 00:12:56,922 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 00:12:57,000 INFO L208 MainTranslator]: Completed translation [2019-12-27 00:12:57,000 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:12:57 WrapperNode [2019-12-27 00:12:57,001 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 00:12:57,001 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 00:12:57,001 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 00:12:57,001 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 00:12:57,008 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:12:57" (1/1) ... [2019-12-27 00:12:57,027 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:12:57" (1/1) ... [2019-12-27 00:12:57,066 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 00:12:57,066 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 00:12:57,066 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 00:12:57,066 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 00:12:57,080 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:12:57" (1/1) ... [2019-12-27 00:12:57,081 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:12:57" (1/1) ... [2019-12-27 00:12:57,087 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:12:57" (1/1) ... [2019-12-27 00:12:57,088 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:12:57" (1/1) ... [2019-12-27 00:12:57,097 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:12:57" (1/1) ... [2019-12-27 00:12:57,101 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:12:57" (1/1) ... [2019-12-27 00:12:57,105 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:12:57" (1/1) ... [2019-12-27 00:12:57,110 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 00:12:57,111 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 00:12:57,111 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 00:12:57,111 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 00:12:57,112 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:12:57" (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 00:12:57,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 00:12:57,192 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 00:12:57,192 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 00:12:57,192 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 00:12:57,192 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 00:12:57,193 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 00:12:57,193 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 00:12:57,193 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 00:12:57,193 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 00:12:57,193 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 00:12:57,193 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 00:12:57,195 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 00:12:57,921 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 00:12:57,921 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 00:12:57,923 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 12:12:57 BoogieIcfgContainer [2019-12-27 00:12:57,923 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 00:12:57,924 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 00:12:57,925 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 00:12:57,931 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 00:12:57,932 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 12:12:56" (1/3) ... [2019-12-27 00:12:57,933 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c47fe71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 12:12:57, skipping insertion in model container [2019-12-27 00:12:57,933 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:12:57" (2/3) ... [2019-12-27 00:12:57,935 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c47fe71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 12:12:57, skipping insertion in model container [2019-12-27 00:12:57,935 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 12:12:57" (3/3) ... [2019-12-27 00:12:57,937 INFO L109 eAbstractionObserver]: Analyzing ICFG safe029_rmo.oepc.i [2019-12-27 00:12:57,949 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 00:12:57,949 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 00:12:57,961 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 00:12:57,962 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 00:12:57,994 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:57,994 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:57,994 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:57,995 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:57,995 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:57,995 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:57,997 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:57,997 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:57,997 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:57,997 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:57,998 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:57,998 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:57,998 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:57,998 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:57,998 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:57,999 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:57,999 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:57,999 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:57,999 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:57,999 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:58,000 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:58,000 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:58,001 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:58,001 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:58,001 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:58,001 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:58,002 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:58,003 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:58,003 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:58,003 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:58,004 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:58,004 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:58,004 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:58,004 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:58,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:58,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:58,006 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:58,006 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:58,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:58,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:58,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:58,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:58,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:58,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:58,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:58,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:58,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:58,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:58,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:58,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:58,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:58,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:58,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:58,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:58,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:58,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:58,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:58,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:58,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:58,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:58,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:58,022 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:58,022 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:58,022 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:58,027 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:58,028 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:58,028 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:58,029 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:58,029 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:58,029 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:58,029 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:58,030 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:58,030 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:58,030 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:58,030 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:58,030 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:58,033 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:58,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:58,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:58,034 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:58,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:58,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:58,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:58,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:58,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:58,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:12:58,052 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 00:12:58,071 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 00:12:58,071 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 00:12:58,072 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 00:12:58,072 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 00:12:58,072 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 00:12:58,072 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 00:12:58,072 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 00:12:58,073 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 00:12:58,090 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 145 places, 179 transitions [2019-12-27 00:12:58,092 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 145 places, 179 transitions [2019-12-27 00:12:58,201 INFO L132 PetriNetUnfolder]: 41/177 cut-off events. [2019-12-27 00:12:58,202 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 00:12:58,217 INFO L76 FinitePrefix]: Finished finitePrefix Result has 184 conditions, 177 events. 41/177 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 250 event pairs. 0/134 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 00:12:58,235 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 145 places, 179 transitions [2019-12-27 00:12:58,278 INFO L132 PetriNetUnfolder]: 41/177 cut-off events. [2019-12-27 00:12:58,278 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 00:12:58,283 INFO L76 FinitePrefix]: Finished finitePrefix Result has 184 conditions, 177 events. 41/177 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 250 event pairs. 0/134 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 00:12:58,296 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10418 [2019-12-27 00:12:58,297 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 00:13:02,859 WARN L192 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 77 [2019-12-27 00:13:02,982 INFO L206 etLargeBlockEncoding]: Checked pairs total: 46212 [2019-12-27 00:13:02,982 INFO L214 etLargeBlockEncoding]: Total number of compositions: 97 [2019-12-27 00:13:02,986 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 78 places, 90 transitions [2019-12-27 00:13:03,435 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8458 states. [2019-12-27 00:13:03,437 INFO L276 IsEmpty]: Start isEmpty. Operand 8458 states. [2019-12-27 00:13:03,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 00:13:03,445 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:13:03,446 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 00:13:03,446 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:13:03,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:13:03,453 INFO L82 PathProgramCache]: Analyzing trace with hash 717058, now seen corresponding path program 1 times [2019-12-27 00:13:03,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:13:03,463 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57074687] [2019-12-27 00:13:03,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:13:03,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:13:03,653 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 00:13:03,654 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57074687] [2019-12-27 00:13:03,655 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:13:03,655 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 00:13:03,656 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660857398] [2019-12-27 00:13:03,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 00:13:03,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:13:03,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 00:13:03,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:13:03,681 INFO L87 Difference]: Start difference. First operand 8458 states. Second operand 3 states. [2019-12-27 00:13:03,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:13:03,943 INFO L93 Difference]: Finished difference Result 8394 states and 27476 transitions. [2019-12-27 00:13:03,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 00:13:03,945 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 00:13:03,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:13:04,036 INFO L225 Difference]: With dead ends: 8394 [2019-12-27 00:13:04,036 INFO L226 Difference]: Without dead ends: 8226 [2019-12-27 00:13:04,037 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 00:13:04,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8226 states. [2019-12-27 00:13:04,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8226 to 8226. [2019-12-27 00:13:04,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8226 states. [2019-12-27 00:13:04,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8226 states to 8226 states and 26958 transitions. [2019-12-27 00:13:04,421 INFO L78 Accepts]: Start accepts. Automaton has 8226 states and 26958 transitions. Word has length 3 [2019-12-27 00:13:04,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:13:04,421 INFO L462 AbstractCegarLoop]: Abstraction has 8226 states and 26958 transitions. [2019-12-27 00:13:04,422 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 00:13:04,422 INFO L276 IsEmpty]: Start isEmpty. Operand 8226 states and 26958 transitions. [2019-12-27 00:13:04,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 00:13:04,424 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:13:04,424 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:13:04,425 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:13:04,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:13:04,425 INFO L82 PathProgramCache]: Analyzing trace with hash 651590314, now seen corresponding path program 1 times [2019-12-27 00:13:04,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:13:04,426 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915062621] [2019-12-27 00:13:04,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:13:04,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:13:04,538 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 00:13:04,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915062621] [2019-12-27 00:13:04,539 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:13:04,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 00:13:04,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958920502] [2019-12-27 00:13:04,540 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 00:13:04,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:13:04,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 00:13:04,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 00:13:04,541 INFO L87 Difference]: Start difference. First operand 8226 states and 26958 transitions. Second operand 4 states. [2019-12-27 00:13:04,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:13:04,920 INFO L93 Difference]: Finished difference Result 12778 states and 40134 transitions. [2019-12-27 00:13:04,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 00:13:04,922 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 00:13:04,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:13:05,004 INFO L225 Difference]: With dead ends: 12778 [2019-12-27 00:13:05,004 INFO L226 Difference]: Without dead ends: 12771 [2019-12-27 00:13:05,005 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 00:13:05,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12771 states. [2019-12-27 00:13:05,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12771 to 11467. [2019-12-27 00:13:05,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11467 states. [2019-12-27 00:13:05,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11467 states to 11467 states and 36507 transitions. [2019-12-27 00:13:05,922 INFO L78 Accepts]: Start accepts. Automaton has 11467 states and 36507 transitions. Word has length 11 [2019-12-27 00:13:05,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:13:05,922 INFO L462 AbstractCegarLoop]: Abstraction has 11467 states and 36507 transitions. [2019-12-27 00:13:05,922 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 00:13:05,923 INFO L276 IsEmpty]: Start isEmpty. Operand 11467 states and 36507 transitions. [2019-12-27 00:13:05,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 00:13:05,931 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:13:05,931 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:13:05,932 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:13:05,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:13:05,932 INFO L82 PathProgramCache]: Analyzing trace with hash -1968692504, now seen corresponding path program 1 times [2019-12-27 00:13:05,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:13:05,933 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633078102] [2019-12-27 00:13:05,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:13:05,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:13:06,020 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 00:13:06,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633078102] [2019-12-27 00:13:06,021 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:13:06,021 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 00:13:06,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740903412] [2019-12-27 00:13:06,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 00:13:06,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:13:06,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 00:13:06,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 00:13:06,023 INFO L87 Difference]: Start difference. First operand 11467 states and 36507 transitions. Second operand 4 states. [2019-12-27 00:13:06,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:13:06,241 INFO L93 Difference]: Finished difference Result 14268 states and 44852 transitions. [2019-12-27 00:13:06,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 00:13:06,241 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 00:13:06,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:13:06,288 INFO L225 Difference]: With dead ends: 14268 [2019-12-27 00:13:06,289 INFO L226 Difference]: Without dead ends: 14268 [2019-12-27 00:13:06,289 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 00:13:06,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14268 states. [2019-12-27 00:13:06,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14268 to 12752. [2019-12-27 00:13:06,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12752 states. [2019-12-27 00:13:06,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12752 states to 12752 states and 40448 transitions. [2019-12-27 00:13:06,794 INFO L78 Accepts]: Start accepts. Automaton has 12752 states and 40448 transitions. Word has length 11 [2019-12-27 00:13:06,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:13:06,794 INFO L462 AbstractCegarLoop]: Abstraction has 12752 states and 40448 transitions. [2019-12-27 00:13:06,794 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 00:13:06,795 INFO L276 IsEmpty]: Start isEmpty. Operand 12752 states and 40448 transitions. [2019-12-27 00:13:06,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 00:13:06,798 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:13:06,798 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:13:06,798 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:13:06,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:13:06,799 INFO L82 PathProgramCache]: Analyzing trace with hash -1372508181, now seen corresponding path program 1 times [2019-12-27 00:13:06,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:13:06,799 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542164724] [2019-12-27 00:13:06,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:13:06,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:13:06,866 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 00:13:06,867 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542164724] [2019-12-27 00:13:06,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:13:06,867 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 00:13:06,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706765340] [2019-12-27 00:13:06,871 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 00:13:06,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:13:06,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 00:13:06,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 00:13:06,872 INFO L87 Difference]: Start difference. First operand 12752 states and 40448 transitions. Second operand 5 states. [2019-12-27 00:13:07,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:13:07,337 INFO L93 Difference]: Finished difference Result 17010 states and 52843 transitions. [2019-12-27 00:13:07,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 00:13:07,337 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-27 00:13:07,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:13:07,400 INFO L225 Difference]: With dead ends: 17010 [2019-12-27 00:13:07,401 INFO L226 Difference]: Without dead ends: 17003 [2019-12-27 00:13:07,401 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:13:07,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17003 states. [2019-12-27 00:13:07,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17003 to 12755. [2019-12-27 00:13:07,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12755 states. [2019-12-27 00:13:07,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12755 states to 12755 states and 40342 transitions. [2019-12-27 00:13:07,985 INFO L78 Accepts]: Start accepts. Automaton has 12755 states and 40342 transitions. Word has length 17 [2019-12-27 00:13:07,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:13:07,985 INFO L462 AbstractCegarLoop]: Abstraction has 12755 states and 40342 transitions. [2019-12-27 00:13:07,985 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 00:13:07,985 INFO L276 IsEmpty]: Start isEmpty. Operand 12755 states and 40342 transitions. [2019-12-27 00:13:07,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:13:07,997 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:13:07,997 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 00:13:07,997 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:13:07,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:13:07,998 INFO L82 PathProgramCache]: Analyzing trace with hash -1155459573, now seen corresponding path program 1 times [2019-12-27 00:13:07,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:13:07,998 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12222393] [2019-12-27 00:13:07,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:13:08,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:13:08,042 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 00:13:08,042 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12222393] [2019-12-27 00:13:08,043 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:13:08,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 00:13:08,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473527134] [2019-12-27 00:13:08,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 00:13:08,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:13:08,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 00:13:08,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:13:08,045 INFO L87 Difference]: Start difference. First operand 12755 states and 40342 transitions. Second operand 3 states. [2019-12-27 00:13:08,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:13:08,150 INFO L93 Difference]: Finished difference Result 15529 states and 48523 transitions. [2019-12-27 00:13:08,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 00:13:08,151 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-12-27 00:13:08,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:13:08,183 INFO L225 Difference]: With dead ends: 15529 [2019-12-27 00:13:08,183 INFO L226 Difference]: Without dead ends: 15529 [2019-12-27 00:13:08,183 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 00:13:08,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15529 states. [2019-12-27 00:13:09,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15529 to 13746. [2019-12-27 00:13:09,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13746 states. [2019-12-27 00:13:09,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13746 states to 13746 states and 43375 transitions. [2019-12-27 00:13:09,189 INFO L78 Accepts]: Start accepts. Automaton has 13746 states and 43375 transitions. Word has length 25 [2019-12-27 00:13:09,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:13:09,190 INFO L462 AbstractCegarLoop]: Abstraction has 13746 states and 43375 transitions. [2019-12-27 00:13:09,190 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 00:13:09,191 INFO L276 IsEmpty]: Start isEmpty. Operand 13746 states and 43375 transitions. [2019-12-27 00:13:09,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:13:09,203 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:13:09,203 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 00:13:09,204 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:13:09,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:13:09,204 INFO L82 PathProgramCache]: Analyzing trace with hash -1248228747, now seen corresponding path program 1 times [2019-12-27 00:13:09,204 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:13:09,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600106707] [2019-12-27 00:13:09,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:13:09,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:13:09,296 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 00:13:09,297 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600106707] [2019-12-27 00:13:09,297 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:13:09,297 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 00:13:09,298 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966673993] [2019-12-27 00:13:09,298 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 00:13:09,298 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:13:09,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 00:13:09,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 00:13:09,300 INFO L87 Difference]: Start difference. First operand 13746 states and 43375 transitions. Second operand 6 states. [2019-12-27 00:13:09,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:13:09,802 INFO L93 Difference]: Finished difference Result 19657 states and 60760 transitions. [2019-12-27 00:13:09,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 00:13:09,803 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-27 00:13:09,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:13:09,834 INFO L225 Difference]: With dead ends: 19657 [2019-12-27 00:13:09,834 INFO L226 Difference]: Without dead ends: 19641 [2019-12-27 00:13:09,835 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:13:09,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19641 states. [2019-12-27 00:13:10,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19641 to 15905. [2019-12-27 00:13:10,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15905 states. [2019-12-27 00:13:10,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15905 states to 15905 states and 49859 transitions. [2019-12-27 00:13:10,559 INFO L78 Accepts]: Start accepts. Automaton has 15905 states and 49859 transitions. Word has length 25 [2019-12-27 00:13:10,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:13:10,559 INFO L462 AbstractCegarLoop]: Abstraction has 15905 states and 49859 transitions. [2019-12-27 00:13:10,559 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 00:13:10,560 INFO L276 IsEmpty]: Start isEmpty. Operand 15905 states and 49859 transitions. [2019-12-27 00:13:10,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-27 00:13:10,585 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:13:10,585 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] [2019-12-27 00:13:10,586 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:13:10,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:13:10,586 INFO L82 PathProgramCache]: Analyzing trace with hash 279625016, now seen corresponding path program 1 times [2019-12-27 00:13:10,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:13:10,587 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309535353] [2019-12-27 00:13:10,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:13:10,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:13:10,679 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 00:13:10,681 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309535353] [2019-12-27 00:13:10,682 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:13:10,682 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 00:13:10,682 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132889749] [2019-12-27 00:13:10,682 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 00:13:10,683 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:13:10,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 00:13:10,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 00:13:10,683 INFO L87 Difference]: Start difference. First operand 15905 states and 49859 transitions. Second operand 4 states. [2019-12-27 00:13:10,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:13:10,718 INFO L93 Difference]: Finished difference Result 2247 states and 5122 transitions. [2019-12-27 00:13:10,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 00:13:10,719 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2019-12-27 00:13:10,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:13:10,722 INFO L225 Difference]: With dead ends: 2247 [2019-12-27 00:13:10,722 INFO L226 Difference]: Without dead ends: 1970 [2019-12-27 00:13:10,722 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 00:13:10,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1970 states. [2019-12-27 00:13:10,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1970 to 1970. [2019-12-27 00:13:10,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1970 states. [2019-12-27 00:13:10,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1970 states to 1970 states and 4356 transitions. [2019-12-27 00:13:10,753 INFO L78 Accepts]: Start accepts. Automaton has 1970 states and 4356 transitions. Word has length 31 [2019-12-27 00:13:10,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:13:10,754 INFO L462 AbstractCegarLoop]: Abstraction has 1970 states and 4356 transitions. [2019-12-27 00:13:10,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 00:13:10,754 INFO L276 IsEmpty]: Start isEmpty. Operand 1970 states and 4356 transitions. [2019-12-27 00:13:10,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 00:13:10,760 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:13:10,760 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] [2019-12-27 00:13:10,760 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:13:10,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:13:10,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1011623832, now seen corresponding path program 1 times [2019-12-27 00:13:10,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:13:10,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709235283] [2019-12-27 00:13:10,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:13:10,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:13:10,908 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 00:13:10,909 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709235283] [2019-12-27 00:13:10,909 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:13:10,909 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 00:13:10,910 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781095208] [2019-12-27 00:13:10,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 00:13:10,910 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:13:10,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 00:13:10,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:13:10,911 INFO L87 Difference]: Start difference. First operand 1970 states and 4356 transitions. Second operand 7 states. [2019-12-27 00:13:11,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:13:11,497 INFO L93 Difference]: Finished difference Result 2561 states and 5544 transitions. [2019-12-27 00:13:11,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 00:13:11,497 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2019-12-27 00:13:11,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:13:11,501 INFO L225 Difference]: With dead ends: 2561 [2019-12-27 00:13:11,502 INFO L226 Difference]: Without dead ends: 2559 [2019-12-27 00:13:11,502 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-27 00:13:11,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2559 states. [2019-12-27 00:13:11,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2559 to 2033. [2019-12-27 00:13:11,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2033 states. [2019-12-27 00:13:11,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2033 states to 2033 states and 4500 transitions. [2019-12-27 00:13:11,539 INFO L78 Accepts]: Start accepts. Automaton has 2033 states and 4500 transitions. Word has length 37 [2019-12-27 00:13:11,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:13:11,540 INFO L462 AbstractCegarLoop]: Abstraction has 2033 states and 4500 transitions. [2019-12-27 00:13:11,540 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 00:13:11,540 INFO L276 IsEmpty]: Start isEmpty. Operand 2033 states and 4500 transitions. [2019-12-27 00:13:11,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 00:13:11,545 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:13:11,545 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:13:11,545 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:13:11,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:13:11,546 INFO L82 PathProgramCache]: Analyzing trace with hash -669150451, now seen corresponding path program 1 times [2019-12-27 00:13:11,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:13:11,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303372221] [2019-12-27 00:13:11,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:13:11,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:13:11,624 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 00:13:11,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303372221] [2019-12-27 00:13:11,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:13:11,625 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 00:13:11,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324527000] [2019-12-27 00:13:11,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 00:13:11,626 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:13:11,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 00:13:11,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 00:13:11,627 INFO L87 Difference]: Start difference. First operand 2033 states and 4500 transitions. Second operand 5 states. [2019-12-27 00:13:12,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:13:12,091 INFO L93 Difference]: Finished difference Result 2780 states and 6027 transitions. [2019-12-27 00:13:12,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 00:13:12,092 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-12-27 00:13:12,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:13:12,095 INFO L225 Difference]: With dead ends: 2780 [2019-12-27 00:13:12,095 INFO L226 Difference]: Without dead ends: 2780 [2019-12-27 00:13:12,096 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 00:13:12,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2780 states. [2019-12-27 00:13:12,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2780 to 2441. [2019-12-27 00:13:12,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2441 states. [2019-12-27 00:13:12,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2441 states to 2441 states and 5347 transitions. [2019-12-27 00:13:12,136 INFO L78 Accepts]: Start accepts. Automaton has 2441 states and 5347 transitions. Word has length 41 [2019-12-27 00:13:12,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:13:12,136 INFO L462 AbstractCegarLoop]: Abstraction has 2441 states and 5347 transitions. [2019-12-27 00:13:12,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 00:13:12,137 INFO L276 IsEmpty]: Start isEmpty. Operand 2441 states and 5347 transitions. [2019-12-27 00:13:12,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 00:13:12,141 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:13:12,141 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:13:12,142 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:13:12,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:13:12,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1265386816, now seen corresponding path program 1 times [2019-12-27 00:13:12,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:13:12,143 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007734510] [2019-12-27 00:13:12,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:13:12,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:13:12,219 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 00:13:12,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007734510] [2019-12-27 00:13:12,220 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:13:12,220 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 00:13:12,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032785854] [2019-12-27 00:13:12,220 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 00:13:12,221 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:13:12,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 00:13:12,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 00:13:12,221 INFO L87 Difference]: Start difference. First operand 2441 states and 5347 transitions. Second operand 5 states. [2019-12-27 00:13:12,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:13:12,728 INFO L93 Difference]: Finished difference Result 3289 states and 7089 transitions. [2019-12-27 00:13:12,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 00:13:12,729 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-12-27 00:13:12,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:13:12,733 INFO L225 Difference]: With dead ends: 3289 [2019-12-27 00:13:12,733 INFO L226 Difference]: Without dead ends: 3289 [2019-12-27 00:13:12,734 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:13:12,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3289 states. [2019-12-27 00:13:12,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3289 to 2732. [2019-12-27 00:13:12,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2732 states. [2019-12-27 00:13:12,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2732 states to 2732 states and 5972 transitions. [2019-12-27 00:13:12,844 INFO L78 Accepts]: Start accepts. Automaton has 2732 states and 5972 transitions. Word has length 42 [2019-12-27 00:13:12,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:13:12,844 INFO L462 AbstractCegarLoop]: Abstraction has 2732 states and 5972 transitions. [2019-12-27 00:13:12,844 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 00:13:12,845 INFO L276 IsEmpty]: Start isEmpty. Operand 2732 states and 5972 transitions. [2019-12-27 00:13:12,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 00:13:12,853 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:13:12,854 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:13:12,854 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:13:12,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:13:12,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1349071825, now seen corresponding path program 1 times [2019-12-27 00:13:12,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:13:12,855 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981139723] [2019-12-27 00:13:12,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:13:12,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:13:12,964 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 00:13:12,964 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981139723] [2019-12-27 00:13:12,965 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:13:12,965 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 00:13:12,965 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226091845] [2019-12-27 00:13:12,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 00:13:12,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:13:12,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 00:13:12,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 00:13:12,967 INFO L87 Difference]: Start difference. First operand 2732 states and 5972 transitions. Second operand 5 states. [2019-12-27 00:13:13,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:13:13,012 INFO L93 Difference]: Finished difference Result 706 states and 1302 transitions. [2019-12-27 00:13:13,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 00:13:13,013 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-12-27 00:13:13,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:13:13,014 INFO L225 Difference]: With dead ends: 706 [2019-12-27 00:13:13,014 INFO L226 Difference]: Without dead ends: 626 [2019-12-27 00:13:13,015 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 00:13:13,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-12-27 00:13:13,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 500. [2019-12-27 00:13:13,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-12-27 00:13:13,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 913 transitions. [2019-12-27 00:13:13,021 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 913 transitions. Word has length 42 [2019-12-27 00:13:13,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:13:13,021 INFO L462 AbstractCegarLoop]: Abstraction has 500 states and 913 transitions. [2019-12-27 00:13:13,021 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 00:13:13,021 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 913 transitions. [2019-12-27 00:13:13,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 00:13:13,022 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:13:13,023 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] [2019-12-27 00:13:13,023 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:13:13,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:13:13,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1583281740, now seen corresponding path program 1 times [2019-12-27 00:13:13,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:13:13,024 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932877994] [2019-12-27 00:13:13,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:13:13,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:13:13,113 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 00:13:13,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932877994] [2019-12-27 00:13:13,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:13:13,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 00:13:13,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904681227] [2019-12-27 00:13:13,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 00:13:13,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:13:13,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 00:13:13,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 00:13:13,116 INFO L87 Difference]: Start difference. First operand 500 states and 913 transitions. Second operand 6 states. [2019-12-27 00:13:13,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:13:13,437 INFO L93 Difference]: Finished difference Result 701 states and 1268 transitions. [2019-12-27 00:13:13,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 00:13:13,438 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-12-27 00:13:13,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:13:13,439 INFO L225 Difference]: With dead ends: 701 [2019-12-27 00:13:13,439 INFO L226 Difference]: Without dead ends: 701 [2019-12-27 00:13:13,439 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-27 00:13:13,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2019-12-27 00:13:13,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 533. [2019-12-27 00:13:13,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 533 states. [2019-12-27 00:13:13,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 974 transitions. [2019-12-27 00:13:13,447 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 974 transitions. Word has length 52 [2019-12-27 00:13:13,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:13:13,448 INFO L462 AbstractCegarLoop]: Abstraction has 533 states and 974 transitions. [2019-12-27 00:13:13,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 00:13:13,448 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 974 transitions. [2019-12-27 00:13:13,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 00:13:13,449 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:13:13,449 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] [2019-12-27 00:13:13,450 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:13:13,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:13:13,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1092311168, now seen corresponding path program 2 times [2019-12-27 00:13:13,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:13:13,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147937474] [2019-12-27 00:13:13,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:13:13,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:13:13,500 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 00:13:13,500 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147937474] [2019-12-27 00:13:13,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:13:13,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 00:13:13,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370499569] [2019-12-27 00:13:13,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 00:13:13,501 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:13:13,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 00:13:13,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:13:13,502 INFO L87 Difference]: Start difference. First operand 533 states and 974 transitions. Second operand 3 states. [2019-12-27 00:13:13,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:13:13,515 INFO L93 Difference]: Finished difference Result 480 states and 854 transitions. [2019-12-27 00:13:13,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 00:13:13,516 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 00:13:13,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:13:13,516 INFO L225 Difference]: With dead ends: 480 [2019-12-27 00:13:13,516 INFO L226 Difference]: Without dead ends: 480 [2019-12-27 00:13:13,517 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:13:13,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2019-12-27 00:13:13,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 480. [2019-12-27 00:13:13,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 480 states. [2019-12-27 00:13:13,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 854 transitions. [2019-12-27 00:13:13,523 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 854 transitions. Word has length 52 [2019-12-27 00:13:13,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:13:13,524 INFO L462 AbstractCegarLoop]: Abstraction has 480 states and 854 transitions. [2019-12-27 00:13:13,524 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 00:13:13,524 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 854 transitions. [2019-12-27 00:13:13,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 00:13:13,525 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:13:13,525 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] [2019-12-27 00:13:13,525 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:13:13,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:13:13,526 INFO L82 PathProgramCache]: Analyzing trace with hash 660947046, now seen corresponding path program 1 times [2019-12-27 00:13:13,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:13:13,526 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068897126] [2019-12-27 00:13:13,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:13:13,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:13:13,638 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 00:13:13,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068897126] [2019-12-27 00:13:13,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:13:13,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 00:13:13,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782967281] [2019-12-27 00:13:13,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 00:13:13,640 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:13:13,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 00:13:13,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 00:13:13,641 INFO L87 Difference]: Start difference. First operand 480 states and 854 transitions. Second operand 6 states. [2019-12-27 00:13:13,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:13:13,711 INFO L93 Difference]: Finished difference Result 815 states and 1453 transitions. [2019-12-27 00:13:13,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 00:13:13,712 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-12-27 00:13:13,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:13:13,713 INFO L225 Difference]: With dead ends: 815 [2019-12-27 00:13:13,713 INFO L226 Difference]: Without dead ends: 404 [2019-12-27 00:13:13,714 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-27 00:13:13,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2019-12-27 00:13:13,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 356. [2019-12-27 00:13:13,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-12-27 00:13:13,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 639 transitions. [2019-12-27 00:13:13,718 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 639 transitions. Word has length 53 [2019-12-27 00:13:13,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:13:13,718 INFO L462 AbstractCegarLoop]: Abstraction has 356 states and 639 transitions. [2019-12-27 00:13:13,718 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 00:13:13,718 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 639 transitions. [2019-12-27 00:13:13,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 00:13:13,719 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:13:13,719 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] [2019-12-27 00:13:13,719 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:13:13,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:13:13,720 INFO L82 PathProgramCache]: Analyzing trace with hash 2062591520, now seen corresponding path program 2 times [2019-12-27 00:13:13,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:13:13,720 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372878579] [2019-12-27 00:13:13,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:13:13,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:13:13,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:13:13,781 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372878579] [2019-12-27 00:13:13,781 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:13:13,781 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 00:13:13,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574632086] [2019-12-27 00:13:13,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 00:13:13,782 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:13:13,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 00:13:13,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:13:13,783 INFO L87 Difference]: Start difference. First operand 356 states and 639 transitions. Second operand 3 states. [2019-12-27 00:13:13,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:13:13,825 INFO L93 Difference]: Finished difference Result 355 states and 637 transitions. [2019-12-27 00:13:13,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 00:13:13,826 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-27 00:13:13,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:13:13,826 INFO L225 Difference]: With dead ends: 355 [2019-12-27 00:13:13,826 INFO L226 Difference]: Without dead ends: 355 [2019-12-27 00:13:13,827 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:13:13,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2019-12-27 00:13:13,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 219. [2019-12-27 00:13:13,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-12-27 00:13:13,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 389 transitions. [2019-12-27 00:13:13,831 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 389 transitions. Word has length 53 [2019-12-27 00:13:13,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:13:13,831 INFO L462 AbstractCegarLoop]: Abstraction has 219 states and 389 transitions. [2019-12-27 00:13:13,831 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 00:13:13,831 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 389 transitions. [2019-12-27 00:13:13,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 00:13:13,832 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:13:13,832 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] [2019-12-27 00:13:13,832 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:13:13,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:13:13,833 INFO L82 PathProgramCache]: Analyzing trace with hash 133727006, now seen corresponding path program 1 times [2019-12-27 00:13:13,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:13:13,833 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892245417] [2019-12-27 00:13:13,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:13:13,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:13:14,399 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 00:13:14,399 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892245417] [2019-12-27 00:13:14,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:13:14,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-12-27 00:13:14,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71071343] [2019-12-27 00:13:14,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-27 00:13:14,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:13:14,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-27 00:13:14,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2019-12-27 00:13:14,401 INFO L87 Difference]: Start difference. First operand 219 states and 389 transitions. Second operand 21 states. [2019-12-27 00:13:15,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:13:15,896 INFO L93 Difference]: Finished difference Result 657 states and 1122 transitions. [2019-12-27 00:13:15,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-27 00:13:15,897 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 54 [2019-12-27 00:13:15,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:13:15,898 INFO L225 Difference]: With dead ends: 657 [2019-12-27 00:13:15,898 INFO L226 Difference]: Without dead ends: 616 [2019-12-27 00:13:15,899 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 476 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=326, Invalid=1654, Unknown=0, NotChecked=0, Total=1980 [2019-12-27 00:13:15,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2019-12-27 00:13:15,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 303. [2019-12-27 00:13:15,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2019-12-27 00:13:15,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 533 transitions. [2019-12-27 00:13:15,904 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 533 transitions. Word has length 54 [2019-12-27 00:13:15,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:13:15,904 INFO L462 AbstractCegarLoop]: Abstraction has 303 states and 533 transitions. [2019-12-27 00:13:15,904 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-27 00:13:15,904 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 533 transitions. [2019-12-27 00:13:15,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 00:13:15,905 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:13:15,905 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:13:15,905 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:13:15,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:13:15,905 INFO L82 PathProgramCache]: Analyzing trace with hash 799522834, now seen corresponding path program 2 times [2019-12-27 00:13:15,905 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:13:15,906 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859388243] [2019-12-27 00:13:15,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:13:15,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:13:16,184 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 00:13:16,185 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859388243] [2019-12-27 00:13:16,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:13:16,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 00:13:16,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969996113] [2019-12-27 00:13:16,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 00:13:16,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:13:16,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 00:13:16,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-12-27 00:13:16,187 INFO L87 Difference]: Start difference. First operand 303 states and 533 transitions. Second operand 13 states. [2019-12-27 00:13:16,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:13:16,728 INFO L93 Difference]: Finished difference Result 468 states and 805 transitions. [2019-12-27 00:13:16,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 00:13:16,728 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 54 [2019-12-27 00:13:16,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:13:16,729 INFO L225 Difference]: With dead ends: 468 [2019-12-27 00:13:16,730 INFO L226 Difference]: Without dead ends: 437 [2019-12-27 00:13:16,731 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=489, Unknown=0, NotChecked=0, Total=600 [2019-12-27 00:13:16,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2019-12-27 00:13:16,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 319. [2019-12-27 00:13:16,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2019-12-27 00:13:16,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 560 transitions. [2019-12-27 00:13:16,735 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 560 transitions. Word has length 54 [2019-12-27 00:13:16,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:13:16,736 INFO L462 AbstractCegarLoop]: Abstraction has 319 states and 560 transitions. [2019-12-27 00:13:16,736 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 00:13:16,736 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 560 transitions. [2019-12-27 00:13:16,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 00:13:16,736 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:13:16,737 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] [2019-12-27 00:13:16,737 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:13:16,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:13:16,737 INFO L82 PathProgramCache]: Analyzing trace with hash 815200260, now seen corresponding path program 3 times [2019-12-27 00:13:16,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:13:16,737 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579650423] [2019-12-27 00:13:16,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:13:16,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:13:17,431 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 00:13:17,431 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579650423] [2019-12-27 00:13:17,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:13:17,432 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-12-27 00:13:17,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965731979] [2019-12-27 00:13:17,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-27 00:13:17,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:13:17,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-27 00:13:17,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2019-12-27 00:13:17,433 INFO L87 Difference]: Start difference. First operand 319 states and 560 transitions. Second operand 21 states. [2019-12-27 00:13:19,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:13:19,104 INFO L93 Difference]: Finished difference Result 743 states and 1281 transitions. [2019-12-27 00:13:19,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-27 00:13:19,105 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 54 [2019-12-27 00:13:19,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:13:19,106 INFO L225 Difference]: With dead ends: 743 [2019-12-27 00:13:19,106 INFO L226 Difference]: Without dead ends: 703 [2019-12-27 00:13:19,107 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=232, Invalid=1250, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 00:13:19,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2019-12-27 00:13:19,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 347. [2019-12-27 00:13:19,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2019-12-27 00:13:19,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 614 transitions. [2019-12-27 00:13:19,113 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 614 transitions. Word has length 54 [2019-12-27 00:13:19,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:13:19,113 INFO L462 AbstractCegarLoop]: Abstraction has 347 states and 614 transitions. [2019-12-27 00:13:19,113 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-27 00:13:19,113 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 614 transitions. [2019-12-27 00:13:19,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 00:13:19,114 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:13:19,114 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] [2019-12-27 00:13:19,114 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:13:19,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:13:19,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1701611196, now seen corresponding path program 4 times [2019-12-27 00:13:19,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:13:19,115 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799604973] [2019-12-27 00:13:19,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:13:19,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:13:19,857 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 00:13:19,857 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799604973] [2019-12-27 00:13:19,857 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:13:19,857 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-12-27 00:13:19,858 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988080527] [2019-12-27 00:13:19,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-27 00:13:19,858 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:13:19,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-27 00:13:19,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2019-12-27 00:13:19,859 INFO L87 Difference]: Start difference. First operand 347 states and 614 transitions. Second operand 22 states. [2019-12-27 00:13:21,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:13:21,088 INFO L93 Difference]: Finished difference Result 764 states and 1321 transitions. [2019-12-27 00:13:21,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-27 00:13:21,089 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 54 [2019-12-27 00:13:21,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:13:21,090 INFO L225 Difference]: With dead ends: 764 [2019-12-27 00:13:21,090 INFO L226 Difference]: Without dead ends: 724 [2019-12-27 00:13:21,091 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=234, Invalid=1172, Unknown=0, NotChecked=0, Total=1406 [2019-12-27 00:13:21,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2019-12-27 00:13:21,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 362. [2019-12-27 00:13:21,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2019-12-27 00:13:21,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 641 transitions. [2019-12-27 00:13:21,098 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 641 transitions. Word has length 54 [2019-12-27 00:13:21,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:13:21,099 INFO L462 AbstractCegarLoop]: Abstraction has 362 states and 641 transitions. [2019-12-27 00:13:21,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-27 00:13:21,099 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 641 transitions. [2019-12-27 00:13:21,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 00:13:21,100 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:13:21,100 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] [2019-12-27 00:13:21,100 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:13:21,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:13:21,100 INFO L82 PathProgramCache]: Analyzing trace with hash 2067211286, now seen corresponding path program 5 times [2019-12-27 00:13:21,101 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:13:21,101 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581003532] [2019-12-27 00:13:21,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:13:21,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 00:13:21,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 00:13:21,188 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 00:13:21,188 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 00:13:21,193 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] ULTIMATE.startENTRY-->L777: Formula: (let ((.cse0 (store |v_#valid_40| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2481~0.base_19| 4)) (= 0 |v_ULTIMATE.start_main_~#t2481~0.offset_16|) (= 0 v_~__unbuffered_cnt~0_61) (= v_~weak$$choice2~0_132 0) (= |v_#NULL.offset_6| 0) (= v_~y$read_delayed~0_7 0) (= v_~y$w_buff1_used~0_444 0) (= v_~y$r_buff1_thd0~0_304 0) (= v_~main$tmp_guard0~0_23 0) (= v_~y$r_buff0_thd0~0_394 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t2481~0.base_19|) 0) (= 0 v_~y$w_buff0~0_376) (= 0 |v_#NULL.base_6|) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t2481~0.base_19|) (= v_~y$r_buff1_thd1~0_220 0) (= v_~y~0_141 0) (= v_~y$r_buff0_thd1~0_301 0) (= 0 v_~weak$$choice0~0_24) (= 0 v_~y$flush_delayed~0_48) (= 0 v_~y$r_buff0_thd2~0_175) (= v_~y$w_buff1~0_254 0) (= |v_#valid_38| (store .cse0 |v_ULTIMATE.start_main_~#t2481~0.base_19| 1)) (= v_~y$mem_tmp~0_31 0) (= v_~y$w_buff0_used~0_753 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= 0 v_~y$r_buff1_thd2~0_205) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2481~0.base_19| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2481~0.base_19|) |v_ULTIMATE.start_main_~#t2481~0.offset_16| 0)) |v_#memory_int_15|) (= 0 v_~x~0_168) (< 0 |v_#StackHeapBarrier_13|) (= v_~main$tmp_guard1~0_22 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_45|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_32|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_32|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_42|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_56|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_35|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ULTIMATE.start_main_~#t2481~0.offset=|v_ULTIMATE.start_main_~#t2481~0.offset_16|, ~y$mem_tmp~0=v_~y$mem_tmp~0_31, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_301, ~y$flush_delayed~0=v_~y$flush_delayed~0_48, ULTIMATE.start_main_~#t2482~0.base=|v_ULTIMATE.start_main_~#t2482~0.base_19|, #length=|v_#length_15|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_29|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_32|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_44|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_35|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_51|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_45|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_31|, ~weak$$choice0~0=v_~weak$$choice0~0_24, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_30|, ~y$w_buff1~0=v_~y$w_buff1~0_254, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_175, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_304, ~x~0=v_~x~0_168, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ULTIMATE.start_main_~#t2482~0.offset=|v_ULTIMATE.start_main_~#t2482~0.offset_15|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_753, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_28|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_28|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_22, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_43|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_28|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_46|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_28|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_220, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_39|, ~y$w_buff0~0=v_~y$w_buff0~0_376, ~y~0=v_~y~0_141, ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_30|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_44|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_26|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_37|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_29|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_23, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_28|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_39|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_205, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_16|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_15|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_394, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_13|, ~weak$$choice2~0=v_~weak$$choice2~0_132, ULTIMATE.start_main_~#t2481~0.base=|v_ULTIMATE.start_main_~#t2481~0.base_19|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_444} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ULTIMATE.start_main_~#t2481~0.offset, ~y$mem_tmp~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ULTIMATE.start_main_~#t2482~0.base, #length, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet15, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ULTIMATE.start_main_~#t2482~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite30, ~y$w_buff0~0, ~y~0, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~weak$$choice2~0, ULTIMATE.start_main_~#t2481~0.base, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 00:13:21,193 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L777-1-->L779: Formula: (and (not (= |v_ULTIMATE.start_main_~#t2482~0.base_11| 0)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2482~0.base_11| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2482~0.base_11|) |v_ULTIMATE.start_main_~#t2482~0.offset_10| 1))) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t2482~0.base_11|) (= |v_#valid_21| (store |v_#valid_22| |v_ULTIMATE.start_main_~#t2482~0.base_11| 1)) (= 0 |v_ULTIMATE.start_main_~#t2482~0.offset_10|) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t2482~0.base_11| 4) |v_#length_9|) (= 0 (select |v_#valid_22| |v_ULTIMATE.start_main_~#t2482~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t2482~0.offset=|v_ULTIMATE.start_main_~#t2482~0.offset_10|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, ULTIMATE.start_main_~#t2482~0.base=|v_ULTIMATE.start_main_~#t2482~0.base_11|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2482~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_~#t2482~0.base, #length] because there is no mapped edge [2019-12-27 00:13:21,194 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [623] [623] P0ENTRY-->L4-3: Formula: (and (= 2 v_~y$w_buff0~0_172) (= 1 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_79|) (= v_P0Thread1of1ForFork0_~arg.offset_79 |v_P0Thread1of1ForFork0_#in~arg.offset_79|) (= v_~y$w_buff0_used~0_290 1) (= 0 (mod v_~y$w_buff1_used~0_162 256)) (= v_P0Thread1of1ForFork0_~arg.base_79 |v_P0Thread1of1ForFork0_#in~arg.base_79|) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_81 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_79|) (= v_~y$w_buff0_used~0_291 v_~y$w_buff1_used~0_162) (= v_~y$w_buff1~0_100 v_~y$w_buff0~0_173)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_79|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_291, ~y$w_buff0~0=v_~y$w_buff0~0_173, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_79|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_79|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_290, ~y$w_buff1~0=v_~y$w_buff1~0_100, ~y$w_buff0~0=v_~y$w_buff0~0_172, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_81, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_79|, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_79, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_79|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_79, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_162} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 00:13:21,196 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [656] [656] L735-->L735-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd1~0_In-247582414 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-247582414 256) 0))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-247582414|) (not .cse0) (not .cse1)) (and (= ~y$w_buff0_used~0_In-247582414 |P0Thread1of1ForFork0_#t~ite5_Out-247582414|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-247582414, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-247582414} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-247582414|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-247582414, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-247582414} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 00:13:21,196 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L754-2-->L754-4: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd2~0_In1984531680 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In1984531680 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite9_Out1984531680| ~y$w_buff1~0_In1984531680) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite9_Out1984531680| ~y~0_In1984531680)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1984531680, ~y$w_buff1~0=~y$w_buff1~0_In1984531680, ~y~0=~y~0_In1984531680, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1984531680} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1984531680, ~y$w_buff1~0=~y$w_buff1~0_In1984531680, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out1984531680|, ~y~0=~y~0_In1984531680, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1984531680} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-12-27 00:13:21,197 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [630] [630] L754-4-->L755: Formula: (= v_~y~0_50 |v_P1Thread1of1ForFork1_#t~ite9_14|) InVars {P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_14|} OutVars{P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_13|, P1Thread1of1ForFork1_#t~ite10=|v_P1Thread1of1ForFork1_#t~ite10_15|, ~y~0=v_~y~0_50} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10, ~y~0] because there is no mapped edge [2019-12-27 00:13:21,197 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L755-->L755-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-286031076 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-286031076 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-286031076 |P1Thread1of1ForFork1_#t~ite11_Out-286031076|)) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite11_Out-286031076| 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-286031076, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-286031076} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-286031076, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-286031076, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-286031076|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 00:13:21,197 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L736-->L736-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff0_thd1~0_In1661161792 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In1661161792 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In1661161792 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd1~0_In1661161792 256) 0))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out1661161792|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$w_buff1_used~0_In1661161792 |P0Thread1of1ForFork0_#t~ite6_Out1661161792|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1661161792, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1661161792, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1661161792, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1661161792} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1661161792|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1661161792, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1661161792, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1661161792, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1661161792} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 00:13:21,198 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L737-->L738: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-787325402 256))) (.cse1 (= (mod ~y$r_buff0_thd1~0_In-787325402 256) 0))) (or (and (= 0 ~y$r_buff0_thd1~0_Out-787325402) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd1~0_Out-787325402 ~y$r_buff0_thd1~0_In-787325402)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-787325402, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-787325402} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-787325402, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-787325402|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-787325402} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 00:13:21,198 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [638] [638] L756-->L756-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In-301379231 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In-301379231 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd2~0_In-301379231 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-301379231 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite12_Out-301379231| 0)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite12_Out-301379231| ~y$w_buff1_used~0_In-301379231)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-301379231, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-301379231, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-301379231, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-301379231} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-301379231, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-301379231, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-301379231, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-301379231|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-301379231} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 00:13:21,199 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L757-->L757-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1903731298 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd2~0_In-1903731298 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite13_Out-1903731298| ~y$r_buff0_thd2~0_In-1903731298) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite13_Out-1903731298|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1903731298, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1903731298} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1903731298, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1903731298, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-1903731298|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-27 00:13:21,200 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [644] [644] L758-->L758-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In1996227121 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In1996227121 256))) (.cse0 (= (mod ~y$r_buff1_thd2~0_In1996227121 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1996227121 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd2~0_In1996227121 |P1Thread1of1ForFork1_#t~ite14_Out1996227121|) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |P1Thread1of1ForFork1_#t~ite14_Out1996227121|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1996227121, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1996227121, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1996227121, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1996227121} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1996227121, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1996227121, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1996227121, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out1996227121|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1996227121} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 00:13:21,200 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [668] [668] L758-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= |v_P1Thread1of1ForFork1_#t~ite14_34| v_~y$r_buff1_thd2~0_85) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_34|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_85, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_33|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 00:13:21,200 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [655] [655] L738-->L738-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In932371876 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In932371876 256))) (.cse2 (= (mod ~y$r_buff1_thd1~0_In932371876 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In932371876 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out932371876| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |P0Thread1of1ForFork0_#t~ite8_Out932371876| ~y$r_buff1_thd1~0_In932371876) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In932371876, ~y$w_buff0_used~0=~y$w_buff0_used~0_In932371876, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In932371876, ~y$w_buff1_used~0=~y$w_buff1_used~0_In932371876} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In932371876, ~y$w_buff0_used~0=~y$w_buff0_used~0_In932371876, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out932371876|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In932371876, ~y$w_buff1_used~0=~y$w_buff1_used~0_In932371876} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 00:13:21,200 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [663] [663] L738-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_32 (+ v_~__unbuffered_cnt~0_33 1)) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~y$r_buff1_thd1~0_63 |v_P0Thread1of1ForFork0_#t~ite8_28|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_63, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_27|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 00:13:21,201 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [592] [592] L783-->L785-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (or (= (mod v_~y$w_buff0_used~0_159 256) 0) (= (mod v_~y$r_buff0_thd0~0_61 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_159, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_61, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_159, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_61, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 00:13:21,201 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [654] [654] L785-2-->L785-4: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd0~0_In-1634322896 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In-1634322896 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite17_Out-1634322896| ~y$w_buff1~0_In-1634322896) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite17_Out-1634322896| ~y~0_In-1634322896) (or .cse1 .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1634322896, ~y~0=~y~0_In-1634322896, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1634322896, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1634322896} OutVars{ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out-1634322896|, ~y$w_buff1~0=~y$w_buff1~0_In-1634322896, ~y~0=~y~0_In-1634322896, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1634322896, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1634322896} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17] because there is no mapped edge [2019-12-27 00:13:21,201 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [621] [621] L785-4-->L786: Formula: (= v_~y~0_46 |v_ULTIMATE.start_main_#t~ite17_8|) InVars {ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_8|} OutVars{ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_7|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_8|, ~y~0=v_~y~0_46} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18, ~y~0] because there is no mapped edge [2019-12-27 00:13:21,201 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L786-->L786-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1816595481 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In1816595481 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In1816595481 |ULTIMATE.start_main_#t~ite19_Out1816595481|)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite19_Out1816595481|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1816595481, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1816595481} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1816595481, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out1816595481|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1816595481} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-27 00:13:21,202 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [641] [641] L787-->L787-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1276042046 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In1276042046 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd0~0_In1276042046 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1276042046 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite20_Out1276042046| ~y$w_buff1_used~0_In1276042046) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |ULTIMATE.start_main_#t~ite20_Out1276042046|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1276042046, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1276042046, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1276042046, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1276042046} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1276042046, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1276042046, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out1276042046|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1276042046, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1276042046} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 00:13:21,202 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [650] [650] L788-->L788-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1435266712 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In1435266712 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite21_Out1435266712| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite21_Out1435266712| ~y$r_buff0_thd0~0_In1435266712) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1435266712, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1435266712} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1435266712, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1435266712, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out1435266712|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 00:13:21,203 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [642] [642] L789-->L789-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In-1599044083 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In-1599044083 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1599044083 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-1599044083 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite22_Out-1599044083|)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~y$r_buff1_thd0~0_In-1599044083 |ULTIMATE.start_main_#t~ite22_Out-1599044083|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1599044083, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1599044083, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1599044083, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1599044083} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1599044083, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1599044083, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1599044083, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-1599044083|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1599044083} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 00:13:21,206 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L799-->L799-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In545707159 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite35_Out545707159| ~y$w_buff0_used~0_In545707159) (= |ULTIMATE.start_main_#t~ite34_In545707159| |ULTIMATE.start_main_#t~ite34_Out545707159|)) (and (= |ULTIMATE.start_main_#t~ite35_Out545707159| |ULTIMATE.start_main_#t~ite34_Out545707159|) (= |ULTIMATE.start_main_#t~ite34_Out545707159| ~y$w_buff0_used~0_In545707159) .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In545707159 256) 0))) (or (= (mod ~y$w_buff0_used~0_In545707159 256) 0) (and (= (mod ~y$w_buff1_used~0_In545707159 256) 0) .cse1) (and (= (mod ~y$r_buff1_thd0~0_In545707159 256) 0) .cse1)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In545707159, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In545707159, ~weak$$choice2~0=~weak$$choice2~0_In545707159, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In545707159, ~y$w_buff1_used~0=~y$w_buff1_used~0_In545707159, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_In545707159|} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In545707159, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In545707159, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out545707159|, ~weak$$choice2~0=~weak$$choice2~0_In545707159, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In545707159, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out545707159|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In545707159} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-27 00:13:21,207 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [597] [597] L801-->L802: Formula: (and (= v_~y$r_buff0_thd0~0_72 v_~y$r_buff0_thd0~0_71) (not (= (mod v_~weak$$choice2~0_23 256) 0))) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_72, ~weak$$choice2~0=v_~weak$$choice2~0_23} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_7|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_7|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_71, ~weak$$choice2~0=v_~weak$$choice2~0_23} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39, ~y$r_buff0_thd0~0] because there is no mapped edge [2019-12-27 00:13:21,208 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [676] [676] L804-->L4: Formula: (and (= v_~y~0_99 v_~y$mem_tmp~0_21) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10| (mod v_~main$tmp_guard1~0_10 256)) (not (= 0 (mod v_~y$flush_delayed~0_36 256))) (= 0 v_~y$flush_delayed~0_35)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_21, ~y$flush_delayed~0=v_~y$flush_delayed~0_36, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_21, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~y$flush_delayed~0=v_~y$flush_delayed~0_35, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ~y~0=v_~y~0_99, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_28|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~y$flush_delayed~0, ~y~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 00:13:21,208 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 00:13:21,292 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 12:13:21 BasicIcfg [2019-12-27 00:13:21,292 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 00:13:21,303 INFO L168 Benchmark]: Toolchain (without parser) took 25072.39 ms. Allocated memory was 136.8 MB in the beginning and 943.7 MB in the end (delta: 806.9 MB). Free memory was 100.2 MB in the beginning and 550.2 MB in the end (delta: -450.0 MB). Peak memory consumption was 356.9 MB. Max. memory is 7.1 GB. [2019-12-27 00:13:21,304 INFO L168 Benchmark]: CDTParser took 0.50 ms. Allocated memory is still 136.8 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 00:13:21,305 INFO L168 Benchmark]: CACSL2BoogieTranslator took 771.55 ms. Allocated memory was 136.8 MB in the beginning and 200.3 MB in the end (delta: 63.4 MB). Free memory was 100.0 MB in the beginning and 154.3 MB in the end (delta: -54.4 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. [2019-12-27 00:13:21,305 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.63 ms. Allocated memory is still 200.3 MB. Free memory was 154.3 MB in the beginning and 151.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 00:13:21,308 INFO L168 Benchmark]: Boogie Preprocessor took 44.65 ms. Allocated memory is still 200.3 MB. Free memory was 151.6 MB in the beginning and 149.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-27 00:13:21,309 INFO L168 Benchmark]: RCFGBuilder took 812.29 ms. Allocated memory is still 200.3 MB. Free memory was 149.5 MB in the beginning and 105.0 MB in the end (delta: 44.5 MB). Peak memory consumption was 44.5 MB. Max. memory is 7.1 GB. [2019-12-27 00:13:21,309 INFO L168 Benchmark]: TraceAbstraction took 23368.13 ms. Allocated memory was 200.3 MB in the beginning and 943.7 MB in the end (delta: 743.4 MB). Free memory was 105.0 MB in the beginning and 550.2 MB in the end (delta: -445.1 MB). Peak memory consumption was 298.3 MB. Max. memory is 7.1 GB. [2019-12-27 00:13:21,318 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.50 ms. Allocated memory is still 136.8 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 771.55 ms. Allocated memory was 136.8 MB in the beginning and 200.3 MB in the end (delta: 63.4 MB). Free memory was 100.0 MB in the beginning and 154.3 MB in the end (delta: -54.4 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 64.63 ms. Allocated memory is still 200.3 MB. Free memory was 154.3 MB in the beginning and 151.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 44.65 ms. Allocated memory is still 200.3 MB. Free memory was 151.6 MB in the beginning and 149.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 812.29 ms. Allocated memory is still 200.3 MB. Free memory was 149.5 MB in the beginning and 105.0 MB in the end (delta: 44.5 MB). Peak memory consumption was 44.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 23368.13 ms. Allocated memory was 200.3 MB in the beginning and 943.7 MB in the end (delta: 743.4 MB). Free memory was 105.0 MB in the beginning and 550.2 MB in the end (delta: -445.1 MB). Peak memory consumption was 298.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.8s, 145 ProgramPointsBefore, 78 ProgramPointsAfterwards, 179 TransitionsBefore, 90 TransitionsAfterwards, 10418 CoEnabledTransitionPairs, 7 FixpointIterations, 27 TrivialSequentialCompositions, 38 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 25 ChoiceCompositions, 3579 VarBasedMoverChecksPositive, 213 VarBasedMoverChecksNegative, 67 SemBasedMoverChecksPositive, 198 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.5s, 0 MoverChecksTotal, 46212 CheckedPairsTotal, 97 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L777] FCALL, FORK 0 pthread_create(&t2481, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L779] FCALL, FORK 0 pthread_create(&t2482, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L725] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L726] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L727] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L728] 1 y$r_buff0_thd1 = (_Bool)1 [L731] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L734] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L748] 2 x = 2 [L751] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L734] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L754] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L735] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L736] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L755] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L756] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L757] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L781] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L786] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L787] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L788] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L789] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L792] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L793] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L794] 0 y$flush_delayed = weak$$choice2 [L795] 0 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L796] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L796] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L797] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L797] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L798] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L798] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L799] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L800] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L800] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L802] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L802] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L803] 0 main$tmp_guard1 = !(x == 2 && y == 2) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 139 locations, 2 error locations. Result: UNSAFE, OverallTime: 23.1s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 9.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2451 SDtfs, 2710 SDslu, 6828 SDs, 0 SdLazy, 6229 SolverSat, 274 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 251 GetRequests, 28 SyntacticMatches, 19 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1189 ImplicationChecksByTransitivity, 3.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15905occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.3s AutomataMinimizationTime, 19 MinimizatonAttempts, 15636 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 765 NumberOfCodeBlocks, 765 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 692 ConstructedInterpolants, 0 QuantifiedInterpolants, 144382 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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...