/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix042_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 17:26:49,824 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 17:26:49,826 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 17:26:49,846 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 17:26:49,846 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 17:26:49,848 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 17:26:49,850 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 17:26:49,859 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 17:26:49,864 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 17:26:49,867 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 17:26:49,869 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 17:26:49,871 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 17:26:49,872 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 17:26:49,874 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 17:26:49,876 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 17:26:49,878 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 17:26:49,879 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 17:26:49,880 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 17:26:49,881 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 17:26:49,887 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 17:26:49,892 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 17:26:49,896 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 17:26:49,898 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 17:26:49,899 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 17:26:49,902 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 17:26:49,902 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 17:26:49,902 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 17:26:49,904 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 17:26:49,905 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 17:26:49,906 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 17:26:49,907 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 17:26:49,908 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 17:26:49,908 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 17:26:49,909 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 17:26:49,910 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 17:26:49,911 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 17:26:49,911 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 17:26:49,911 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 17:26:49,912 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 17:26:49,912 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 17:26:49,914 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 17:26:49,915 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-18 17:26:49,942 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 17:26:49,943 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 17:26:49,944 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 17:26:49,944 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 17:26:49,944 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 17:26:49,945 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 17:26:49,945 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 17:26:49,945 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 17:26:49,945 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 17:26:49,945 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 17:26:49,945 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 17:26:49,946 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 17:26:49,946 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 17:26:49,946 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 17:26:49,946 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 17:26:49,946 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 17:26:49,947 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 17:26:49,947 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 17:26:49,947 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 17:26:49,947 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 17:26:49,947 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 17:26:49,948 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 17:26:49,948 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 17:26:49,948 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 17:26:49,948 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 17:26:49,949 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 17:26:49,949 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 17:26:49,949 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 17:26:49,949 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 17:26:50,212 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 17:26:50,230 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 17:26:50,233 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 17:26:50,234 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 17:26:50,235 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 17:26:50,235 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix042_pso.opt.i [2019-12-18 17:26:50,294 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba7883b0b/24329579e28a4ab186679320866f088f/FLAGc250bd38f [2019-12-18 17:26:50,858 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 17:26:50,859 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix042_pso.opt.i [2019-12-18 17:26:50,873 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba7883b0b/24329579e28a4ab186679320866f088f/FLAGc250bd38f [2019-12-18 17:26:51,108 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba7883b0b/24329579e28a4ab186679320866f088f [2019-12-18 17:26:51,116 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 17:26:51,118 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 17:26:51,119 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 17:26:51,120 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 17:26:51,123 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 17:26:51,124 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 05:26:51" (1/1) ... [2019-12-18 17:26:51,127 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1281af7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:26:51, skipping insertion in model container [2019-12-18 17:26:51,127 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 05:26:51" (1/1) ... [2019-12-18 17:26:51,135 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 17:26:51,194 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 17:26:51,712 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 17:26:51,733 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 17:26:51,811 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 17:26:51,895 INFO L208 MainTranslator]: Completed translation [2019-12-18 17:26:51,896 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:26:51 WrapperNode [2019-12-18 17:26:51,896 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 17:26:51,897 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 17:26:51,897 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 17:26:51,897 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 17:26:51,906 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:26:51" (1/1) ... [2019-12-18 17:26:51,931 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:26:51" (1/1) ... [2019-12-18 17:26:51,966 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 17:26:51,966 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 17:26:51,967 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 17:26:51,967 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 17:26:51,975 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:26:51" (1/1) ... [2019-12-18 17:26:51,975 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:26:51" (1/1) ... [2019-12-18 17:26:51,980 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:26:51" (1/1) ... [2019-12-18 17:26:51,980 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:26:51" (1/1) ... [2019-12-18 17:26:51,990 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:26:51" (1/1) ... [2019-12-18 17:26:51,995 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:26:51" (1/1) ... [2019-12-18 17:26:51,999 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:26:51" (1/1) ... [2019-12-18 17:26:52,004 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 17:26:52,005 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 17:26:52,005 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 17:26:52,005 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 17:26:52,006 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:26:51" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 17:26:52,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 17:26:52,066 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 17:26:52,066 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 17:26:52,066 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 17:26:52,066 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 17:26:52,066 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 17:26:52,067 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 17:26:52,067 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 17:26:52,067 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 17:26:52,067 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 17:26:52,067 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 17:26:52,067 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 17:26:52,068 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 17:26:52,070 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 17:26:52,827 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 17:26:52,827 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 17:26:52,829 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 05:26:52 BoogieIcfgContainer [2019-12-18 17:26:52,829 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 17:26:52,831 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 17:26:52,832 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 17:26:52,835 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 17:26:52,836 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 05:26:51" (1/3) ... [2019-12-18 17:26:52,837 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5412f435 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 05:26:52, skipping insertion in model container [2019-12-18 17:26:52,839 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:26:51" (2/3) ... [2019-12-18 17:26:52,839 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5412f435 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 05:26:52, skipping insertion in model container [2019-12-18 17:26:52,840 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 05:26:52" (3/3) ... [2019-12-18 17:26:52,841 INFO L109 eAbstractionObserver]: Analyzing ICFG mix042_pso.opt.i [2019-12-18 17:26:52,849 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 17:26:52,850 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 17:26:52,858 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 17:26:52,859 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 17:26:52,895 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:52,895 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:52,896 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:52,896 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:52,897 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:52,897 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:52,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:52,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:52,898 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:52,898 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:52,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:52,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:52,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:52,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:52,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:52,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:52,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:52,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:52,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:52,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:52,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:52,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:52,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:52,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:52,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:52,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:52,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:52,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:52,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:52,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:52,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:52,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:52,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:52,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:52,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:52,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:52,906 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:52,907 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:52,907 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:52,907 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:52,907 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:52,907 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:52,908 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:52,908 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:52,909 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:52,909 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:52,909 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:52,909 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:52,910 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:52,910 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:52,910 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:52,910 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:52,911 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:52,911 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:52,911 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:52,911 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:52,912 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:52,912 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:52,912 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:52,912 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:52,913 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:52,913 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:52,913 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:52,913 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:52,914 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:52,914 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:52,914 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:52,914 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:52,915 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:52,915 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:52,919 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:52,919 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:52,919 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:52,920 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:52,920 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:52,920 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:52,920 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:52,921 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:52,921 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:52,921 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:52,939 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:52,940 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:52,940 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:52,940 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:52,940 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:52,940 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:52,941 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:52,941 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:52,941 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:52,941 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:52,941 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:52,942 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:52,944 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:52,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:52,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:52,944 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:52,959 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 17:26:52,980 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 17:26:52,980 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 17:26:52,981 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 17:26:52,981 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 17:26:52,981 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 17:26:52,981 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 17:26:52,981 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 17:26:52,981 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 17:26:53,009 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 165 places, 196 transitions [2019-12-18 17:26:53,011 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 165 places, 196 transitions [2019-12-18 17:26:53,112 INFO L126 PetriNetUnfolder]: 41/193 cut-off events. [2019-12-18 17:26:53,113 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 17:26:53,134 INFO L76 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 193 events. 41/193 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 265 event pairs. 9/159 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 17:26:53,155 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 165 places, 196 transitions [2019-12-18 17:26:53,239 INFO L126 PetriNetUnfolder]: 41/193 cut-off events. [2019-12-18 17:26:53,240 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 17:26:53,249 INFO L76 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 193 events. 41/193 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 265 event pairs. 9/159 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 17:26:53,268 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11490 [2019-12-18 17:26:53,269 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 17:26:58,301 WARN L192 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-18 17:26:58,446 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-18 17:26:58,467 INFO L206 etLargeBlockEncoding]: Checked pairs total: 50142 [2019-12-18 17:26:58,468 INFO L214 etLargeBlockEncoding]: Total number of compositions: 117 [2019-12-18 17:26:58,472 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 79 places, 86 transitions [2019-12-18 17:26:59,304 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 14254 states. [2019-12-18 17:26:59,306 INFO L276 IsEmpty]: Start isEmpty. Operand 14254 states. [2019-12-18 17:26:59,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-18 17:26:59,311 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:26:59,312 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:26:59,312 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:26:59,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:26:59,317 INFO L82 PathProgramCache]: Analyzing trace with hash -632784469, now seen corresponding path program 1 times [2019-12-18 17:26:59,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:26:59,325 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902205862] [2019-12-18 17:26:59,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:26:59,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:26:59,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:26:59,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902205862] [2019-12-18 17:26:59,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:26:59,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 17:26:59,551 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235499268] [2019-12-18 17:26:59,556 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:26:59,556 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:26:59,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:26:59,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:26:59,574 INFO L87 Difference]: Start difference. First operand 14254 states. Second operand 3 states. [2019-12-18 17:26:59,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:26:59,948 INFO L93 Difference]: Finished difference Result 14182 states and 53160 transitions. [2019-12-18 17:26:59,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:26:59,951 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-18 17:26:59,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:27:00,138 INFO L225 Difference]: With dead ends: 14182 [2019-12-18 17:27:00,139 INFO L226 Difference]: Without dead ends: 13870 [2019-12-18 17:27:00,140 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:27:00,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13870 states. [2019-12-18 17:27:00,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13870 to 13870. [2019-12-18 17:27:00,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13870 states. [2019-12-18 17:27:00,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13870 states to 13870 states and 52042 transitions. [2019-12-18 17:27:00,974 INFO L78 Accepts]: Start accepts. Automaton has 13870 states and 52042 transitions. Word has length 7 [2019-12-18 17:27:00,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:27:00,975 INFO L462 AbstractCegarLoop]: Abstraction has 13870 states and 52042 transitions. [2019-12-18 17:27:00,975 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:27:00,975 INFO L276 IsEmpty]: Start isEmpty. Operand 13870 states and 52042 transitions. [2019-12-18 17:27:00,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 17:27:00,986 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:27:00,986 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:27:00,987 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:27:00,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:27:00,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1056225825, now seen corresponding path program 1 times [2019-12-18 17:27:00,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:27:00,988 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173518273] [2019-12-18 17:27:00,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:27:01,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:27:01,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:27:01,806 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173518273] [2019-12-18 17:27:01,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:27:01,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:27:01,807 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368289944] [2019-12-18 17:27:01,809 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:27:01,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:27:01,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:27:01,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:27:01,810 INFO L87 Difference]: Start difference. First operand 13870 states and 52042 transitions. Second operand 4 states. [2019-12-18 17:27:02,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:27:02,320 INFO L93 Difference]: Finished difference Result 19034 states and 69248 transitions. [2019-12-18 17:27:02,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:27:02,321 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 17:27:02,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:27:02,429 INFO L225 Difference]: With dead ends: 19034 [2019-12-18 17:27:02,430 INFO L226 Difference]: Without dead ends: 19034 [2019-12-18 17:27:02,435 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:27:02,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19034 states. [2019-12-18 17:27:03,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19034 to 18800. [2019-12-18 17:27:03,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18800 states. [2019-12-18 17:27:03,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18800 states to 18800 states and 68487 transitions. [2019-12-18 17:27:03,335 INFO L78 Accepts]: Start accepts. Automaton has 18800 states and 68487 transitions. Word has length 13 [2019-12-18 17:27:03,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:27:03,336 INFO L462 AbstractCegarLoop]: Abstraction has 18800 states and 68487 transitions. [2019-12-18 17:27:03,336 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:27:03,336 INFO L276 IsEmpty]: Start isEmpty. Operand 18800 states and 68487 transitions. [2019-12-18 17:27:03,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 17:27:03,338 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:27:03,339 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:27:03,339 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:27:03,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:27:03,339 INFO L82 PathProgramCache]: Analyzing trace with hash 746093816, now seen corresponding path program 1 times [2019-12-18 17:27:03,340 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:27:03,340 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551430179] [2019-12-18 17:27:03,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:27:03,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:27:03,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:27:03,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551430179] [2019-12-18 17:27:03,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:27:03,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:27:03,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884572199] [2019-12-18 17:27:03,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:27:03,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:27:03,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:27:03,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:27:03,482 INFO L87 Difference]: Start difference. First operand 18800 states and 68487 transitions. Second operand 4 states. [2019-12-18 17:27:03,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:27:03,869 INFO L93 Difference]: Finished difference Result 27022 states and 96312 transitions. [2019-12-18 17:27:03,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:27:03,870 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 17:27:03,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:27:04,205 INFO L225 Difference]: With dead ends: 27022 [2019-12-18 17:27:04,206 INFO L226 Difference]: Without dead ends: 27008 [2019-12-18 17:27:04,206 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:27:04,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27008 states. [2019-12-18 17:27:04,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27008 to 22366. [2019-12-18 17:27:04,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22366 states. [2019-12-18 17:27:06,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22366 states to 22366 states and 80994 transitions. [2019-12-18 17:27:06,224 INFO L78 Accepts]: Start accepts. Automaton has 22366 states and 80994 transitions. Word has length 13 [2019-12-18 17:27:06,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:27:06,227 INFO L462 AbstractCegarLoop]: Abstraction has 22366 states and 80994 transitions. [2019-12-18 17:27:06,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:27:06,230 INFO L276 IsEmpty]: Start isEmpty. Operand 22366 states and 80994 transitions. [2019-12-18 17:27:06,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 17:27:06,240 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:27:06,241 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:27:06,241 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:27:06,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:27:06,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1347005908, now seen corresponding path program 1 times [2019-12-18 17:27:06,242 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:27:06,242 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373089468] [2019-12-18 17:27:06,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:27:06,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:27:06,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:27:06,341 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373089468] [2019-12-18 17:27:06,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:27:06,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:27:06,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437390516] [2019-12-18 17:27:06,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:27:06,342 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:27:06,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:27:06,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:27:06,343 INFO L87 Difference]: Start difference. First operand 22366 states and 80994 transitions. Second operand 5 states. [2019-12-18 17:27:06,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:27:06,909 INFO L93 Difference]: Finished difference Result 30132 states and 106959 transitions. [2019-12-18 17:27:06,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 17:27:06,909 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-18 17:27:06,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:27:06,985 INFO L225 Difference]: With dead ends: 30132 [2019-12-18 17:27:06,985 INFO L226 Difference]: Without dead ends: 30118 [2019-12-18 17:27:06,986 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 17:27:07,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30118 states. [2019-12-18 17:27:07,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30118 to 22270. [2019-12-18 17:27:07,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22270 states. [2019-12-18 17:27:07,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22270 states to 22270 states and 80486 transitions. [2019-12-18 17:27:07,965 INFO L78 Accepts]: Start accepts. Automaton has 22270 states and 80486 transitions. Word has length 19 [2019-12-18 17:27:07,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:27:07,965 INFO L462 AbstractCegarLoop]: Abstraction has 22270 states and 80486 transitions. [2019-12-18 17:27:07,965 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:27:07,965 INFO L276 IsEmpty]: Start isEmpty. Operand 22270 states and 80486 transitions. [2019-12-18 17:27:08,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 17:27:08,002 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:27:08,002 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:27:08,003 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:27:08,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:27:08,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1614023153, now seen corresponding path program 1 times [2019-12-18 17:27:08,004 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:27:08,004 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882216909] [2019-12-18 17:27:08,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:27:08,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:27:08,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:27:08,091 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882216909] [2019-12-18 17:27:08,091 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:27:08,091 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:27:08,092 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628887768] [2019-12-18 17:27:08,092 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:27:08,092 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:27:08,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:27:08,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:27:08,093 INFO L87 Difference]: Start difference. First operand 22270 states and 80486 transitions. Second operand 4 states. [2019-12-18 17:27:08,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:27:08,208 INFO L93 Difference]: Finished difference Result 13342 states and 41523 transitions. [2019-12-18 17:27:08,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 17:27:08,209 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-12-18 17:27:08,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:27:08,239 INFO L225 Difference]: With dead ends: 13342 [2019-12-18 17:27:08,240 INFO L226 Difference]: Without dead ends: 12812 [2019-12-18 17:27:08,240 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:27:08,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12812 states. [2019-12-18 17:27:08,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12812 to 12812. [2019-12-18 17:27:08,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12812 states. [2019-12-18 17:27:08,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12812 states to 12812 states and 40017 transitions. [2019-12-18 17:27:08,547 INFO L78 Accepts]: Start accepts. Automaton has 12812 states and 40017 transitions. Word has length 27 [2019-12-18 17:27:08,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:27:08,547 INFO L462 AbstractCegarLoop]: Abstraction has 12812 states and 40017 transitions. [2019-12-18 17:27:08,547 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:27:08,548 INFO L276 IsEmpty]: Start isEmpty. Operand 12812 states and 40017 transitions. [2019-12-18 17:27:08,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 17:27:08,561 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:27:08,561 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:27:08,561 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:27:08,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:27:08,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1806206056, now seen corresponding path program 1 times [2019-12-18 17:27:08,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:27:08,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923682795] [2019-12-18 17:27:08,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:27:08,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:27:08,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:27:08,643 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923682795] [2019-12-18 17:27:08,643 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:27:08,643 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 17:27:08,643 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260145361] [2019-12-18 17:27:08,644 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:27:08,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:27:08,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:27:08,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:27:08,645 INFO L87 Difference]: Start difference. First operand 12812 states and 40017 transitions. Second operand 5 states. [2019-12-18 17:27:08,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:27:08,845 INFO L93 Difference]: Finished difference Result 2336 states and 5507 transitions. [2019-12-18 17:27:08,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:27:08,845 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-18 17:27:08,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:27:08,851 INFO L225 Difference]: With dead ends: 2336 [2019-12-18 17:27:08,851 INFO L226 Difference]: Without dead ends: 2027 [2019-12-18 17:27:08,852 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-18 17:27:08,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2027 states. [2019-12-18 17:27:08,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2027 to 2027. [2019-12-18 17:27:08,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2027 states. [2019-12-18 17:27:08,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2027 states to 2027 states and 4646 transitions. [2019-12-18 17:27:08,889 INFO L78 Accepts]: Start accepts. Automaton has 2027 states and 4646 transitions. Word has length 28 [2019-12-18 17:27:08,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:27:08,890 INFO L462 AbstractCegarLoop]: Abstraction has 2027 states and 4646 transitions. [2019-12-18 17:27:08,890 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:27:08,890 INFO L276 IsEmpty]: Start isEmpty. Operand 2027 states and 4646 transitions. [2019-12-18 17:27:08,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 17:27:08,893 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:27:08,894 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:27:08,894 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:27:08,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:27:08,894 INFO L82 PathProgramCache]: Analyzing trace with hash -1654876811, now seen corresponding path program 1 times [2019-12-18 17:27:08,895 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:27:08,896 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257262301] [2019-12-18 17:27:08,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:27:08,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:27:09,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:27:09,054 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257262301] [2019-12-18 17:27:09,054 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:27:09,054 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 17:27:09,055 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558056538] [2019-12-18 17:27:09,055 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:27:09,055 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:27:09,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:27:09,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:27:09,056 INFO L87 Difference]: Start difference. First operand 2027 states and 4646 transitions. Second operand 6 states. [2019-12-18 17:27:09,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:27:09,124 INFO L93 Difference]: Finished difference Result 690 states and 1578 transitions. [2019-12-18 17:27:09,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 17:27:09,125 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-18 17:27:09,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:27:09,126 INFO L225 Difference]: With dead ends: 690 [2019-12-18 17:27:09,127 INFO L226 Difference]: Without dead ends: 644 [2019-12-18 17:27:09,127 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-18 17:27:09,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2019-12-18 17:27:09,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 588. [2019-12-18 17:27:09,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2019-12-18 17:27:09,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 1356 transitions. [2019-12-18 17:27:09,138 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 1356 transitions. Word has length 40 [2019-12-18 17:27:09,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:27:09,139 INFO L462 AbstractCegarLoop]: Abstraction has 588 states and 1356 transitions. [2019-12-18 17:27:09,139 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:27:09,139 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 1356 transitions. [2019-12-18 17:27:09,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 17:27:09,141 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:27:09,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:27:09,142 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:27:09,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:27:09,142 INFO L82 PathProgramCache]: Analyzing trace with hash 149828223, now seen corresponding path program 1 times [2019-12-18 17:27:09,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:27:09,142 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702768904] [2019-12-18 17:27:09,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:27:09,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:27:09,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:27:09,203 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702768904] [2019-12-18 17:27:09,204 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:27:09,204 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:27:09,204 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468062688] [2019-12-18 17:27:09,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:27:09,205 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:27:09,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:27:09,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:27:09,206 INFO L87 Difference]: Start difference. First operand 588 states and 1356 transitions. Second operand 3 states. [2019-12-18 17:27:09,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:27:09,265 INFO L93 Difference]: Finished difference Result 602 states and 1375 transitions. [2019-12-18 17:27:09,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:27:09,266 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-18 17:27:09,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:27:09,267 INFO L225 Difference]: With dead ends: 602 [2019-12-18 17:27:09,267 INFO L226 Difference]: Without dead ends: 602 [2019-12-18 17:27:09,268 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:27:09,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2019-12-18 17:27:09,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 596. [2019-12-18 17:27:09,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2019-12-18 17:27:09,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 1368 transitions. [2019-12-18 17:27:09,279 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 1368 transitions. Word has length 55 [2019-12-18 17:27:09,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:27:09,280 INFO L462 AbstractCegarLoop]: Abstraction has 596 states and 1368 transitions. [2019-12-18 17:27:09,280 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:27:09,280 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 1368 transitions. [2019-12-18 17:27:09,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 17:27:09,282 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:27:09,282 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:27:09,282 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:27:09,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:27:09,283 INFO L82 PathProgramCache]: Analyzing trace with hash 1719525699, now seen corresponding path program 1 times [2019-12-18 17:27:09,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:27:09,283 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140248412] [2019-12-18 17:27:09,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:27:09,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:27:09,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:27:09,372 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140248412] [2019-12-18 17:27:09,372 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:27:09,372 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 17:27:09,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167256173] [2019-12-18 17:27:09,373 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:27:09,373 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:27:09,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:27:09,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:27:09,374 INFO L87 Difference]: Start difference. First operand 596 states and 1368 transitions. Second operand 5 states. [2019-12-18 17:27:09,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:27:09,576 INFO L93 Difference]: Finished difference Result 867 states and 1997 transitions. [2019-12-18 17:27:09,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 17:27:09,576 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-12-18 17:27:09,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:27:09,578 INFO L225 Difference]: With dead ends: 867 [2019-12-18 17:27:09,578 INFO L226 Difference]: Without dead ends: 867 [2019-12-18 17:27:09,578 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:27:09,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2019-12-18 17:27:09,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 789. [2019-12-18 17:27:09,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2019-12-18 17:27:09,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1820 transitions. [2019-12-18 17:27:09,589 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1820 transitions. Word has length 55 [2019-12-18 17:27:09,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:27:09,590 INFO L462 AbstractCegarLoop]: Abstraction has 789 states and 1820 transitions. [2019-12-18 17:27:09,590 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:27:09,590 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1820 transitions. [2019-12-18 17:27:09,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 17:27:09,592 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:27:09,592 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:27:09,592 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:27:09,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:27:09,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1740404695, now seen corresponding path program 2 times [2019-12-18 17:27:09,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:27:09,593 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661369363] [2019-12-18 17:27:09,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:27:09,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:27:09,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:27:09,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661369363] [2019-12-18 17:27:09,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:27:09,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:27:09,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444295716] [2019-12-18 17:27:09,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:27:09,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:27:09,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:27:09,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:27:09,666 INFO L87 Difference]: Start difference. First operand 789 states and 1820 transitions. Second operand 3 states. [2019-12-18 17:27:09,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:27:09,706 INFO L93 Difference]: Finished difference Result 789 states and 1819 transitions. [2019-12-18 17:27:09,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:27:09,706 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-18 17:27:09,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:27:09,707 INFO L225 Difference]: With dead ends: 789 [2019-12-18 17:27:09,707 INFO L226 Difference]: Without dead ends: 789 [2019-12-18 17:27:09,708 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:27:09,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2019-12-18 17:27:09,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 632. [2019-12-18 17:27:09,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 632 states. [2019-12-18 17:27:09,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 1459 transitions. [2019-12-18 17:27:09,718 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 1459 transitions. Word has length 55 [2019-12-18 17:27:09,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:27:09,718 INFO L462 AbstractCegarLoop]: Abstraction has 632 states and 1459 transitions. [2019-12-18 17:27:09,718 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:27:09,719 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 1459 transitions. [2019-12-18 17:27:09,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 17:27:09,720 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:27:09,720 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:27:09,721 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:27:09,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:27:09,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1993080434, now seen corresponding path program 1 times [2019-12-18 17:27:09,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:27:09,723 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780943947] [2019-12-18 17:27:09,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:27:09,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:27:09,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:27:09,842 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780943947] [2019-12-18 17:27:09,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:27:09,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:27:09,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670727606] [2019-12-18 17:27:09,843 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:27:09,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:27:09,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:27:09,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:27:09,844 INFO L87 Difference]: Start difference. First operand 632 states and 1459 transitions. Second operand 3 states. [2019-12-18 17:27:09,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:27:09,859 INFO L93 Difference]: Finished difference Result 632 states and 1429 transitions. [2019-12-18 17:27:09,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:27:09,859 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-12-18 17:27:09,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:27:09,860 INFO L225 Difference]: With dead ends: 632 [2019-12-18 17:27:09,860 INFO L226 Difference]: Without dead ends: 632 [2019-12-18 17:27:09,861 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:27:09,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2019-12-18 17:27:09,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 596. [2019-12-18 17:27:09,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2019-12-18 17:27:09,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 1343 transitions. [2019-12-18 17:27:09,869 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 1343 transitions. Word has length 56 [2019-12-18 17:27:09,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:27:09,870 INFO L462 AbstractCegarLoop]: Abstraction has 596 states and 1343 transitions. [2019-12-18 17:27:09,870 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:27:09,870 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 1343 transitions. [2019-12-18 17:27:09,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 17:27:09,871 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:27:09,871 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:27:09,872 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:27:09,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:27:09,872 INFO L82 PathProgramCache]: Analyzing trace with hash 2052620165, now seen corresponding path program 1 times [2019-12-18 17:27:09,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:27:09,872 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986648258] [2019-12-18 17:27:09,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:27:09,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:27:10,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:27:10,196 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986648258] [2019-12-18 17:27:10,196 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:27:10,196 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 17:27:10,196 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039449903] [2019-12-18 17:27:10,197 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 17:27:10,197 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:27:10,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 17:27:10,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-12-18 17:27:10,198 INFO L87 Difference]: Start difference. First operand 596 states and 1343 transitions. Second operand 12 states. [2019-12-18 17:27:10,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:27:10,887 INFO L93 Difference]: Finished difference Result 1200 states and 2407 transitions. [2019-12-18 17:27:10,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 17:27:10,887 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 57 [2019-12-18 17:27:10,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:27:10,889 INFO L225 Difference]: With dead ends: 1200 [2019-12-18 17:27:10,889 INFO L226 Difference]: Without dead ends: 600 [2019-12-18 17:27:10,889 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=173, Invalid=427, Unknown=0, NotChecked=0, Total=600 [2019-12-18 17:27:10,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2019-12-18 17:27:10,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 534. [2019-12-18 17:27:10,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 534 states. [2019-12-18 17:27:10,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 1164 transitions. [2019-12-18 17:27:10,897 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 1164 transitions. Word has length 57 [2019-12-18 17:27:10,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:27:10,898 INFO L462 AbstractCegarLoop]: Abstraction has 534 states and 1164 transitions. [2019-12-18 17:27:10,898 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 17:27:10,898 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 1164 transitions. [2019-12-18 17:27:10,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 17:27:10,899 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:27:10,899 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:27:10,900 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:27:10,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:27:10,900 INFO L82 PathProgramCache]: Analyzing trace with hash -892812541, now seen corresponding path program 2 times [2019-12-18 17:27:10,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:27:10,901 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131680270] [2019-12-18 17:27:10,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:27:10,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:27:11,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:27:11,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131680270] [2019-12-18 17:27:11,460 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:27:11,460 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-18 17:27:11,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980675178] [2019-12-18 17:27:11,461 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-18 17:27:11,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:27:11,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-18 17:27:11,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2019-12-18 17:27:11,462 INFO L87 Difference]: Start difference. First operand 534 states and 1164 transitions. Second operand 18 states. [2019-12-18 17:27:12,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:27:12,941 INFO L93 Difference]: Finished difference Result 1295 states and 2888 transitions. [2019-12-18 17:27:12,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 17:27:12,942 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 57 [2019-12-18 17:27:12,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:27:12,945 INFO L225 Difference]: With dead ends: 1295 [2019-12-18 17:27:12,945 INFO L226 Difference]: Without dead ends: 1265 [2019-12-18 17:27:12,946 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=209, Invalid=1051, Unknown=0, NotChecked=0, Total=1260 [2019-12-18 17:27:12,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1265 states. [2019-12-18 17:27:12,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1265 to 716. [2019-12-18 17:27:12,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 716 states. [2019-12-18 17:27:12,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 1564 transitions. [2019-12-18 17:27:12,966 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 1564 transitions. Word has length 57 [2019-12-18 17:27:12,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:27:12,966 INFO L462 AbstractCegarLoop]: Abstraction has 716 states and 1564 transitions. [2019-12-18 17:27:12,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-18 17:27:12,966 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 1564 transitions. [2019-12-18 17:27:12,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 17:27:12,968 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:27:12,968 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:27:12,968 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:27:12,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:27:12,969 INFO L82 PathProgramCache]: Analyzing trace with hash -495942269, now seen corresponding path program 3 times [2019-12-18 17:27:12,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:27:12,971 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205745157] [2019-12-18 17:27:12,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:27:13,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:27:13,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:27:13,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205745157] [2019-12-18 17:27:13,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:27:13,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 17:27:13,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687388695] [2019-12-18 17:27:13,379 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 17:27:13,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:27:13,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 17:27:13,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2019-12-18 17:27:13,380 INFO L87 Difference]: Start difference. First operand 716 states and 1564 transitions. Second operand 15 states. [2019-12-18 17:27:14,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:27:14,211 INFO L93 Difference]: Finished difference Result 1418 states and 3102 transitions. [2019-12-18 17:27:14,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 17:27:14,212 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 57 [2019-12-18 17:27:14,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:27:14,214 INFO L225 Difference]: With dead ends: 1418 [2019-12-18 17:27:14,214 INFO L226 Difference]: Without dead ends: 1388 [2019-12-18 17:27:14,215 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=147, Invalid=609, Unknown=0, NotChecked=0, Total=756 [2019-12-18 17:27:14,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1388 states. [2019-12-18 17:27:14,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1388 to 776. [2019-12-18 17:27:14,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2019-12-18 17:27:14,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1710 transitions. [2019-12-18 17:27:14,226 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1710 transitions. Word has length 57 [2019-12-18 17:27:14,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:27:14,226 INFO L462 AbstractCegarLoop]: Abstraction has 776 states and 1710 transitions. [2019-12-18 17:27:14,226 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 17:27:14,226 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1710 transitions. [2019-12-18 17:27:14,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 17:27:14,234 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:27:14,234 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:27:14,235 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:27:14,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:27:14,235 INFO L82 PathProgramCache]: Analyzing trace with hash 729108355, now seen corresponding path program 4 times [2019-12-18 17:27:14,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:27:14,235 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5781172] [2019-12-18 17:27:14,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:27:14,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 17:27:14,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 17:27:14,348 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 17:27:14,348 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 17:27:14,352 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] ULTIMATE.startENTRY-->L812: Formula: (let ((.cse0 (store |v_#valid_56| 0 0))) (and (= v_~y$w_buff0_used~0_565 0) (= v_~y$w_buff1_used~0_304 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1114~0.base_27|) (= v_~main$tmp_guard0~0_30 0) (= v_~y$r_buff0_thd0~0_292 0) (= 0 v_~weak$$choice2~0_82) (= 0 v_~y$read_delayed_var~0.offset_8) (= (select .cse0 |v_ULTIMATE.start_main_~#t1114~0.base_27|) 0) (= 0 v_~__unbuffered_cnt~0_94) (= 0 v_~y$r_buff1_thd3~0_89) (= v_~y$read_delayed~0_8 0) (= 0 v_~y$r_buff1_thd2~0_113) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1114~0.base_27| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1114~0.base_27|) |v_ULTIMATE.start_main_~#t1114~0.offset_21| 0)) |v_#memory_int_15|) (= v_~main$tmp_guard1~0_30 0) (= v_~x~0_51 0) (= v_~y$w_buff1~0_136 0) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1114~0.base_27| 4)) (= 0 v_~y$r_buff0_thd2~0_108) (< 0 |v_#StackHeapBarrier_14|) (= v_~y$r_buff0_thd1~0_41 0) (= 0 |v_ULTIMATE.start_main_~#t1114~0.offset_21|) (= v_~a~0_57 0) (= v_~y$mem_tmp~0_17 0) (= v_~z~0_41 0) (= 0 v_~y$r_buff1_thd1~0_40) (= v_~__unbuffered_p2_EBX~0_54 0) (= |v_#valid_54| (store .cse0 |v_ULTIMATE.start_main_~#t1114~0.base_27| 1)) (= v_~y~0_123 0) (= v_~y$r_buff1_thd0~0_196 0) (= |v_#NULL.offset_5| 0) (= 0 v_~y$r_buff0_thd3~0_130) (= 0 v_~y$read_delayed_var~0.base_8) (= 0 v_~__unbuffered_p2_EAX~0_54) (= 0 v_~__unbuffered_p0_EAX~0_39) (= 0 v_~weak$$choice0~0_13) (= 0 |v_#NULL.base_5|) (= 0 v_~y$flush_delayed~0_34) (= 0 v_~y$w_buff0~0_162))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_16|, #length=|v_#length_20|} OutVars{ULTIMATE.start_main_~#t1114~0.offset=|v_ULTIMATE.start_main_~#t1114~0.offset_21|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_28|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_35|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_29|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_51|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_35|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_50|, ~y$read_delayed~0=v_~y$read_delayed~0_8, ~a~0=v_~a~0_57, ~y$mem_tmp~0=v_~y$mem_tmp~0_17, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_39, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_89, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_41, ~y$flush_delayed~0=v_~y$flush_delayed~0_34, #length=|v_#length_19|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_54, ULTIMATE.start_main_~#t1115~0.base=|v_ULTIMATE.start_main_~#t1115~0.base_26|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_54, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_29|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_30|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_17|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_116|, ULTIMATE.start_main_~#t1116~0.offset=|v_ULTIMATE.start_main_~#t1116~0.offset_16|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_33|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_32|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_25|, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_26|, ~y$w_buff1~0=v_~y$w_buff1~0_136, ULTIMATE.start_main_~#t1116~0.base=|v_ULTIMATE.start_main_~#t1116~0.base_21|, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_8, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_108, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_10|, ULTIMATE.start_main_~#t1115~0.offset=|v_ULTIMATE.start_main_~#t1115~0.offset_20|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_20|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_94, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_196, ~x~0=v_~x~0_51, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_8, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_565, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_34|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_36|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_30, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_49|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_31|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_27|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_27|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_42|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_40, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_28|, ~y$w_buff0~0=v_~y$w_buff0~0_162, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_130, ~y~0=v_~y~0_123, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_32|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_17|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_196|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_28|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_34|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_110|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_113, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_26|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_292, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t1114~0.base=|v_ULTIMATE.start_main_~#t1114~0.base_27|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_10|, ~z~0=v_~z~0_41, ~weak$$choice2~0=v_~weak$$choice2~0_82, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_304} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1114~0.offset, 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, ~a~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t1115~0.base, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_~#t1116~0.offset, 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, ULTIMATE.start_main_~#t1116~0.base, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_~#t1115~0.offset, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite30, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, 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_~#t1114~0.base, ULTIMATE.start_main_#t~nondet16, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 17:27:14,353 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L812-1-->L814: Formula: (and (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1115~0.base_9| 4)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1115~0.base_9|) (= |v_ULTIMATE.start_main_~#t1115~0.offset_8| 0) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1115~0.base_9|) 0) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1115~0.base_9| 1)) (not (= |v_ULTIMATE.start_main_~#t1115~0.base_9| 0)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1115~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1115~0.base_9|) |v_ULTIMATE.start_main_~#t1115~0.offset_8| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_4|, ULTIMATE.start_main_~#t1115~0.offset=|v_ULTIMATE.start_main_~#t1115~0.offset_8|, #length=|v_#length_13|, ULTIMATE.start_main_~#t1115~0.base=|v_ULTIMATE.start_main_~#t1115~0.base_9|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_~#t1115~0.offset, #length, ULTIMATE.start_main_~#t1115~0.base] because there is no mapped edge [2019-12-18 17:27:14,353 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L814-1-->L816: Formula: (and (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1116~0.base_10|) (= 0 (select |v_#valid_30| |v_ULTIMATE.start_main_~#t1116~0.base_10|)) (= |v_ULTIMATE.start_main_~#t1116~0.offset_10| 0) (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t1116~0.base_10| 1)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1116~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1116~0.base_10|) |v_ULTIMATE.start_main_~#t1116~0.offset_10| 2)) |v_#memory_int_11|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1116~0.base_10| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t1116~0.base_10|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t1116~0.base=|v_ULTIMATE.start_main_~#t1116~0.base_10|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t1116~0.offset=|v_ULTIMATE.start_main_~#t1116~0.offset_10|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1116~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t1116~0.offset, ULTIMATE.start_main_#t~nondet16, #length] because there is no mapped edge [2019-12-18 17:27:14,355 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L4-->L789: Formula: (and (= ~__unbuffered_p2_EAX~0_Out647069897 ~z~0_Out647069897) (= ~y$r_buff0_thd0~0_In647069897 ~y$r_buff1_thd0~0_Out647069897) (= ~y$r_buff0_thd1~0_In647069897 ~y$r_buff1_thd1~0_Out647069897) (= ~y$r_buff0_thd2~0_In647069897 ~y$r_buff1_thd2~0_Out647069897) (= ~__unbuffered_p2_EBX~0_Out647069897 ~a~0_In647069897) (= ~y$r_buff0_thd3~0_In647069897 ~y$r_buff1_thd3~0_Out647069897) (= 1 ~z~0_Out647069897) (not (= P2Thread1of1ForFork1___VERIFIER_assert_~expression_In647069897 0)) (= ~y$r_buff0_thd3~0_Out647069897 1)) InVars {~a~0=~a~0_In647069897, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In647069897, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In647069897, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In647069897, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In647069897, P2Thread1of1ForFork1___VERIFIER_assert_~expression=P2Thread1of1ForFork1___VERIFIER_assert_~expression_In647069897} OutVars{~__unbuffered_p2_EBX~0=~__unbuffered_p2_EBX~0_Out647069897, P2Thread1of1ForFork1___VERIFIER_assert_~expression=P2Thread1of1ForFork1___VERIFIER_assert_~expression_In647069897, ~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out647069897, ~a~0=~a~0_In647069897, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out647069897, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_Out647069897, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out647069897, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In647069897, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In647069897, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In647069897, ~__unbuffered_p2_EAX~0=~__unbuffered_p2_EAX~0_Out647069897, ~z~0=~z~0_Out647069897, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out647069897} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p2_EBX~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-18 17:27:14,355 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] P0ENTRY-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#res.offset_5| 0) (= 0 |v_P0Thread1of1ForFork2_#res.base_5|) (= v_P0Thread1of1ForFork2_~arg.base_10 |v_P0Thread1of1ForFork2_#in~arg.base_10|) (= |v_P0Thread1of1ForFork2_#in~arg.offset_10| v_P0Thread1of1ForFork2_~arg.offset_10) (= v_~a~0_22 1) (= v_~x~0_29 v_~__unbuffered_p0_EAX~0_17) (= (+ v_~__unbuffered_cnt~0_41 1) v_~__unbuffered_cnt~0_40)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_41, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_10|, ~x~0=v_~x~0_29} OutVars{~a~0=v_~a~0_22, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_17, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_10|, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_10, P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_10|, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_5|, ~x~0=v_~x~0_29, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_10} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork2_~arg.offset, P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base, P0Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-12-18 17:27:14,357 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L754-2-->L754-5: Formula: (let ((.cse1 (= |P1Thread1of1ForFork0_#t~ite4_Out-116810035| |P1Thread1of1ForFork0_#t~ite3_Out-116810035|)) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In-116810035 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-116810035 256)))) (or (and (= ~y$w_buff1~0_In-116810035 |P1Thread1of1ForFork0_#t~ite3_Out-116810035|) (not .cse0) .cse1 (not .cse2)) (and (= |P1Thread1of1ForFork0_#t~ite3_Out-116810035| ~y~0_In-116810035) .cse1 (or .cse2 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-116810035, ~y$w_buff1~0=~y$w_buff1~0_In-116810035, ~y~0=~y~0_In-116810035, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-116810035} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-116810035, ~y$w_buff1~0=~y$w_buff1~0_In-116810035, P1Thread1of1ForFork0_#t~ite3=|P1Thread1of1ForFork0_#t~ite3_Out-116810035|, ~y~0=~y~0_In-116810035, P1Thread1of1ForFork0_#t~ite4=|P1Thread1of1ForFork0_#t~ite4_Out-116810035|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-116810035} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite3, P1Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-18 17:27:14,358 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L790-->L790-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In1129516232 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1129516232 256)))) (or (and (= ~y$w_buff0_used~0_In1129516232 |P2Thread1of1ForFork1_#t~ite11_Out1129516232|) (or .cse0 .cse1)) (and (= 0 |P2Thread1of1ForFork1_#t~ite11_Out1129516232|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1129516232, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1129516232} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1129516232, P2Thread1of1ForFork1_#t~ite11=|P2Thread1of1ForFork1_#t~ite11_Out1129516232|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1129516232} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-18 17:27:14,359 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L791-->L791-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In-2070134712 256))) (.cse0 (= (mod ~y$r_buff1_thd3~0_In-2070134712 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-2070134712 256))) (.cse2 (= (mod ~y$r_buff0_thd3~0_In-2070134712 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite12_Out-2070134712| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$w_buff1_used~0_In-2070134712 |P2Thread1of1ForFork1_#t~ite12_Out-2070134712|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-2070134712, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2070134712, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2070134712, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2070134712} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-2070134712, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2070134712, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2070134712, P2Thread1of1ForFork1_#t~ite12=|P2Thread1of1ForFork1_#t~ite12_Out-2070134712|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2070134712} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 17:27:14,360 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L792-->L793: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In-1515598709 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1515598709 256)))) (or (and (= 0 ~y$r_buff0_thd3~0_Out-1515598709) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd3~0_In-1515598709 ~y$r_buff0_thd3~0_Out-1515598709)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1515598709, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1515598709} OutVars{P2Thread1of1ForFork1_#t~ite13=|P2Thread1of1ForFork1_#t~ite13_Out-1515598709|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1515598709, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-1515598709} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite13, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-18 17:27:14,360 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L793-->L793-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In930712794 256))) (.cse1 (= (mod ~y$r_buff1_thd3~0_In930712794 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd3~0_In930712794 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In930712794 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite14_Out930712794| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |P2Thread1of1ForFork1_#t~ite14_Out930712794| ~y$r_buff1_thd3~0_In930712794)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In930712794, ~y$w_buff0_used~0=~y$w_buff0_used~0_In930712794, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In930712794, ~y$w_buff1_used~0=~y$w_buff1_used~0_In930712794} OutVars{P2Thread1of1ForFork1_#t~ite14=|P2Thread1of1ForFork1_#t~ite14_Out930712794|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In930712794, ~y$w_buff0_used~0=~y$w_buff0_used~0_In930712794, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In930712794, ~y$w_buff1_used~0=~y$w_buff1_used~0_In930712794} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 17:27:14,360 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L793-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork1_#t~ite14_36| v_~y$r_buff1_thd3~0_55) (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_59 1) v_~__unbuffered_cnt~0_58) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|)) InVars {P2Thread1of1ForFork1_#t~ite14=|v_P2Thread1of1ForFork1_#t~ite14_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59} OutVars{P2Thread1of1ForFork1_#t~ite14=|v_P2Thread1of1ForFork1_#t~ite14_35|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_55, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite14, ~y$r_buff1_thd3~0, P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-18 17:27:14,360 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L755-->L755-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1752027516 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-1752027516 256) 0))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite5_Out-1752027516|) (not .cse0) (not .cse1)) (and (= ~y$w_buff0_used~0_In-1752027516 |P1Thread1of1ForFork0_#t~ite5_Out-1752027516|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1752027516, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1752027516} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1752027516, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1752027516, P1Thread1of1ForFork0_#t~ite5=|P1Thread1of1ForFork0_#t~ite5_Out-1752027516|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 17:27:14,361 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L756-->L756-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In-31789704 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-31789704 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-31789704 256))) (.cse1 (= (mod ~y$r_buff1_thd2~0_In-31789704 256) 0))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite6_Out-31789704|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite6_Out-31789704| ~y$w_buff1_used~0_In-31789704)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-31789704, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-31789704, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-31789704, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-31789704} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-31789704, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-31789704, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-31789704, P1Thread1of1ForFork0_#t~ite6=|P1Thread1of1ForFork0_#t~ite6_Out-31789704|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-31789704} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 17:27:14,361 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L757-->L757-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1770968794 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In1770968794 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork0_#t~ite7_Out1770968794|)) (and (= |P1Thread1of1ForFork0_#t~ite7_Out1770968794| ~y$r_buff0_thd2~0_In1770968794) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1770968794, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1770968794} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1770968794, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1770968794, P1Thread1of1ForFork0_#t~ite7=|P1Thread1of1ForFork0_#t~ite7_Out1770968794|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-18 17:27:14,362 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [694] [694] L758-->L758-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In2065908462 256))) (.cse1 (= (mod ~y$r_buff1_thd2~0_In2065908462 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In2065908462 256))) (.cse2 (= (mod ~y$r_buff0_thd2~0_In2065908462 256) 0))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite8_Out2065908462|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$r_buff1_thd2~0_In2065908462 |P1Thread1of1ForFork0_#t~ite8_Out2065908462|) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2065908462, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2065908462, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2065908462, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2065908462} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2065908462, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2065908462, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2065908462, P1Thread1of1ForFork0_#t~ite8=|P1Thread1of1ForFork0_#t~ite8_Out2065908462|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2065908462} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 17:27:14,362 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [732] [732] L758-2-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_75 (+ v_~__unbuffered_cnt~0_76 1)) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= v_~y$r_buff1_thd2~0_82 |v_P1Thread1of1ForFork0_#t~ite8_38|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_76, P1Thread1of1ForFork0_#t~ite8=|v_P1Thread1of1ForFork0_#t~ite8_38|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_82, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#t~ite8=|v_P1Thread1of1ForFork0_#t~ite8_37|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#t~ite8, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-18 17:27:14,363 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [673] [673] L820-->L822-2: Formula: (and (or (= 0 (mod v_~y$w_buff0_used~0_253 256)) (= (mod v_~y$r_buff0_thd0~0_142 256) 0)) (not (= 0 (mod v_~main$tmp_guard0~0_6 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_253, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_142, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_253, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_142, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 17:27:14,363 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] L822-2-->L822-5: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd0~0_In-726133103 256) 0)) (.cse0 (= |ULTIMATE.start_main_#t~ite18_Out-726133103| |ULTIMATE.start_main_#t~ite19_Out-726133103|)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-726133103 256)))) (or (and (= |ULTIMATE.start_main_#t~ite18_Out-726133103| ~y~0_In-726133103) .cse0 (or .cse1 .cse2)) (and (not .cse2) (= ~y$w_buff1~0_In-726133103 |ULTIMATE.start_main_#t~ite18_Out-726133103|) .cse0 (not .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-726133103, ~y~0=~y~0_In-726133103, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-726133103, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-726133103} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-726133103, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out-726133103|, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-726133103|, ~y~0=~y~0_In-726133103, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-726133103, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-726133103} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-18 17:27:14,364 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] L823-->L823-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In1747463303 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1747463303 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite20_Out1747463303| ~y$w_buff0_used~0_In1747463303)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite20_Out1747463303|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1747463303, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1747463303} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1747463303, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1747463303, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out1747463303|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-18 17:27:14,364 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L824-->L824-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In489222260 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In489222260 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd0~0_In489222260 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In489222260 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite21_Out489222260| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite21_Out489222260| ~y$w_buff1_used~0_In489222260) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In489222260, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In489222260, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In489222260, ~y$w_buff1_used~0=~y$w_buff1_used~0_In489222260} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In489222260, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In489222260, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out489222260|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In489222260, ~y$w_buff1_used~0=~y$w_buff1_used~0_In489222260} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-18 17:27:14,365 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L825-->L825-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-192212989 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-192212989 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite22_Out-192212989|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite22_Out-192212989| ~y$r_buff0_thd0~0_In-192212989)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-192212989, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-192212989} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-192212989, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-192212989, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-192212989|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-18 17:27:14,366 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L826-->L826-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-1701431211 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In-1701431211 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In-1701431211 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In-1701431211 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite23_Out-1701431211|)) (and (or .cse0 .cse1) (= ~y$r_buff1_thd0~0_In-1701431211 |ULTIMATE.start_main_#t~ite23_Out-1701431211|) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1701431211, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1701431211, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1701431211, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1701431211} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1701431211, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1701431211, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1701431211, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-1701431211|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1701431211} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-18 17:27:14,367 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L834-->L834-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1461261522 256) 0))) (or (and (not .cse0) (= ~y$w_buff0~0_In-1461261522 |ULTIMATE.start_main_#t~ite30_Out-1461261522|) (= |ULTIMATE.start_main_#t~ite29_In-1461261522| |ULTIMATE.start_main_#t~ite29_Out-1461261522|)) (and (= ~y$w_buff0~0_In-1461261522 |ULTIMATE.start_main_#t~ite29_Out-1461261522|) .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1461261522 256)))) (or (= (mod ~y$w_buff0_used~0_In-1461261522 256) 0) (and .cse1 (= (mod ~y$w_buff1_used~0_In-1461261522 256) 0)) (and .cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-1461261522 256))))) (= |ULTIMATE.start_main_#t~ite29_Out-1461261522| |ULTIMATE.start_main_#t~ite30_Out-1461261522|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1461261522, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_In-1461261522|, ~y$w_buff0~0=~y$w_buff0~0_In-1461261522, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1461261522, ~weak$$choice2~0=~weak$$choice2~0_In-1461261522, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1461261522, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1461261522} OutVars{ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_Out-1461261522|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1461261522, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-1461261522|, ~y$w_buff0~0=~y$w_buff0~0_In-1461261522, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1461261522, ~weak$$choice2~0=~weak$$choice2~0_In-1461261522, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1461261522, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1461261522} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-18 17:27:14,369 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [737] [737] L836-->L836-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-882846577 256)))) (or (and .cse0 (= |ULTIMATE.start_main_#t~ite35_Out-882846577| |ULTIMATE.start_main_#t~ite36_Out-882846577|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-882846577 256)))) (or (= 0 (mod ~y$w_buff0_used~0_In-882846577 256)) (and .cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-882846577 256))) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In-882846577 256))))) (= ~y$w_buff0_used~0_In-882846577 |ULTIMATE.start_main_#t~ite35_Out-882846577|)) (and (= |ULTIMATE.start_main_#t~ite35_In-882846577| |ULTIMATE.start_main_#t~ite35_Out-882846577|) (not .cse0) (= ~y$w_buff0_used~0_In-882846577 |ULTIMATE.start_main_#t~ite36_Out-882846577|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-882846577, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-882846577, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_In-882846577|, ~weak$$choice2~0=~weak$$choice2~0_In-882846577, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-882846577, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-882846577} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-882846577, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-882846577, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out-882846577|, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-882846577|, ~weak$$choice2~0=~weak$$choice2~0_In-882846577, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-882846577, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-882846577} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-18 17:27:14,370 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [736] [736] L837-->L837-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-1025738865 256) 0))) (or (and (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1025738865 256)))) (or (= 0 (mod ~y$w_buff0_used~0_In-1025738865 256)) (and (= 0 (mod ~y$w_buff1_used~0_In-1025738865 256)) .cse0) (and (= (mod ~y$r_buff1_thd0~0_In-1025738865 256) 0) .cse0))) (= |ULTIMATE.start_main_#t~ite39_Out-1025738865| |ULTIMATE.start_main_#t~ite38_Out-1025738865|) (= ~y$w_buff1_used~0_In-1025738865 |ULTIMATE.start_main_#t~ite38_Out-1025738865|) .cse1) (and (= |ULTIMATE.start_main_#t~ite38_In-1025738865| |ULTIMATE.start_main_#t~ite38_Out-1025738865|) (not .cse1) (= ~y$w_buff1_used~0_In-1025738865 |ULTIMATE.start_main_#t~ite39_Out-1025738865|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1025738865, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1025738865, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_In-1025738865|, ~weak$$choice2~0=~weak$$choice2~0_In-1025738865, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1025738865, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1025738865} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1025738865, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-1025738865|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1025738865, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-1025738865|, ~weak$$choice2~0=~weak$$choice2~0_In-1025738865, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1025738865, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1025738865} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-18 17:27:14,370 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L838-->L839: Formula: (and (not (= (mod v_~weak$$choice2~0_22 256) 0)) (= v_~y$r_buff0_thd0~0_108 v_~y$r_buff0_thd0~0_107)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_108, ~weak$$choice2~0=v_~weak$$choice2~0_22} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_11|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_107, ~weak$$choice2~0=v_~weak$$choice2~0_22, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 17:27:14,371 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L839-->L839-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1110952591 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out-1110952591| ~y$r_buff1_thd0~0_In-1110952591) (= |ULTIMATE.start_main_#t~ite44_In-1110952591| |ULTIMATE.start_main_#t~ite44_Out-1110952591|) (not .cse0)) (and (= ~y$r_buff1_thd0~0_In-1110952591 |ULTIMATE.start_main_#t~ite44_Out-1110952591|) (= |ULTIMATE.start_main_#t~ite45_Out-1110952591| |ULTIMATE.start_main_#t~ite44_Out-1110952591|) (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-1110952591 256) 0))) (or (and .cse1 (= (mod ~y$r_buff1_thd0~0_In-1110952591 256) 0)) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In-1110952591 256))) (= (mod ~y$w_buff0_used~0_In-1110952591 256) 0))) .cse0))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1110952591, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1110952591, ~weak$$choice2~0=~weak$$choice2~0_In-1110952591, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1110952591, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1110952591, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_In-1110952591|} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1110952591, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1110952591, ~weak$$choice2~0=~weak$$choice2~0_In-1110952591, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1110952591, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1110952591|, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1110952591|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1110952591} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 17:27:14,371 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [731] [731] L841-->L4: Formula: (and (= 0 v_~y$flush_delayed~0_27) (= v_~y~0_103 v_~y$mem_tmp~0_13) (not (= 0 (mod v_~y$flush_delayed~0_28 256))) (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_13, ~y$flush_delayed~0=v_~y$flush_delayed~0_28, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_13, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~y$flush_delayed~0=v_~y$flush_delayed~0_27, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_27|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~y~0=v_~y~0_103, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~y$flush_delayed~0, ULTIMATE.start_main_#t~ite46, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 17:27:14,372 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_9 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_9 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_9, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 17:27:14,472 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 05:27:14 BasicIcfg [2019-12-18 17:27:14,473 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 17:27:14,474 INFO L168 Benchmark]: Toolchain (without parser) took 23356.50 ms. Allocated memory was 147.3 MB in the beginning and 983.6 MB in the end (delta: 836.2 MB). Free memory was 103.6 MB in the beginning and 332.5 MB in the end (delta: -228.9 MB). Peak memory consumption was 607.3 MB. Max. memory is 7.1 GB. [2019-12-18 17:27:14,475 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 147.3 MB. Free memory was 123.6 MB in the beginning and 123.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 17:27:14,476 INFO L168 Benchmark]: CACSL2BoogieTranslator took 776.78 ms. Allocated memory was 147.3 MB in the beginning and 206.0 MB in the end (delta: 58.7 MB). Free memory was 103.4 MB in the beginning and 160.3 MB in the end (delta: -57.0 MB). Peak memory consumption was 22.7 MB. Max. memory is 7.1 GB. [2019-12-18 17:27:14,476 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.58 ms. Allocated memory is still 206.0 MB. Free memory was 160.3 MB in the beginning and 157.1 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. [2019-12-18 17:27:14,477 INFO L168 Benchmark]: Boogie Preprocessor took 37.73 ms. Allocated memory is still 206.0 MB. Free memory was 157.1 MB in the beginning and 155.2 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-18 17:27:14,478 INFO L168 Benchmark]: RCFGBuilder took 824.68 ms. Allocated memory is still 206.0 MB. Free memory was 155.2 MB in the beginning and 107.7 MB in the end (delta: 47.4 MB). Peak memory consumption was 47.4 MB. Max. memory is 7.1 GB. [2019-12-18 17:27:14,479 INFO L168 Benchmark]: TraceAbstraction took 21641.44 ms. Allocated memory was 206.0 MB in the beginning and 983.6 MB in the end (delta: 777.5 MB). Free memory was 107.7 MB in the beginning and 332.5 MB in the end (delta: -224.8 MB). Peak memory consumption was 552.8 MB. Max. memory is 7.1 GB. [2019-12-18 17:27:14,482 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 147.3 MB. Free memory was 123.6 MB in the beginning and 123.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 776.78 ms. Allocated memory was 147.3 MB in the beginning and 206.0 MB in the end (delta: 58.7 MB). Free memory was 103.4 MB in the beginning and 160.3 MB in the end (delta: -57.0 MB). Peak memory consumption was 22.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 69.58 ms. Allocated memory is still 206.0 MB. Free memory was 160.3 MB in the beginning and 157.1 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.73 ms. Allocated memory is still 206.0 MB. Free memory was 157.1 MB in the beginning and 155.2 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 824.68 ms. Allocated memory is still 206.0 MB. Free memory was 155.2 MB in the beginning and 107.7 MB in the end (delta: 47.4 MB). Peak memory consumption was 47.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 21641.44 ms. Allocated memory was 206.0 MB in the beginning and 983.6 MB in the end (delta: 777.5 MB). Free memory was 107.7 MB in the beginning and 332.5 MB in the end (delta: -224.8 MB). Peak memory consumption was 552.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.4s, 165 ProgramPointsBefore, 79 ProgramPointsAfterwards, 196 TransitionsBefore, 86 TransitionsAfterwards, 11490 CoEnabledTransitionPairs, 8 FixpointIterations, 34 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 38 ConcurrentYvCompositions, 28 ChoiceCompositions, 4263 VarBasedMoverChecksPositive, 162 VarBasedMoverChecksNegative, 17 SemBasedMoverChecksPositive, 192 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.2s, 0 MoverChecksTotal, 50142 CheckedPairsTotal, 117 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L812] FCALL, FORK 0 pthread_create(&t1114, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L814] FCALL, FORK 0 pthread_create(&t1115, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L816] FCALL, FORK 0 pthread_create(&t1116, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L768] 3 y$w_buff1 = y$w_buff0 [L769] 3 y$w_buff0 = 2 [L770] 3 y$w_buff1_used = y$w_buff0_used [L771] 3 y$w_buff0_used = (_Bool)1 [L789] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L748] 2 x = 1 [L751] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L754] EXPR 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L754] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L789] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L790] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L791] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_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 [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L822] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L823] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L824] 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 [L825] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L826] 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 [L829] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L830] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L831] 0 y$flush_delayed = weak$$choice2 [L832] 0 y$mem_tmp = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L833] 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}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L833] 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) [L834] 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)) [L835] 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}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L835] 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)) [L836] 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)) [L837] 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)) [L839] 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)) [L840] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 156 locations, 2 error locations. Result: UNSAFE, OverallTime: 21.3s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 6.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1526 SDtfs, 1977 SDslu, 4140 SDs, 0 SdLazy, 2907 SolverSat, 182 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 153 GetRequests, 18 SyntacticMatches, 16 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22366occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 14284 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 596 NumberOfCodeBlocks, 596 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 525 ConstructedInterpolants, 0 QuantifiedInterpolants, 101349 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...