/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe008_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 18:10:07,803 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 18:10:07,806 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 18:10:07,825 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 18:10:07,825 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 18:10:07,827 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 18:10:07,829 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 18:10:07,839 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 18:10:07,842 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 18:10:07,845 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 18:10:07,847 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 18:10:07,849 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 18:10:07,849 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 18:10:07,851 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 18:10:07,854 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 18:10:07,855 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 18:10:07,856 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 18:10:07,858 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 18:10:07,860 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 18:10:07,865 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 18:10:07,870 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 18:10:07,875 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 18:10:07,876 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 18:10:07,877 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 18:10:07,879 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 18:10:07,879 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 18:10:07,879 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 18:10:07,881 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 18:10:07,883 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 18:10:07,884 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 18:10:07,884 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 18:10:07,886 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 18:10:07,887 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 18:10:07,888 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 18:10:07,889 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 18:10:07,889 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 18:10:07,890 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 18:10:07,890 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 18:10:07,890 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 18:10:07,891 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 18:10:07,892 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 18:10:07,893 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf [2019-12-27 18:10:07,927 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 18:10:07,927 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 18:10:07,928 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 18:10:07,929 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 18:10:07,929 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 18:10:07,929 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 18:10:07,929 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 18:10:07,929 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 18:10:07,930 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 18:10:07,930 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 18:10:07,930 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 18:10:07,930 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 18:10:07,930 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 18:10:07,930 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 18:10:07,931 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 18:10:07,931 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 18:10:07,931 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 18:10:07,931 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 18:10:07,931 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 18:10:07,932 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 18:10:07,932 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 18:10:07,932 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 18:10:07,932 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 18:10:07,932 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 18:10:07,932 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 18:10:07,933 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 18:10:07,933 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 18:10:07,933 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 18:10:07,933 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 18:10:07,933 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 18:10:07,934 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 18:10:08,263 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 18:10:08,282 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 18:10:08,285 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 18:10:08,287 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 18:10:08,288 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 18:10:08,289 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe008_rmo.opt.i [2019-12-27 18:10:08,361 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf4959d88/29eb87b29bd845a9b1cd09d9ee804b04/FLAGc1b303ab1 [2019-12-27 18:10:08,927 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 18:10:08,928 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe008_rmo.opt.i [2019-12-27 18:10:08,953 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf4959d88/29eb87b29bd845a9b1cd09d9ee804b04/FLAGc1b303ab1 [2019-12-27 18:10:09,195 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf4959d88/29eb87b29bd845a9b1cd09d9ee804b04 [2019-12-27 18:10:09,204 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 18:10:09,205 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 18:10:09,206 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 18:10:09,207 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 18:10:09,210 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 18:10:09,211 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:10:09" (1/1) ... [2019-12-27 18:10:09,214 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cd32435 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:10:09, skipping insertion in model container [2019-12-27 18:10:09,214 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:10:09" (1/1) ... [2019-12-27 18:10:09,221 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 18:10:09,277 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 18:10:09,809 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 18:10:09,821 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 18:10:09,905 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 18:10:09,979 INFO L208 MainTranslator]: Completed translation [2019-12-27 18:10:09,980 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:10:09 WrapperNode [2019-12-27 18:10:09,980 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 18:10:09,981 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 18:10:09,981 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 18:10:09,981 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 18:10:09,990 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:10:09" (1/1) ... [2019-12-27 18:10:10,011 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:10:09" (1/1) ... [2019-12-27 18:10:10,050 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 18:10:10,051 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 18:10:10,051 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 18:10:10,051 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 18:10:10,061 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:10:09" (1/1) ... [2019-12-27 18:10:10,061 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:10:09" (1/1) ... [2019-12-27 18:10:10,067 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:10:09" (1/1) ... [2019-12-27 18:10:10,068 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:10:09" (1/1) ... [2019-12-27 18:10:10,078 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:10:09" (1/1) ... [2019-12-27 18:10:10,084 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:10:09" (1/1) ... [2019-12-27 18:10:10,092 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:10:09" (1/1) ... [2019-12-27 18:10:10,098 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 18:10:10,098 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 18:10:10,098 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 18:10:10,098 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 18:10:10,099 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:10:09" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 18:10:10,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 18:10:10,174 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 18:10:10,174 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 18:10:10,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 18:10:10,174 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 18:10:10,175 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 18:10:10,175 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 18:10:10,175 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 18:10:10,175 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 18:10:10,175 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 18:10:10,176 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 18:10:10,176 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 18:10:10,176 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 18:10:10,177 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 18:10:10,927 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 18:10:10,928 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 18:10:10,929 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:10:10 BoogieIcfgContainer [2019-12-27 18:10:10,930 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 18:10:10,931 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 18:10:10,931 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 18:10:10,934 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 18:10:10,935 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 06:10:09" (1/3) ... [2019-12-27 18:10:10,936 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4494a9d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:10:10, skipping insertion in model container [2019-12-27 18:10:10,936 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:10:09" (2/3) ... [2019-12-27 18:10:10,936 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4494a9d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:10:10, skipping insertion in model container [2019-12-27 18:10:10,937 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:10:10" (3/3) ... [2019-12-27 18:10:10,938 INFO L109 eAbstractionObserver]: Analyzing ICFG safe008_rmo.opt.i [2019-12-27 18:10:10,949 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 18:10:10,949 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 18:10:10,957 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 18:10:10,958 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 18:10:10,996 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:10,996 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:10,997 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:10,997 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:10,997 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:10,997 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:10,998 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:10,998 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:10,998 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:10,999 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:10,999 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:10,999 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:11,000 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:11,000 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:11,000 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:11,000 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:11,001 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:11,001 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:11,001 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:11,001 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:11,002 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:11,002 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:11,002 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:11,002 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:11,003 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:11,003 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:11,003 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:11,003 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:11,004 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:11,004 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:11,004 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:11,004 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:11,005 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:11,005 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:11,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:11,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:11,006 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:11,006 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:11,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:11,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:11,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:11,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:11,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:11,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:11,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:11,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:11,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:11,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:11,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:11,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:11,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:11,029 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:11,030 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:11,030 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:11,030 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:11,030 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:11,031 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:11,031 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:11,031 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:11,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:11,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:11,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:11,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:11,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:11,035 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:11,035 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:11,036 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:11,036 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:11,036 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:11,038 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:11,038 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:11,039 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:11,039 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:11,039 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:11,039 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:11,039 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:11,040 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:11,040 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:11,040 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:11,041 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:11,041 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:11,041 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:11,042 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:11,042 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:11,043 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:11,043 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:11,043 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:11,043 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:11,044 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:11,044 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:11,044 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:11,044 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:11,044 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:11,045 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:11,048 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:11,048 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:11,048 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:11,048 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:11,049 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:11,049 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:11,050 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:11,053 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:11,054 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:11,054 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:11,054 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:11,061 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:11,065 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:11,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:11,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:11,065 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:11,066 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:11,066 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:11,066 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:11,066 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:11,066 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:11,067 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:11,068 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:11,068 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:11,069 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:11,069 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:11,069 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:11,069 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:11,069 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:11,070 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:11,070 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:11,070 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:10:11,086 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 18:10:11,102 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 18:10:11,102 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 18:10:11,102 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 18:10:11,102 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 18:10:11,102 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 18:10:11,102 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 18:10:11,103 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 18:10:11,103 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 18:10:11,118 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 212 transitions [2019-12-27 18:10:11,120 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-27 18:10:11,221 INFO L132 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-27 18:10:11,221 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 18:10:11,236 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 342 event pairs. 0/160 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 18:10:11,259 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-27 18:10:11,312 INFO L132 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-27 18:10:11,312 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 18:10:11,319 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 342 event pairs. 0/160 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 18:10:11,338 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 17114 [2019-12-27 18:10:11,339 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 18:10:16,299 WARN L192 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-27 18:10:16,429 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-27 18:10:16,453 INFO L206 etLargeBlockEncoding]: Checked pairs total: 80053 [2019-12-27 18:10:16,454 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-27 18:10:16,457 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 95 places, 106 transitions [2019-12-27 18:10:34,523 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 115670 states. [2019-12-27 18:10:34,525 INFO L276 IsEmpty]: Start isEmpty. Operand 115670 states. [2019-12-27 18:10:34,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 18:10:34,530 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:10:34,531 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 18:10:34,531 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:10:34,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:10:34,536 INFO L82 PathProgramCache]: Analyzing trace with hash 846448, now seen corresponding path program 1 times [2019-12-27 18:10:34,544 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:10:34,544 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67243962] [2019-12-27 18:10:34,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:10:34,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:10:34,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:10:34,766 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67243962] [2019-12-27 18:10:34,766 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:10:34,766 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 18:10:34,767 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [342588799] [2019-12-27 18:10:34,768 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:10:34,772 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:10:34,781 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 18:10:34,782 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:10:34,785 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:10:34,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:10:34,786 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:10:34,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:10:34,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:10:34,799 INFO L87 Difference]: Start difference. First operand 115670 states. Second operand 3 states. [2019-12-27 18:10:38,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:10:38,479 INFO L93 Difference]: Finished difference Result 115182 states and 492924 transitions. [2019-12-27 18:10:38,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:10:38,481 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 18:10:38,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:10:39,257 INFO L225 Difference]: With dead ends: 115182 [2019-12-27 18:10:39,257 INFO L226 Difference]: Without dead ends: 112830 [2019-12-27 18:10:39,259 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:10:43,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112830 states. [2019-12-27 18:10:45,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112830 to 112830. [2019-12-27 18:10:45,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112830 states. [2019-12-27 18:10:46,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112830 states to 112830 states and 483320 transitions. [2019-12-27 18:10:46,143 INFO L78 Accepts]: Start accepts. Automaton has 112830 states and 483320 transitions. Word has length 3 [2019-12-27 18:10:46,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:10:46,143 INFO L462 AbstractCegarLoop]: Abstraction has 112830 states and 483320 transitions. [2019-12-27 18:10:46,143 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:10:46,143 INFO L276 IsEmpty]: Start isEmpty. Operand 112830 states and 483320 transitions. [2019-12-27 18:10:46,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 18:10:46,149 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:10:46,149 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:10:46,149 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:10:46,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:10:46,150 INFO L82 PathProgramCache]: Analyzing trace with hash -939919620, now seen corresponding path program 1 times [2019-12-27 18:10:46,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:10:46,151 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694570193] [2019-12-27 18:10:46,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:10:46,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:10:46,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:10:46,289 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694570193] [2019-12-27 18:10:46,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:10:46,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:10:46,291 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [798383022] [2019-12-27 18:10:46,291 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:10:46,292 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:10:46,298 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 18:10:46,299 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:10:46,299 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:10:46,300 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:10:46,300 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:10:46,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:10:46,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:10:46,301 INFO L87 Difference]: Start difference. First operand 112830 states and 483320 transitions. Second operand 4 states. [2019-12-27 18:10:51,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:10:51,149 INFO L93 Difference]: Finished difference Result 176302 states and 727515 transitions. [2019-12-27 18:10:51,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:10:51,149 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 18:10:51,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:10:51,816 INFO L225 Difference]: With dead ends: 176302 [2019-12-27 18:10:51,817 INFO L226 Difference]: Without dead ends: 176253 [2019-12-27 18:10:51,817 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:11:01,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176253 states. [2019-12-27 18:11:05,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176253 to 159436. [2019-12-27 18:11:05,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159436 states. [2019-12-27 18:11:05,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159436 states to 159436 states and 665691 transitions. [2019-12-27 18:11:05,629 INFO L78 Accepts]: Start accepts. Automaton has 159436 states and 665691 transitions. Word has length 11 [2019-12-27 18:11:05,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:11:05,630 INFO L462 AbstractCegarLoop]: Abstraction has 159436 states and 665691 transitions. [2019-12-27 18:11:05,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:11:05,630 INFO L276 IsEmpty]: Start isEmpty. Operand 159436 states and 665691 transitions. [2019-12-27 18:11:05,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 18:11:05,637 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:11:05,637 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:11:05,637 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:11:05,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:11:05,638 INFO L82 PathProgramCache]: Analyzing trace with hash 670018080, now seen corresponding path program 1 times [2019-12-27 18:11:05,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:11:05,638 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134181955] [2019-12-27 18:11:05,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:11:05,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:11:05,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:11:05,719 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134181955] [2019-12-27 18:11:05,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:11:05,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:11:05,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [399710160] [2019-12-27 18:11:05,720 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:11:05,721 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:11:05,723 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 18:11:05,723 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:11:05,723 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:11:05,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:11:05,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:11:05,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:11:05,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:11:05,724 INFO L87 Difference]: Start difference. First operand 159436 states and 665691 transitions. Second operand 4 states. [2019-12-27 18:11:13,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:11:13,422 INFO L93 Difference]: Finished difference Result 228428 states and 932375 transitions. [2019-12-27 18:11:13,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:11:13,423 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 18:11:13,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:11:14,300 INFO L225 Difference]: With dead ends: 228428 [2019-12-27 18:11:14,300 INFO L226 Difference]: Without dead ends: 228365 [2019-12-27 18:11:14,301 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:11:20,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228365 states. [2019-12-27 18:11:24,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228365 to 192396. [2019-12-27 18:11:24,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192396 states. [2019-12-27 18:11:25,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192396 states to 192396 states and 797806 transitions. [2019-12-27 18:11:25,507 INFO L78 Accepts]: Start accepts. Automaton has 192396 states and 797806 transitions. Word has length 13 [2019-12-27 18:11:25,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:11:25,508 INFO L462 AbstractCegarLoop]: Abstraction has 192396 states and 797806 transitions. [2019-12-27 18:11:25,508 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:11:25,508 INFO L276 IsEmpty]: Start isEmpty. Operand 192396 states and 797806 transitions. [2019-12-27 18:11:25,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 18:11:25,511 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:11:25,511 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:11:25,511 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:11:25,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:11:25,512 INFO L82 PathProgramCache]: Analyzing trace with hash -293312110, now seen corresponding path program 1 times [2019-12-27 18:11:25,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:11:25,512 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915598513] [2019-12-27 18:11:25,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:11:25,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:11:25,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:11:25,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915598513] [2019-12-27 18:11:25,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:11:25,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:11:25,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2061920121] [2019-12-27 18:11:25,569 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:11:25,570 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:11:25,572 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 18:11:25,572 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:11:25,572 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:11:25,572 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:11:25,572 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:11:25,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:11:25,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:11:25,573 INFO L87 Difference]: Start difference. First operand 192396 states and 797806 transitions. Second operand 3 states. [2019-12-27 18:11:25,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:11:25,717 INFO L93 Difference]: Finished difference Result 38255 states and 124332 transitions. [2019-12-27 18:11:25,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:11:25,717 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 18:11:25,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:11:25,780 INFO L225 Difference]: With dead ends: 38255 [2019-12-27 18:11:25,780 INFO L226 Difference]: Without dead ends: 38255 [2019-12-27 18:11:25,780 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:11:25,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38255 states. [2019-12-27 18:11:32,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38255 to 38255. [2019-12-27 18:11:32,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38255 states. [2019-12-27 18:11:32,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38255 states to 38255 states and 124332 transitions. [2019-12-27 18:11:32,430 INFO L78 Accepts]: Start accepts. Automaton has 38255 states and 124332 transitions. Word has length 13 [2019-12-27 18:11:32,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:11:32,430 INFO L462 AbstractCegarLoop]: Abstraction has 38255 states and 124332 transitions. [2019-12-27 18:11:32,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:11:32,431 INFO L276 IsEmpty]: Start isEmpty. Operand 38255 states and 124332 transitions. [2019-12-27 18:11:32,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 18:11:32,434 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:11:32,434 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-27 18:11:32,435 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:11:32,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:11:32,435 INFO L82 PathProgramCache]: Analyzing trace with hash -2105368373, now seen corresponding path program 1 times [2019-12-27 18:11:32,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:11:32,436 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145553437] [2019-12-27 18:11:32,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:11:32,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:11:32,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:11:32,537 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145553437] [2019-12-27 18:11:32,537 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:11:32,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:11:32,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [666407209] [2019-12-27 18:11:32,537 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:11:32,541 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:11:32,546 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 29 states and 37 transitions. [2019-12-27 18:11:32,546 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:11:32,547 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:11:32,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:11:32,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:11:32,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:11:32,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:11:32,548 INFO L87 Difference]: Start difference. First operand 38255 states and 124332 transitions. Second operand 5 states. [2019-12-27 18:11:33,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:11:33,329 INFO L93 Difference]: Finished difference Result 51712 states and 164813 transitions. [2019-12-27 18:11:33,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 18:11:33,329 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-27 18:11:33,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:11:33,409 INFO L225 Difference]: With dead ends: 51712 [2019-12-27 18:11:33,409 INFO L226 Difference]: Without dead ends: 51699 [2019-12-27 18:11:33,409 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 18:11:33,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51699 states. [2019-12-27 18:11:34,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51699 to 38713. [2019-12-27 18:11:34,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38713 states. [2019-12-27 18:11:34,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38713 states to 38713 states and 125630 transitions. [2019-12-27 18:11:34,152 INFO L78 Accepts]: Start accepts. Automaton has 38713 states and 125630 transitions. Word has length 19 [2019-12-27 18:11:34,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:11:34,153 INFO L462 AbstractCegarLoop]: Abstraction has 38713 states and 125630 transitions. [2019-12-27 18:11:34,153 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:11:34,153 INFO L276 IsEmpty]: Start isEmpty. Operand 38713 states and 125630 transitions. [2019-12-27 18:11:34,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 18:11:34,167 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:11:34,167 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:11:34,167 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:11:34,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:11:34,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1240477865, now seen corresponding path program 1 times [2019-12-27 18:11:34,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:11:34,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548709494] [2019-12-27 18:11:34,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:11:34,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:11:34,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:11:34,232 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548709494] [2019-12-27 18:11:34,232 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:11:34,232 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:11:34,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1457045185] [2019-12-27 18:11:34,233 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:11:34,236 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:11:34,241 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 18:11:34,241 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:11:34,241 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:11:34,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:11:34,242 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:11:34,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:11:34,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:11:34,243 INFO L87 Difference]: Start difference. First operand 38713 states and 125630 transitions. Second operand 4 states. [2019-12-27 18:11:34,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:11:34,288 INFO L93 Difference]: Finished difference Result 7422 states and 20312 transitions. [2019-12-27 18:11:34,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 18:11:34,289 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 18:11:34,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:11:34,300 INFO L225 Difference]: With dead ends: 7422 [2019-12-27 18:11:34,300 INFO L226 Difference]: Without dead ends: 7422 [2019-12-27 18:11:34,301 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:11:34,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7422 states. [2019-12-27 18:11:34,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7422 to 7310. [2019-12-27 18:11:34,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7310 states. [2019-12-27 18:11:34,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7310 states to 7310 states and 19992 transitions. [2019-12-27 18:11:34,413 INFO L78 Accepts]: Start accepts. Automaton has 7310 states and 19992 transitions. Word has length 25 [2019-12-27 18:11:34,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:11:34,413 INFO L462 AbstractCegarLoop]: Abstraction has 7310 states and 19992 transitions. [2019-12-27 18:11:34,413 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:11:34,413 INFO L276 IsEmpty]: Start isEmpty. Operand 7310 states and 19992 transitions. [2019-12-27 18:11:34,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 18:11:34,425 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:11:34,425 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:11:34,425 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:11:34,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:11:34,426 INFO L82 PathProgramCache]: Analyzing trace with hash -1041968244, now seen corresponding path program 1 times [2019-12-27 18:11:34,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:11:34,427 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607401001] [2019-12-27 18:11:34,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:11:34,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:11:34,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:11:34,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607401001] [2019-12-27 18:11:34,502 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:11:34,502 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 18:11:34,502 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [275184596] [2019-12-27 18:11:34,502 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:11:34,509 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:11:34,535 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 66 states and 92 transitions. [2019-12-27 18:11:34,535 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:11:34,538 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 18:11:34,538 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:11:34,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:11:34,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:11:34,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:11:34,539 INFO L87 Difference]: Start difference. First operand 7310 states and 19992 transitions. Second operand 5 states. [2019-12-27 18:11:34,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:11:34,582 INFO L93 Difference]: Finished difference Result 5312 states and 15267 transitions. [2019-12-27 18:11:34,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:11:34,582 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-27 18:11:34,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:11:34,591 INFO L225 Difference]: With dead ends: 5312 [2019-12-27 18:11:34,591 INFO L226 Difference]: Without dead ends: 5312 [2019-12-27 18:11:34,592 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:11:34,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5312 states. [2019-12-27 18:11:34,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5312 to 4948. [2019-12-27 18:11:34,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4948 states. [2019-12-27 18:11:34,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4948 states to 4948 states and 14283 transitions. [2019-12-27 18:11:34,676 INFO L78 Accepts]: Start accepts. Automaton has 4948 states and 14283 transitions. Word has length 37 [2019-12-27 18:11:34,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:11:34,677 INFO L462 AbstractCegarLoop]: Abstraction has 4948 states and 14283 transitions. [2019-12-27 18:11:34,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:11:34,677 INFO L276 IsEmpty]: Start isEmpty. Operand 4948 states and 14283 transitions. [2019-12-27 18:11:34,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 18:11:34,685 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:11:34,685 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:11:34,685 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:11:34,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:11:34,686 INFO L82 PathProgramCache]: Analyzing trace with hash -1019045356, now seen corresponding path program 1 times [2019-12-27 18:11:34,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:11:34,687 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724536792] [2019-12-27 18:11:34,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:11:34,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:11:35,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:11:35,003 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724536792] [2019-12-27 18:11:35,003 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:11:35,003 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 18:11:35,003 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [381873296] [2019-12-27 18:11:35,004 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:11:35,023 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:11:35,167 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 222 states and 403 transitions. [2019-12-27 18:11:35,167 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:11:35,378 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 18:11:35,378 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 18:11:35,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:11:35,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 18:11:35,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-27 18:11:35,379 INFO L87 Difference]: Start difference. First operand 4948 states and 14283 transitions. Second operand 10 states. [2019-12-27 18:11:36,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:11:36,060 INFO L93 Difference]: Finished difference Result 7539 states and 21548 transitions. [2019-12-27 18:11:36,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 18:11:36,060 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2019-12-27 18:11:36,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:11:36,071 INFO L225 Difference]: With dead ends: 7539 [2019-12-27 18:11:36,071 INFO L226 Difference]: Without dead ends: 7539 [2019-12-27 18:11:36,072 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 5 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-12-27 18:11:36,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7539 states. [2019-12-27 18:11:36,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7539 to 6345. [2019-12-27 18:11:36,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6345 states. [2019-12-27 18:11:36,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6345 states to 6345 states and 18318 transitions. [2019-12-27 18:11:36,170 INFO L78 Accepts]: Start accepts. Automaton has 6345 states and 18318 transitions. Word has length 65 [2019-12-27 18:11:36,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:11:36,170 INFO L462 AbstractCegarLoop]: Abstraction has 6345 states and 18318 transitions. [2019-12-27 18:11:36,170 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 18:11:36,170 INFO L276 IsEmpty]: Start isEmpty. Operand 6345 states and 18318 transitions. [2019-12-27 18:11:36,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 18:11:36,180 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:11:36,180 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:11:36,180 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:11:36,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:11:36,181 INFO L82 PathProgramCache]: Analyzing trace with hash -613444874, now seen corresponding path program 2 times [2019-12-27 18:11:36,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:11:36,181 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421042331] [2019-12-27 18:11:36,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:11:36,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:11:36,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:11:36,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421042331] [2019-12-27 18:11:36,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:11:36,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:11:36,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1275702092] [2019-12-27 18:11:36,296 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:11:36,314 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:11:36,492 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 198 states and 357 transitions. [2019-12-27 18:11:36,492 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:11:36,496 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 18:11:36,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:11:36,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:11:36,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:11:36,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:11:36,497 INFO L87 Difference]: Start difference. First operand 6345 states and 18318 transitions. Second operand 3 states. [2019-12-27 18:11:36,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:11:36,531 INFO L93 Difference]: Finished difference Result 5975 states and 16977 transitions. [2019-12-27 18:11:36,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:11:36,532 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 18:11:36,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:11:36,542 INFO L225 Difference]: With dead ends: 5975 [2019-12-27 18:11:36,542 INFO L226 Difference]: Without dead ends: 5975 [2019-12-27 18:11:36,543 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:11:36,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5975 states. [2019-12-27 18:11:36,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5975 to 5819. [2019-12-27 18:11:36,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5819 states. [2019-12-27 18:11:36,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5819 states to 5819 states and 16547 transitions. [2019-12-27 18:11:36,656 INFO L78 Accepts]: Start accepts. Automaton has 5819 states and 16547 transitions. Word has length 65 [2019-12-27 18:11:36,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:11:36,657 INFO L462 AbstractCegarLoop]: Abstraction has 5819 states and 16547 transitions. [2019-12-27 18:11:36,657 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:11:36,657 INFO L276 IsEmpty]: Start isEmpty. Operand 5819 states and 16547 transitions. [2019-12-27 18:11:36,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 18:11:36,669 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:11:36,670 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:11:36,670 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:11:36,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:11:36,670 INFO L82 PathProgramCache]: Analyzing trace with hash 223341978, now seen corresponding path program 1 times [2019-12-27 18:11:36,671 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:11:36,671 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359272572] [2019-12-27 18:11:36,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:11:36,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:11:36,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:11:36,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359272572] [2019-12-27 18:11:36,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:11:36,770 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 18:11:36,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [417238821] [2019-12-27 18:11:36,771 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:11:36,792 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:11:37,114 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 196 states and 329 transitions. [2019-12-27 18:11:37,114 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:11:37,117 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 18:11:37,117 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:11:37,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:11:37,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:11:37,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:11:37,118 INFO L87 Difference]: Start difference. First operand 5819 states and 16547 transitions. Second operand 5 states. [2019-12-27 18:11:37,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:11:37,437 INFO L93 Difference]: Finished difference Result 8394 states and 23622 transitions. [2019-12-27 18:11:37,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 18:11:37,437 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-27 18:11:37,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:11:37,449 INFO L225 Difference]: With dead ends: 8394 [2019-12-27 18:11:37,449 INFO L226 Difference]: Without dead ends: 8394 [2019-12-27 18:11:37,450 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:11:37,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8394 states. [2019-12-27 18:11:37,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8394 to 6167. [2019-12-27 18:11:37,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6167 states. [2019-12-27 18:11:37,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6167 states to 6167 states and 17580 transitions. [2019-12-27 18:11:37,542 INFO L78 Accepts]: Start accepts. Automaton has 6167 states and 17580 transitions. Word has length 66 [2019-12-27 18:11:37,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:11:37,542 INFO L462 AbstractCegarLoop]: Abstraction has 6167 states and 17580 transitions. [2019-12-27 18:11:37,542 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:11:37,542 INFO L276 IsEmpty]: Start isEmpty. Operand 6167 states and 17580 transitions. [2019-12-27 18:11:37,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 18:11:37,554 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:11:37,554 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:11:37,554 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:11:37,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:11:37,555 INFO L82 PathProgramCache]: Analyzing trace with hash -446701502, now seen corresponding path program 2 times [2019-12-27 18:11:37,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:11:37,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274910381] [2019-12-27 18:11:37,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:11:37,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:11:37,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:11:37,635 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274910381] [2019-12-27 18:11:37,635 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:11:37,635 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:11:37,636 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1121528519] [2019-12-27 18:11:37,636 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:11:37,669 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:11:37,821 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 202 states and 363 transitions. [2019-12-27 18:11:37,822 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:11:37,836 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 18:11:37,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:11:37,837 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:11:37,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:11:37,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:11:37,838 INFO L87 Difference]: Start difference. First operand 6167 states and 17580 transitions. Second operand 5 states. [2019-12-27 18:11:38,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:11:38,052 INFO L93 Difference]: Finished difference Result 7387 states and 20435 transitions. [2019-12-27 18:11:38,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 18:11:38,053 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-27 18:11:38,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:11:38,063 INFO L225 Difference]: With dead ends: 7387 [2019-12-27 18:11:38,063 INFO L226 Difference]: Without dead ends: 7387 [2019-12-27 18:11:38,063 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:11:38,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7387 states. [2019-12-27 18:11:38,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7387 to 5170. [2019-12-27 18:11:38,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5170 states. [2019-12-27 18:11:38,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5170 states to 5170 states and 14519 transitions. [2019-12-27 18:11:38,145 INFO L78 Accepts]: Start accepts. Automaton has 5170 states and 14519 transitions. Word has length 66 [2019-12-27 18:11:38,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:11:38,145 INFO L462 AbstractCegarLoop]: Abstraction has 5170 states and 14519 transitions. [2019-12-27 18:11:38,145 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:11:38,145 INFO L276 IsEmpty]: Start isEmpty. Operand 5170 states and 14519 transitions. [2019-12-27 18:11:38,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 18:11:38,152 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:11:38,152 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:11:38,152 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:11:38,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:11:38,152 INFO L82 PathProgramCache]: Analyzing trace with hash 991626200, now seen corresponding path program 1 times [2019-12-27 18:11:38,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:11:38,153 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367506382] [2019-12-27 18:11:38,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:11:38,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:11:38,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:11:38,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367506382] [2019-12-27 18:11:38,273 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:11:38,273 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 18:11:38,273 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1752833802] [2019-12-27 18:11:38,273 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:11:38,297 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:11:38,524 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 244 states and 463 transitions. [2019-12-27 18:11:38,524 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:11:38,713 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 15 times. [2019-12-27 18:11:38,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 18:11:38,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:11:38,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 18:11:38,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-12-27 18:11:38,714 INFO L87 Difference]: Start difference. First operand 5170 states and 14519 transitions. Second operand 12 states. [2019-12-27 18:11:40,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:11:40,126 INFO L93 Difference]: Finished difference Result 7557 states and 21020 transitions. [2019-12-27 18:11:40,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 18:11:40,126 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-27 18:11:40,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:11:40,136 INFO L225 Difference]: With dead ends: 7557 [2019-12-27 18:11:40,136 INFO L226 Difference]: Without dead ends: 7557 [2019-12-27 18:11:40,136 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 17 SyntacticMatches, 6 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=164, Invalid=592, Unknown=0, NotChecked=0, Total=756 [2019-12-27 18:11:40,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7557 states. [2019-12-27 18:11:40,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7557 to 5613. [2019-12-27 18:11:40,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5613 states. [2019-12-27 18:11:40,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5613 states to 5613 states and 15757 transitions. [2019-12-27 18:11:40,217 INFO L78 Accepts]: Start accepts. Automaton has 5613 states and 15757 transitions. Word has length 67 [2019-12-27 18:11:40,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:11:40,217 INFO L462 AbstractCegarLoop]: Abstraction has 5613 states and 15757 transitions. [2019-12-27 18:11:40,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 18:11:40,217 INFO L276 IsEmpty]: Start isEmpty. Operand 5613 states and 15757 transitions. [2019-12-27 18:11:40,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 18:11:40,224 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:11:40,224 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:11:40,225 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:11:40,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:11:40,225 INFO L82 PathProgramCache]: Analyzing trace with hash -1617265986, now seen corresponding path program 2 times [2019-12-27 18:11:40,225 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:11:40,226 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390337028] [2019-12-27 18:11:40,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:11:40,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:11:40,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:11:40,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390337028] [2019-12-27 18:11:40,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:11:40,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:11:40,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1146171688] [2019-12-27 18:11:40,311 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:11:40,331 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:11:40,473 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 219 states and 402 transitions. [2019-12-27 18:11:40,473 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:11:40,474 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:11:40,474 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:11:40,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:11:40,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:11:40,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:11:40,475 INFO L87 Difference]: Start difference. First operand 5613 states and 15757 transitions. Second operand 3 states. [2019-12-27 18:11:40,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:11:40,520 INFO L93 Difference]: Finished difference Result 5612 states and 15755 transitions. [2019-12-27 18:11:40,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:11:40,521 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-27 18:11:40,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:11:40,528 INFO L225 Difference]: With dead ends: 5612 [2019-12-27 18:11:40,528 INFO L226 Difference]: Without dead ends: 5612 [2019-12-27 18:11:40,529 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:11:40,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5612 states. [2019-12-27 18:11:40,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5612 to 2982. [2019-12-27 18:11:40,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2982 states. [2019-12-27 18:11:40,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2982 states to 2982 states and 8451 transitions. [2019-12-27 18:11:40,583 INFO L78 Accepts]: Start accepts. Automaton has 2982 states and 8451 transitions. Word has length 67 [2019-12-27 18:11:40,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:11:40,583 INFO L462 AbstractCegarLoop]: Abstraction has 2982 states and 8451 transitions. [2019-12-27 18:11:40,583 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:11:40,583 INFO L276 IsEmpty]: Start isEmpty. Operand 2982 states and 8451 transitions. [2019-12-27 18:11:40,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 18:11:40,587 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:11:40,587 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:11:40,587 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:11:40,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:11:40,587 INFO L82 PathProgramCache]: Analyzing trace with hash 1277219082, now seen corresponding path program 1 times [2019-12-27 18:11:40,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:11:40,588 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042836276] [2019-12-27 18:11:40,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:11:40,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:11:40,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:11:40,796 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042836276] [2019-12-27 18:11:40,796 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:11:40,796 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 18:11:40,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1943086677] [2019-12-27 18:11:40,797 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:11:40,817 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:11:40,984 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 245 states and 460 transitions. [2019-12-27 18:11:40,984 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:11:41,120 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 20 times. [2019-12-27 18:11:41,120 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 18:11:41,120 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:11:41,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 18:11:41,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2019-12-27 18:11:41,121 INFO L87 Difference]: Start difference. First operand 2982 states and 8451 transitions. Second operand 14 states. [2019-12-27 18:11:41,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:11:41,526 INFO L93 Difference]: Finished difference Result 5242 states and 14766 transitions. [2019-12-27 18:11:41,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 18:11:41,527 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 68 [2019-12-27 18:11:41,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:11:41,534 INFO L225 Difference]: With dead ends: 5242 [2019-12-27 18:11:41,534 INFO L226 Difference]: Without dead ends: 5217 [2019-12-27 18:11:41,535 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 8 SyntacticMatches, 11 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=119, Invalid=433, Unknown=0, NotChecked=0, Total=552 [2019-12-27 18:11:41,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5217 states. [2019-12-27 18:11:41,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5217 to 4137. [2019-12-27 18:11:41,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4137 states. [2019-12-27 18:11:41,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4137 states to 4137 states and 11614 transitions. [2019-12-27 18:11:41,629 INFO L78 Accepts]: Start accepts. Automaton has 4137 states and 11614 transitions. Word has length 68 [2019-12-27 18:11:41,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:11:41,629 INFO L462 AbstractCegarLoop]: Abstraction has 4137 states and 11614 transitions. [2019-12-27 18:11:41,629 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 18:11:41,630 INFO L276 IsEmpty]: Start isEmpty. Operand 4137 states and 11614 transitions. [2019-12-27 18:11:41,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 18:11:41,635 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:11:41,635 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:11:41,635 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:11:41,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:11:41,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1056540388, now seen corresponding path program 2 times [2019-12-27 18:11:41,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:11:41,637 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041207734] [2019-12-27 18:11:41,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:11:41,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:11:41,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:11:41,799 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041207734] [2019-12-27 18:11:41,799 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:11:41,799 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 18:11:41,800 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1363195761] [2019-12-27 18:11:41,800 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:11:41,830 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:11:42,066 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 245 states and 444 transitions. [2019-12-27 18:11:42,067 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:11:42,099 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 18:11:42,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 18:11:42,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:11:42,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 18:11:42,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:11:42,100 INFO L87 Difference]: Start difference. First operand 4137 states and 11614 transitions. Second operand 7 states. [2019-12-27 18:11:42,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:11:42,196 INFO L93 Difference]: Finished difference Result 7385 states and 20663 transitions. [2019-12-27 18:11:42,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 18:11:42,196 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 68 [2019-12-27 18:11:42,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:11:42,202 INFO L225 Difference]: With dead ends: 7385 [2019-12-27 18:11:42,202 INFO L226 Difference]: Without dead ends: 4098 [2019-12-27 18:11:42,204 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-12-27 18:11:42,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4098 states. [2019-12-27 18:11:42,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4098 to 3941. [2019-12-27 18:11:42,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3941 states. [2019-12-27 18:11:42,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3941 states to 3941 states and 11030 transitions. [2019-12-27 18:11:42,282 INFO L78 Accepts]: Start accepts. Automaton has 3941 states and 11030 transitions. Word has length 68 [2019-12-27 18:11:42,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:11:42,283 INFO L462 AbstractCegarLoop]: Abstraction has 3941 states and 11030 transitions. [2019-12-27 18:11:42,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 18:11:42,283 INFO L276 IsEmpty]: Start isEmpty. Operand 3941 states and 11030 transitions. [2019-12-27 18:11:42,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 18:11:42,290 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:11:42,290 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:11:42,290 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:11:42,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:11:42,291 INFO L82 PathProgramCache]: Analyzing trace with hash -1311051616, now seen corresponding path program 3 times [2019-12-27 18:11:42,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:11:42,292 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209529856] [2019-12-27 18:11:42,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:11:42,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:11:42,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:11:42,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209529856] [2019-12-27 18:11:42,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:11:42,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 18:11:42,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1707280934] [2019-12-27 18:11:42,492 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:11:42,511 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:11:42,680 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 271 states and 522 transitions. [2019-12-27 18:11:42,680 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:11:43,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 18:11:43,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 18:11:43,075 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 25 times. [2019-12-27 18:11:43,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 18:11:43,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:11:43,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 18:11:43,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2019-12-27 18:11:43,076 INFO L87 Difference]: Start difference. First operand 3941 states and 11030 transitions. Second operand 17 states. [2019-12-27 18:11:43,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:11:43,872 INFO L93 Difference]: Finished difference Result 6127 states and 17103 transitions. [2019-12-27 18:11:43,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 18:11:43,873 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 68 [2019-12-27 18:11:43,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:11:43,881 INFO L225 Difference]: With dead ends: 6127 [2019-12-27 18:11:43,881 INFO L226 Difference]: Without dead ends: 6102 [2019-12-27 18:11:43,882 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 8 SyntacticMatches, 13 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=156, Invalid=656, Unknown=0, NotChecked=0, Total=812 [2019-12-27 18:11:43,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6102 states. [2019-12-27 18:11:43,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6102 to 4162. [2019-12-27 18:11:43,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4162 states. [2019-12-27 18:11:43,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4162 states to 4162 states and 11668 transitions. [2019-12-27 18:11:43,978 INFO L78 Accepts]: Start accepts. Automaton has 4162 states and 11668 transitions. Word has length 68 [2019-12-27 18:11:43,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:11:43,979 INFO L462 AbstractCegarLoop]: Abstraction has 4162 states and 11668 transitions. [2019-12-27 18:11:43,979 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 18:11:43,979 INFO L276 IsEmpty]: Start isEmpty. Operand 4162 states and 11668 transitions. [2019-12-27 18:11:43,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 18:11:43,985 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:11:43,985 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:11:43,985 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:11:43,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:11:43,986 INFO L82 PathProgramCache]: Analyzing trace with hash -526111866, now seen corresponding path program 4 times [2019-12-27 18:11:43,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:11:43,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35393432] [2019-12-27 18:11:43,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:11:44,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:11:44,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:11:44,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35393432] [2019-12-27 18:11:44,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:11:44,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-27 18:11:44,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [739908634] [2019-12-27 18:11:44,581 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:11:44,614 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:11:44,874 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 279 states and 548 transitions. [2019-12-27 18:11:44,874 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:11:45,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 18:11:45,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 18:11:45,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 18:11:45,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 18:11:46,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 18:11:46,260 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 31 [2019-12-27 18:11:46,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 18:11:46,441 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 42 times. [2019-12-27 18:11:46,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-12-27 18:11:46,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:11:46,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-12-27 18:11:46,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1131, Unknown=0, NotChecked=0, Total=1260 [2019-12-27 18:11:46,443 INFO L87 Difference]: Start difference. First operand 4162 states and 11668 transitions. Second operand 36 states. [2019-12-27 18:11:52,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:11:52,359 INFO L93 Difference]: Finished difference Result 12283 states and 33999 transitions. [2019-12-27 18:11:52,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-27 18:11:52,359 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 68 [2019-12-27 18:11:52,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:11:52,375 INFO L225 Difference]: With dead ends: 12283 [2019-12-27 18:11:52,375 INFO L226 Difference]: Without dead ends: 12258 [2019-12-27 18:11:52,376 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 10 SyntacticMatches, 21 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1261 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=630, Invalid=3660, Unknown=0, NotChecked=0, Total=4290 [2019-12-27 18:11:52,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12258 states. [2019-12-27 18:11:52,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12258 to 4389. [2019-12-27 18:11:52,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4389 states. [2019-12-27 18:11:52,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4389 states to 4389 states and 12291 transitions. [2019-12-27 18:11:52,474 INFO L78 Accepts]: Start accepts. Automaton has 4389 states and 12291 transitions. Word has length 68 [2019-12-27 18:11:52,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:11:52,474 INFO L462 AbstractCegarLoop]: Abstraction has 4389 states and 12291 transitions. [2019-12-27 18:11:52,475 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-12-27 18:11:52,475 INFO L276 IsEmpty]: Start isEmpty. Operand 4389 states and 12291 transitions. [2019-12-27 18:11:52,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 18:11:52,479 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:11:52,479 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:11:52,479 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:11:52,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:11:52,479 INFO L82 PathProgramCache]: Analyzing trace with hash -450226916, now seen corresponding path program 5 times [2019-12-27 18:11:52,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:11:52,480 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812713830] [2019-12-27 18:11:52,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:11:52,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:11:52,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:11:52,829 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812713830] [2019-12-27 18:11:52,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:11:52,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 18:11:52,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2082211969] [2019-12-27 18:11:52,836 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:11:52,855 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:11:53,186 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 277 states and 547 transitions. [2019-12-27 18:11:53,187 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:11:53,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 18:11:53,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 18:11:53,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 18:11:53,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 18:11:54,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 18:11:54,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 18:11:54,186 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 32 [2019-12-27 18:11:54,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 18:11:54,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 18:11:54,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 18:11:54,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 18:11:54,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 18:11:54,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 18:11:54,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 18:11:54,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 18:11:54,421 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 31 [2019-12-27 18:11:54,424 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 34 times. [2019-12-27 18:11:54,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-12-27 18:11:54,425 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:11:54,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-12-27 18:11:54,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=714, Unknown=0, NotChecked=0, Total=812 [2019-12-27 18:11:54,425 INFO L87 Difference]: Start difference. First operand 4389 states and 12291 transitions. Second operand 29 states. [2019-12-27 18:11:58,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:11:58,597 INFO L93 Difference]: Finished difference Result 10929 states and 30199 transitions. [2019-12-27 18:11:58,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-12-27 18:11:58,598 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 68 [2019-12-27 18:11:58,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:11:58,617 INFO L225 Difference]: With dead ends: 10929 [2019-12-27 18:11:58,617 INFO L226 Difference]: Without dead ends: 10904 [2019-12-27 18:11:58,619 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 10 SyntacticMatches, 14 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 778 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=591, Invalid=2715, Unknown=0, NotChecked=0, Total=3306 [2019-12-27 18:11:58,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10904 states. [2019-12-27 18:11:58,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10904 to 4552. [2019-12-27 18:11:58,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4552 states. [2019-12-27 18:11:58,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4552 states to 4552 states and 12811 transitions. [2019-12-27 18:11:58,758 INFO L78 Accepts]: Start accepts. Automaton has 4552 states and 12811 transitions. Word has length 68 [2019-12-27 18:11:58,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:11:58,759 INFO L462 AbstractCegarLoop]: Abstraction has 4552 states and 12811 transitions. [2019-12-27 18:11:58,759 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-12-27 18:11:58,759 INFO L276 IsEmpty]: Start isEmpty. Operand 4552 states and 12811 transitions. [2019-12-27 18:11:58,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 18:11:58,765 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:11:58,765 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:11:58,766 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:11:58,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:11:58,766 INFO L82 PathProgramCache]: Analyzing trace with hash 932771090, now seen corresponding path program 6 times [2019-12-27 18:11:58,767 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:11:58,767 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776893641] [2019-12-27 18:11:58,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:11:58,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:11:59,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:11:59,270 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776893641] [2019-12-27 18:11:59,270 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:11:59,271 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-27 18:11:59,271 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [123110554] [2019-12-27 18:11:59,271 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:11:59,304 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:11:59,634 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 260 states and 513 transitions. [2019-12-27 18:11:59,634 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:11:59,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 18:12:00,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 18:12:00,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 18:12:00,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 18:12:00,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 18:12:00,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 18:12:00,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 18:12:00,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 18:12:00,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 18:12:00,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 18:12:00,996 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2019-12-27 18:12:00,997 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 42 times. [2019-12-27 18:12:00,997 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-12-27 18:12:00,997 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:12:00,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-12-27 18:12:00,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=890, Unknown=0, NotChecked=0, Total=992 [2019-12-27 18:12:00,999 INFO L87 Difference]: Start difference. First operand 4552 states and 12811 transitions. Second operand 32 states. [2019-12-27 18:12:05,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:12:05,891 INFO L93 Difference]: Finished difference Result 10691 states and 29571 transitions. [2019-12-27 18:12:05,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-12-27 18:12:05,892 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 68 [2019-12-27 18:12:05,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:12:05,905 INFO L225 Difference]: With dead ends: 10691 [2019-12-27 18:12:05,905 INFO L226 Difference]: Without dead ends: 10666 [2019-12-27 18:12:05,906 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 13 SyntacticMatches, 18 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1213 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=833, Invalid=3997, Unknown=0, NotChecked=0, Total=4830 [2019-12-27 18:12:05,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10666 states. [2019-12-27 18:12:05,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10666 to 4505. [2019-12-27 18:12:05,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4505 states. [2019-12-27 18:12:05,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4505 states to 4505 states and 12669 transitions. [2019-12-27 18:12:05,991 INFO L78 Accepts]: Start accepts. Automaton has 4505 states and 12669 transitions. Word has length 68 [2019-12-27 18:12:05,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:12:05,991 INFO L462 AbstractCegarLoop]: Abstraction has 4505 states and 12669 transitions. [2019-12-27 18:12:05,991 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-12-27 18:12:05,991 INFO L276 IsEmpty]: Start isEmpty. Operand 4505 states and 12669 transitions. [2019-12-27 18:12:05,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 18:12:05,996 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:12:05,996 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:12:05,996 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:12:05,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:12:05,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1425961288, now seen corresponding path program 7 times [2019-12-27 18:12:05,997 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:12:05,997 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942810522] [2019-12-27 18:12:05,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:12:06,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:12:06,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:12:06,251 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942810522] [2019-12-27 18:12:06,251 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:12:06,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 18:12:06,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1266349552] [2019-12-27 18:12:06,251 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:12:06,265 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:12:06,474 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 232 states and 443 transitions. [2019-12-27 18:12:06,474 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:12:07,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 18:12:07,071 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 31 times. [2019-12-27 18:12:07,071 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-27 18:12:07,072 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:12:07,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-27 18:12:07,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2019-12-27 18:12:07,072 INFO L87 Difference]: Start difference. First operand 4505 states and 12669 transitions. Second operand 22 states. [2019-12-27 18:12:08,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:12:08,610 INFO L93 Difference]: Finished difference Result 6381 states and 17727 transitions. [2019-12-27 18:12:08,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-27 18:12:08,610 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 68 [2019-12-27 18:12:08,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:12:08,619 INFO L225 Difference]: With dead ends: 6381 [2019-12-27 18:12:08,619 INFO L226 Difference]: Without dead ends: 6356 [2019-12-27 18:12:08,620 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 11 SyntacticMatches, 15 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 439 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=401, Invalid=1491, Unknown=0, NotChecked=0, Total=1892 [2019-12-27 18:12:08,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6356 states. [2019-12-27 18:12:08,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6356 to 4062. [2019-12-27 18:12:08,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4062 states. [2019-12-27 18:12:08,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4062 states to 4062 states and 11322 transitions. [2019-12-27 18:12:08,688 INFO L78 Accepts]: Start accepts. Automaton has 4062 states and 11322 transitions. Word has length 68 [2019-12-27 18:12:08,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:12:08,688 INFO L462 AbstractCegarLoop]: Abstraction has 4062 states and 11322 transitions. [2019-12-27 18:12:08,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-27 18:12:08,689 INFO L276 IsEmpty]: Start isEmpty. Operand 4062 states and 11322 transitions. [2019-12-27 18:12:08,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 18:12:08,694 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:12:08,694 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:12:08,694 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:12:08,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:12:08,695 INFO L82 PathProgramCache]: Analyzing trace with hash 2056032048, now seen corresponding path program 8 times [2019-12-27 18:12:08,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:12:08,697 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398531823] [2019-12-27 18:12:08,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:12:08,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 18:12:08,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 18:12:08,833 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 18:12:08,833 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 18:12:08,838 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] ULTIMATE.startENTRY-->L807: Formula: (let ((.cse0 (store |v_#valid_66| 0 0))) (and (= 0 v_~__unbuffered_p2_EAX~0_40) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1976~0.base_23| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1976~0.base_23|) |v_ULTIMATE.start_main_~#t1976~0.offset_17| 0)) |v_#memory_int_23|) (= v_~z$r_buff1_thd0~0_289 0) (= v_~z$r_buff0_thd1~0_194 0) (= v_~z$mem_tmp~0_22 0) (= v_~z$w_buff0~0_192 0) (= 0 v_~weak$$choice0~0_14) (= v_~z~0_201 0) (= 0 v_~__unbuffered_p1_EAX~0_42) (= v_~y~0_14 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1976~0.base_23|)) (= v_~main$tmp_guard1~0_48 0) (= |v_#NULL.offset_3| 0) (= v_~z$w_buff0_used~0_745 0) (= v_~z$r_buff0_thd0~0_352 0) (= 0 v_~z$r_buff0_thd3~0_106) (= 0 |v_ULTIMATE.start_main_~#t1976~0.offset_17|) (= v_~z$w_buff1_used~0_381 0) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t1976~0.base_23| 4)) (= v_~main$tmp_guard0~0_23 0) (= v_~z$read_delayed_var~0.offset_7 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~z$r_buff1_thd1~0_172 0) (= v_~__unbuffered_cnt~0_156 0) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (= 0 v_~z$flush_delayed~0_41) (= |v_#valid_64| (store .cse0 |v_ULTIMATE.start_main_~#t1976~0.base_23| 1)) (= v_~z$w_buff1~0_171 0) (= 0 v_~x~0_113) (= 0 |v_#NULL.base_3|) (= v_~weak$$choice2~0_111 0) (= v_~z$r_buff0_thd2~0_100 0) (= v_~z$r_buff1_thd2~0_185 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t1976~0.base_23|) (= 0 v_~z$r_buff1_thd3~0_186))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_20|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_26|, ULTIMATE.start_main_~#t1977~0.offset=|v_ULTIMATE.start_main_~#t1977~0.offset_16|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_185, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_34|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_27|, #NULL.offset=|v_#NULL.offset_3|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_24|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_72|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_42|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_24|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_72|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_35|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_352, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_42, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_40, ~z$mem_tmp~0=v_~z$mem_tmp~0_22, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_9|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_28|, ULTIMATE.start_main_~#t1976~0.base=|v_ULTIMATE.start_main_~#t1976~0.base_23|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_41|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_381, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_39|, ~z$flush_delayed~0=v_~z$flush_delayed~0_41, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_74|, ~weak$$choice0~0=v_~weak$$choice0~0_14, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_149|, ULTIMATE.start_main_~#t1976~0.offset=|v_ULTIMATE.start_main_~#t1976~0.offset_17|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_172, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_106, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_156, ~x~0=v_~x~0_113, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_20|, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_32|, ULTIMATE.start_main_~#t1977~0.base=|v_ULTIMATE.start_main_~#t1977~0.base_21|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_28|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_25|, ~z$w_buff1~0=v_~z$w_buff1~0_171, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_48, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_32|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_28|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_260|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_40|, ULTIMATE.start_main_~#t1978~0.offset=|v_ULTIMATE.start_main_~#t1978~0.offset_16|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_74|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_289, ~y~0=v_~y~0_14, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_100, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_8|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_22|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_745, ~z$w_buff0~0=v_~z$w_buff0~0_192, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_186, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_24|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_43|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_23, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_44|, #NULL.base=|v_#NULL.base_3|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_41|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_149|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_23|, ~z~0=v_~z~0_201, ~weak$$choice2~0=v_~weak$$choice2~0_111, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_194, ULTIMATE.start_main_~#t1978~0.base=|v_ULTIMATE.start_main_~#t1978~0.base_20|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet30, ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_~#t1977~0.offset, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_~#t1976~0.base, ULTIMATE.start_main_#t~ite35, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_~#t1976~0.offset, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_#t~nondet31, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_~#t1977~0.base, ~z$read_delayed~0, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t1978~0.offset, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_#t~nondet23, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, 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, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ULTIMATE.start_main_~#t1978~0.base] because there is no mapped edge [2019-12-27 18:12:08,838 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [802] [802] L807-1-->L809: Formula: (and (= |v_#valid_35| (store |v_#valid_36| |v_ULTIMATE.start_main_~#t1977~0.base_11| 1)) (not (= |v_ULTIMATE.start_main_~#t1977~0.base_11| 0)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1977~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1977~0.base_11|) |v_ULTIMATE.start_main_~#t1977~0.offset_10| 1)) |v_#memory_int_15|) (= |v_ULTIMATE.start_main_~#t1977~0.offset_10| 0) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1977~0.base_11|) (= 0 (select |v_#valid_36| |v_ULTIMATE.start_main_~#t1977~0.base_11|)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1977~0.base_11| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_4|, ULTIMATE.start_main_~#t1977~0.base=|v_ULTIMATE.start_main_~#t1977~0.base_11|, ULTIMATE.start_main_~#t1977~0.offset=|v_ULTIMATE.start_main_~#t1977~0.offset_10|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_~#t1977~0.base, ULTIMATE.start_main_~#t1977~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 18:12:08,839 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] P0ENTRY-->L4-3: Formula: (and (= v_~z$w_buff0~0_42 v_~z$w_buff1~0_28) (= v_P0Thread1of1ForFork0_~arg.offset_8 |v_P0Thread1of1ForFork0_#in~arg.offset_8|) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_12 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_8|) (= v_P0Thread1of1ForFork0_~arg.base_8 |v_P0Thread1of1ForFork0_#in~arg.base_8|) (= 0 (mod v_~z$w_buff1_used~0_97 256)) (= 1 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_8|) (= v_~z$w_buff0_used~0_207 v_~z$w_buff1_used~0_97) (= v_~z$w_buff0_used~0_206 1) (= 2 v_~z$w_buff0~0_41)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_8|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_207, ~z$w_buff0~0=v_~z$w_buff0~0_42, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_8|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_8|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_206, ~z$w_buff0~0=v_~z$w_buff0~0_41, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_12, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_97, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_8|, ~z$w_buff1~0=v_~z$w_buff1~0_28, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_8, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_8|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_8} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1_used~0, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-27 18:12:08,841 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L809-1-->L811: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t1978~0.base_12|)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1978~0.base_12| 4)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1978~0.base_12|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1978~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1978~0.base_12|) |v_ULTIMATE.start_main_~#t1978~0.offset_10| 2)) |v_#memory_int_13|) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t1978~0.base_12| 1)) (= (select |v_#valid_32| |v_ULTIMATE.start_main_~#t1978~0.base_12|) 0) (= |v_ULTIMATE.start_main_~#t1978~0.offset_10| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t1978~0.offset=|v_ULTIMATE.start_main_~#t1978~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_5|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|, ULTIMATE.start_main_~#t1978~0.base=|v_ULTIMATE.start_main_~#t1978~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1978~0.offset, ULTIMATE.start_main_#t~nondet22, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1978~0.base] because there is no mapped edge [2019-12-27 18:12:08,841 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L745-->L745-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1553258070 256))) (.cse0 (= (mod ~z$r_buff0_thd1~0_In-1553258070 256) 0))) (or (and (= ~z$w_buff0_used~0_In-1553258070 |P0Thread1of1ForFork0_#t~ite5_Out-1553258070|) (or .cse0 .cse1)) (and (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-1553258070|) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1553258070, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1553258070} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1553258070|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1553258070, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1553258070} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 18:12:08,842 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L746-->L746-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-935326464 256))) (.cse0 (= (mod ~z$r_buff0_thd1~0_In-935326464 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd1~0_In-935326464 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-935326464 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out-935326464| 0)) (and (= ~z$w_buff1_used~0_In-935326464 |P0Thread1of1ForFork0_#t~ite6_Out-935326464|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-935326464, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-935326464, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-935326464, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-935326464} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-935326464|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-935326464, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-935326464, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-935326464, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-935326464} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 18:12:08,842 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L747-->L748: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-548012287 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In-548012287 256)))) (or (and (= ~z$r_buff0_thd1~0_Out-548012287 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd1~0_Out-548012287 ~z$r_buff0_thd1~0_In-548012287)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-548012287, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-548012287} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-548012287, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-548012287|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-548012287} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 18:12:08,843 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L748-->L748-2: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In-1889305865 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd1~0_In-1889305865 256))) (.cse2 (= (mod ~z$r_buff0_thd1~0_In-1889305865 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-1889305865 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-1889305865|)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite8_Out-1889305865| ~z$r_buff1_thd1~0_In-1889305865)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1889305865, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1889305865, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1889305865, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1889305865} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1889305865, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1889305865|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1889305865, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1889305865, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1889305865} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 18:12:08,843 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [793] [793] L748-2-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_66 1) v_~__unbuffered_cnt~0_65) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~z$r_buff1_thd1~0_64 |v_P0Thread1of1ForFork0_#t~ite8_44|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_44|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_66} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_43|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_64, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_65} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 18:12:08,844 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L764-2-->L764-4: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd2~0_In-222198550 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In-222198550 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite9_Out-222198550| ~z~0_In-222198550)) (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite9_Out-222198550| ~z$w_buff1~0_In-222198550)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-222198550, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-222198550, ~z$w_buff1~0=~z$w_buff1~0_In-222198550, ~z~0=~z~0_In-222198550} OutVars{P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-222198550|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-222198550, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-222198550, ~z$w_buff1~0=~z$w_buff1~0_In-222198550, ~z~0=~z~0_In-222198550} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-12-27 18:12:08,845 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L764-4-->L765: Formula: (= v_~z~0_33 |v_P1Thread1of1ForFork1_#t~ite9_16|) InVars {P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_16|} OutVars{P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_15|, P1Thread1of1ForFork1_#t~ite10=|v_P1Thread1of1ForFork1_#t~ite10_21|, ~z~0=v_~z~0_33} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10, ~z~0] because there is no mapped edge [2019-12-27 18:12:08,845 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L765-->L765-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In1625510417 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In1625510417 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite11_Out1625510417|)) (and (= ~z$w_buff0_used~0_In1625510417 |P1Thread1of1ForFork1_#t~ite11_Out1625510417|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1625510417, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1625510417} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1625510417, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out1625510417|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1625510417} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 18:12:08,846 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L784-2-->L784-4: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In-930689084 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd3~0_In-930689084 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite15_Out-930689084| ~z$w_buff1~0_In-930689084) (not .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite15_Out-930689084| ~z~0_In-930689084) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-930689084, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-930689084, ~z$w_buff1~0=~z$w_buff1~0_In-930689084, ~z~0=~z~0_In-930689084} OutVars{P2Thread1of1ForFork2_#t~ite15=|P2Thread1of1ForFork2_#t~ite15_Out-930689084|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-930689084, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-930689084, ~z$w_buff1~0=~z$w_buff1~0_In-930689084, ~z~0=~z~0_In-930689084} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-27 18:12:08,846 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L766-->L766-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In-1990830204 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd2~0_In-1990830204 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-1990830204 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd2~0_In-1990830204 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite12_Out-1990830204|)) (and (= ~z$w_buff1_used~0_In-1990830204 |P1Thread1of1ForFork1_#t~ite12_Out-1990830204|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1990830204, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1990830204, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1990830204, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1990830204} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1990830204, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1990830204, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1990830204, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-1990830204|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1990830204} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 18:12:08,846 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L767-->L767-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd2~0_In-1693875643 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1693875643 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite13_Out-1693875643| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite13_Out-1693875643| ~z$r_buff0_thd2~0_In-1693875643)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1693875643, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1693875643} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1693875643, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-1693875643|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1693875643} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-27 18:12:08,847 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L784-4-->L785: Formula: (= v_~z~0_45 |v_P2Thread1of1ForFork2_#t~ite15_10|) InVars {P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_10|} OutVars{P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_9|, ~z~0=v_~z~0_45, P2Thread1of1ForFork2_#t~ite16=|v_P2Thread1of1ForFork2_#t~ite16_15|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15, ~z~0, P2Thread1of1ForFork2_#t~ite16] because there is no mapped edge [2019-12-27 18:12:08,847 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L785-->L785-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1398818655 256))) (.cse0 (= (mod ~z$r_buff0_thd3~0_In-1398818655 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite17_Out-1398818655| ~z$w_buff0_used~0_In-1398818655) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P2Thread1of1ForFork2_#t~ite17_Out-1398818655|) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1398818655, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1398818655} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1398818655, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1398818655, P2Thread1of1ForFork2_#t~ite17=|P2Thread1of1ForFork2_#t~ite17_Out-1398818655|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-27 18:12:08,847 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L786-->L786-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff0_thd3~0_In649045486 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In649045486 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In649045486 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In649045486 256)))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite18_Out649045486|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$w_buff1_used~0_In649045486 |P2Thread1of1ForFork2_#t~ite18_Out649045486|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In649045486, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In649045486, ~z$w_buff1_used~0=~z$w_buff1_used~0_In649045486, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In649045486} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In649045486, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In649045486, ~z$w_buff1_used~0=~z$w_buff1_used~0_In649045486, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In649045486, P2Thread1of1ForFork2_#t~ite18=|P2Thread1of1ForFork2_#t~ite18_Out649045486|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite18] because there is no mapped edge [2019-12-27 18:12:08,848 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L787-->L787-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1255876891 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1255876891 256)))) (or (and (= ~z$r_buff0_thd3~0_In-1255876891 |P2Thread1of1ForFork2_#t~ite19_Out-1255876891|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P2Thread1of1ForFork2_#t~ite19_Out-1255876891|) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1255876891, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1255876891} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1255876891, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1255876891, P2Thread1of1ForFork2_#t~ite19=|P2Thread1of1ForFork2_#t~ite19_Out-1255876891|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite19] because there is no mapped edge [2019-12-27 18:12:08,849 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] L788-->L788-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In1743073626 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In1743073626 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd3~0_In1743073626 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In1743073626 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite20_Out1743073626| 0)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~z$r_buff1_thd3~0_In1743073626 |P2Thread1of1ForFork2_#t~ite20_Out1743073626|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1743073626, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1743073626, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1743073626, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1743073626} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1743073626, P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out1743073626|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1743073626, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1743073626, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1743073626} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20] because there is no mapped edge [2019-12-27 18:12:08,849 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L788-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#t~ite20_34| v_~z$r_buff1_thd3~0_66) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_73 1) v_~__unbuffered_cnt~0_72)) InVars {P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_73} OutVars{P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_33|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_66, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_72, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20, ~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-27 18:12:08,849 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L768-->L768-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff0_thd2~0_In1639958359 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In1639958359 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In1639958359 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In1639958359 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite14_Out1639958359| ~z$r_buff1_thd2~0_In1639958359)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P1Thread1of1ForFork1_#t~ite14_Out1639958359| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1639958359, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1639958359, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1639958359, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1639958359} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1639958359, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1639958359, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1639958359, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out1639958359|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1639958359} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 18:12:08,849 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L768-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= |v_P1Thread1of1ForFork1_#t~ite14_30| v_~z$r_buff1_thd2~0_54) (= (+ v_~__unbuffered_cnt~0_38 1) v_~__unbuffered_cnt~0_37) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_30|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_54, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_37, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_29|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 18:12:08,849 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L811-1-->L817: Formula: (and (= 3 v_~__unbuffered_cnt~0_13) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet23, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 18:12:08,850 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L817-2-->L817-4: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In1990560006 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In1990560006 256) 0))) (or (and (or .cse0 .cse1) (= ~z~0_In1990560006 |ULTIMATE.start_main_#t~ite24_Out1990560006|)) (and (not .cse0) (not .cse1) (= ~z$w_buff1~0_In1990560006 |ULTIMATE.start_main_#t~ite24_Out1990560006|)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1990560006, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1990560006, ~z$w_buff1~0=~z$w_buff1~0_In1990560006, ~z~0=~z~0_In1990560006} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1990560006, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out1990560006|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1990560006, ~z$w_buff1~0=~z$w_buff1~0_In1990560006, ~z~0=~z~0_In1990560006} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24] because there is no mapped edge [2019-12-27 18:12:08,850 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L817-4-->L818: Formula: (= v_~z~0_21 |v_ULTIMATE.start_main_#t~ite24_9|) InVars {ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_9|} OutVars{ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_8|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_12|, ~z~0=v_~z~0_21} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25, ~z~0] because there is no mapped edge [2019-12-27 18:12:08,850 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L818-->L818-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-920561288 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-920561288 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite26_Out-920561288|)) (and (= |ULTIMATE.start_main_#t~ite26_Out-920561288| ~z$w_buff0_used~0_In-920561288) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-920561288, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-920561288} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-920561288, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-920561288, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out-920561288|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite26] because there is no mapped edge [2019-12-27 18:12:08,851 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L819-->L819-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1430106758 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In-1430106758 256))) (.cse1 (= (mod ~z$r_buff1_thd0~0_In-1430106758 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In-1430106758 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite27_Out-1430106758| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite27_Out-1430106758| ~z$w_buff1_used~0_In-1430106758) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1430106758, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1430106758, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1430106758, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1430106758} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1430106758, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1430106758, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1430106758, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1430106758, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out-1430106758|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite27] because there is no mapped edge [2019-12-27 18:12:08,852 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [780] [780] L820-->L820-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1793640074 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In1793640074 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite28_Out1793640074|)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite28_Out1793640074| ~z$r_buff0_thd0~0_In1793640074)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1793640074, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1793640074} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1793640074, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out1793640074|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1793640074} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28] because there is no mapped edge [2019-12-27 18:12:08,852 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L821-->L821-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In-1214504291 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd0~0_In-1214504291 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In-1214504291 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In-1214504291 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite29_Out-1214504291| ~z$r_buff1_thd0~0_In-1214504291) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite29_Out-1214504291| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1214504291, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1214504291, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1214504291, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1214504291} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1214504291, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-1214504291|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1214504291, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1214504291, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1214504291} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-27 18:12:08,856 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L833-->L834: Formula: (and (= v_~z$r_buff0_thd0~0_167 v_~z$r_buff0_thd0~0_166) (not (= (mod v_~weak$$choice2~0_39 256) 0))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_167, ~weak$$choice2~0=v_~weak$$choice2~0_39} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_166, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_10|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_11|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_8|, ~weak$$choice2~0=v_~weak$$choice2~0_39} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 18:12:08,857 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] L836-->L4: Formula: (and (= v_~z$mem_tmp~0_13 v_~z~0_134) (= 0 v_~z$flush_delayed~0_22) (= (mod v_~main$tmp_guard1~0_32 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|) (not (= (mod v_~z$flush_delayed~0_23 256) 0))) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_13, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_32, ~z$flush_delayed~0=v_~z$flush_delayed~0_23} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_13, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_17|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_9, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_32, ~z$flush_delayed~0=v_~z$flush_delayed~0_22, ~z~0=v_~z~0_134, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$flush_delayed~0, ~z~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 18:12:08,858 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [805] [805] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 18:12:08,973 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 06:12:08 BasicIcfg [2019-12-27 18:12:08,973 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 18:12:08,976 INFO L168 Benchmark]: Toolchain (without parser) took 119769.53 ms. Allocated memory was 138.9 MB in the beginning and 3.6 GB in the end (delta: 3.4 GB). Free memory was 102.2 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2019-12-27 18:12:08,977 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-27 18:12:08,978 INFO L168 Benchmark]: CACSL2BoogieTranslator took 773.93 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 101.8 MB in the beginning and 157.3 MB in the end (delta: -55.5 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. [2019-12-27 18:12:08,978 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.02 ms. Allocated memory is still 203.4 MB. Free memory was 156.6 MB in the beginning and 154.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 18:12:08,979 INFO L168 Benchmark]: Boogie Preprocessor took 46.91 ms. Allocated memory is still 203.4 MB. Free memory was 154.0 MB in the beginning and 151.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 18:12:08,979 INFO L168 Benchmark]: RCFGBuilder took 831.51 ms. Allocated memory is still 203.4 MB. Free memory was 151.3 MB in the beginning and 101.6 MB in the end (delta: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 7.1 GB. [2019-12-27 18:12:08,980 INFO L168 Benchmark]: TraceAbstraction took 118042.29 ms. Allocated memory was 203.4 MB in the beginning and 3.6 GB in the end (delta: 3.4 GB). Free memory was 100.9 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2019-12-27 18:12:08,983 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.24 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 773.93 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 101.8 MB in the beginning and 157.3 MB in the end (delta: -55.5 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 70.02 ms. Allocated memory is still 203.4 MB. Free memory was 156.6 MB in the beginning and 154.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 46.91 ms. Allocated memory is still 203.4 MB. Free memory was 154.0 MB in the beginning and 151.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 831.51 ms. Allocated memory is still 203.4 MB. Free memory was 151.3 MB in the beginning and 101.6 MB in the end (delta: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 118042.29 ms. Allocated memory was 203.4 MB in the beginning and 3.6 GB in the end (delta: 3.4 GB). Free memory was 100.9 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.3s, 175 ProgramPointsBefore, 95 ProgramPointsAfterwards, 212 TransitionsBefore, 106 TransitionsAfterwards, 17114 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 30 ChoiceCompositions, 5490 VarBasedMoverChecksPositive, 229 VarBasedMoverChecksNegative, 63 SemBasedMoverChecksPositive, 239 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.4s, 0 MoverChecksTotal, 80053 CheckedPairsTotal, 112 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L807] FCALL, FORK 0 pthread_create(&t1976, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L734] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L735] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L736] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L737] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L738] 1 z$r_buff0_thd1 = (_Bool)1 [L741] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L809] FCALL, FORK 0 pthread_create(&t1977, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L745] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L746] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L811] FCALL, FORK 0 pthread_create(&t1978, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L758] 2 __unbuffered_p1_EAX = x [L761] 2 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L778] 3 __unbuffered_p2_EAX = y [L781] 3 z = 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=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, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=2] [L784] 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=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, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L765] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L766] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L767] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L785] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L786] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L787] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L817] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=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=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L818] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L819] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L820] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L821] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L824] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L825] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L826] 0 z$flush_delayed = weak$$choice2 [L827] 0 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=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=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L828] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=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=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L828] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L829] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=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=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L829] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L830] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=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=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L830] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L831] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=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=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L831] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L832] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=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=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L832] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L834] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=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=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L834] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L835] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=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=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 166 locations, 2 error locations. Result: UNSAFE, OverallTime: 117.7s, OverallIterations: 21, TraceHistogramMax: 1, AutomataDifference: 40.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3164 SDtfs, 5521 SDslu, 15591 SDs, 0 SdLazy, 15506 SolverSat, 585 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 18.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 577 GetRequests, 107 SyntacticMatches, 116 SemanticMatches, 354 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4172 ImplicationChecksByTransitivity, 11.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=192396occurred 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: 40.6s AutomataMinimizationTime, 20 MinimizatonAttempts, 102469 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 1061 NumberOfCodeBlocks, 1061 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 973 ConstructedInterpolants, 0 QuantifiedInterpolants, 322600 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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...