/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-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix047_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 21:35:53,557 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 21:35:53,560 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 21:35:53,572 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 21:35:53,573 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 21:35:53,574 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 21:35:53,575 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 21:35:53,577 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 21:35:53,579 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 21:35:53,580 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 21:35:53,581 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 21:35:53,582 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 21:35:53,582 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 21:35:53,584 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 21:35:53,585 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 21:35:53,586 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 21:35:53,586 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 21:35:53,587 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 21:35:53,589 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 21:35:53,591 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 21:35:53,593 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 21:35:53,594 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 21:35:53,596 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 21:35:53,596 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 21:35:53,599 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 21:35:53,599 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 21:35:53,600 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 21:35:53,601 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 21:35:53,601 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 21:35:53,602 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 21:35:53,602 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 21:35:53,603 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 21:35:53,604 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 21:35:53,605 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 21:35:53,606 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 21:35:53,606 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 21:35:53,606 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 21:35:53,607 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 21:35:53,607 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 21:35:53,608 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 21:35:53,609 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 21:35:53,609 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-VariableLbe.epf [2019-12-18 21:35:53,625 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 21:35:53,625 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 21:35:53,627 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 21:35:53,627 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 21:35:53,627 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 21:35:53,627 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 21:35:53,627 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 21:35:53,628 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 21:35:53,628 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 21:35:53,628 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 21:35:53,628 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 21:35:53,628 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 21:35:53,629 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 21:35:53,629 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 21:35:53,629 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 21:35:53,629 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 21:35:53,629 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 21:35:53,630 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 21:35:53,630 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 21:35:53,630 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 21:35:53,630 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 21:35:53,630 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 21:35:53,631 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 21:35:53,631 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 21:35:53,631 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 21:35:53,631 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 21:35:53,632 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 21:35:53,632 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 21:35:53,632 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 21:35:53,632 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 21:35:53,935 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 21:35:53,949 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 21:35:53,952 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 21:35:53,953 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 21:35:53,954 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 21:35:53,955 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix047_tso.opt.i [2019-12-18 21:35:54,027 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11dcb2526/e38bff8a4e104fd7a33893c1faaebcd8/FLAG08cfd83a9 [2019-12-18 21:35:54,616 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 21:35:54,617 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix047_tso.opt.i [2019-12-18 21:35:54,641 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11dcb2526/e38bff8a4e104fd7a33893c1faaebcd8/FLAG08cfd83a9 [2019-12-18 21:35:54,906 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11dcb2526/e38bff8a4e104fd7a33893c1faaebcd8 [2019-12-18 21:35:54,916 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 21:35:54,918 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 21:35:54,918 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 21:35:54,919 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 21:35:54,922 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 21:35:54,923 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:35:54" (1/1) ... [2019-12-18 21:35:54,926 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2983cbdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:35:54, skipping insertion in model container [2019-12-18 21:35:54,927 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:35:54" (1/1) ... [2019-12-18 21:35:54,934 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 21:35:54,997 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 21:35:55,572 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:35:55,591 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 21:35:55,678 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:35:55,762 INFO L208 MainTranslator]: Completed translation [2019-12-18 21:35:55,762 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:35:55 WrapperNode [2019-12-18 21:35:55,762 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 21:35:55,763 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 21:35:55,763 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 21:35:55,764 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 21:35:55,772 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:35:55" (1/1) ... [2019-12-18 21:35:55,798 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:35:55" (1/1) ... [2019-12-18 21:35:55,842 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 21:35:55,842 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 21:35:55,842 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 21:35:55,843 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 21:35:55,856 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:35:55" (1/1) ... [2019-12-18 21:35:55,856 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:35:55" (1/1) ... [2019-12-18 21:35:55,861 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:35:55" (1/1) ... [2019-12-18 21:35:55,861 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:35:55" (1/1) ... [2019-12-18 21:35:55,872 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:35:55" (1/1) ... [2019-12-18 21:35:55,876 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:35:55" (1/1) ... [2019-12-18 21:35:55,880 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:35:55" (1/1) ... [2019-12-18 21:35:55,885 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 21:35:55,886 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 21:35:55,886 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 21:35:55,886 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 21:35:55,887 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:35:55" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 21:35:55,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 21:35:55,976 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 21:35:55,976 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 21:35:55,977 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 21:35:55,977 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 21:35:55,977 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 21:35:55,977 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 21:35:55,978 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 21:35:55,978 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 21:35:55,978 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 21:35:55,978 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-18 21:35:55,978 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-18 21:35:55,979 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 21:35:55,979 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 21:35:55,979 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 21:35:55,981 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 21:35:56,827 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 21:35:56,828 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 21:35:56,829 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:35:56 BoogieIcfgContainer [2019-12-18 21:35:56,830 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 21:35:56,831 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 21:35:56,831 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 21:35:56,835 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 21:35:56,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 09:35:54" (1/3) ... [2019-12-18 21:35:56,836 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4932b619 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:35:56, skipping insertion in model container [2019-12-18 21:35:56,836 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:35:55" (2/3) ... [2019-12-18 21:35:56,837 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4932b619 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:35:56, skipping insertion in model container [2019-12-18 21:35:56,837 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:35:56" (3/3) ... [2019-12-18 21:35:56,839 INFO L109 eAbstractionObserver]: Analyzing ICFG mix047_tso.opt.i [2019-12-18 21:35:56,847 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 21:35:56,848 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 21:35:56,855 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 21:35:56,856 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 21:35:56,895 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:35:56,896 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:35:56,896 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:35:56,896 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:35:56,897 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:35:56,897 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:35:56,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:35:56,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:35:56,898 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:35:56,898 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:35:56,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:35:56,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:35:56,899 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:35:56,899 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:35:56,899 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:35:56,900 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:35:56,900 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:35:56,900 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:35:56,901 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:35:56,901 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:35:56,901 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:35:56,902 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:35:56,902 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:35:56,902 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:35:56,903 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:35:56,903 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:35:56,903 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:35:56,904 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:35:56,904 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:35:56,904 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:35:56,905 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:35:56,905 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:35:56,905 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:35:56,906 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:35:56,907 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:35:56,907 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:35:56,907 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:35:56,908 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:35:56,909 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:35:56,909 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:35:56,909 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:35:56,910 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:35:56,913 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:35:56,913 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:35:56,913 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:35:56,913 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:35:56,913 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:35:56,914 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:35:56,914 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:35:56,914 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:35:56,914 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:35:56,915 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:35:56,915 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:35:56,916 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:35:56,916 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:35:56,916 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:35:56,917 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:35:56,917 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:35:56,917 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:35:56,917 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:35:56,918 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:35:56,918 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:35:56,918 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:35:56,918 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:35:56,919 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:35:56,919 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:35:56,919 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:35:56,920 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:35:56,920 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:35:56,920 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:35:56,920 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:35:56,921 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:35:56,921 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:35:56,921 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:35:56,921 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:35:56,922 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:35:56,929 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:35:56,930 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:35:56,931 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:35:56,931 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:35:56,936 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:35:56,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:35:56,937 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:35:56,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:35:56,960 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:35:56,960 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:35:56,961 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:35:56,961 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:35:56,961 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:35:56,961 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:35:56,961 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:35:56,962 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:35:56,962 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:35:56,962 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:35:56,966 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:35:56,966 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:35:56,966 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:35:56,966 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:35:56,967 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:35:56,967 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:35:56,968 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:35:56,968 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:35:56,968 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:35:56,968 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:35:56,968 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:35:56,968 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:35:56,984 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-18 21:35:57,002 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 21:35:57,003 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 21:35:57,003 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 21:35:57,003 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 21:35:57,003 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 21:35:57,003 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 21:35:57,003 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 21:35:57,004 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 21:35:57,021 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 180 places, 208 transitions [2019-12-18 21:35:57,023 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 208 transitions [2019-12-18 21:35:57,108 INFO L126 PetriNetUnfolder]: 41/204 cut-off events. [2019-12-18 21:35:57,109 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:35:57,124 INFO L76 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 204 events. 41/204 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 267 event pairs. 12/173 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 21:35:57,148 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 208 transitions [2019-12-18 21:35:57,197 INFO L126 PetriNetUnfolder]: 41/204 cut-off events. [2019-12-18 21:35:57,197 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:35:57,206 INFO L76 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 204 events. 41/204 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 267 event pairs. 12/173 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 21:35:57,223 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12668 [2019-12-18 21:35:57,224 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 21:36:00,935 WARN L192 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-18 21:36:01,069 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-12-18 21:36:01,114 INFO L206 etLargeBlockEncoding]: Checked pairs total: 52826 [2019-12-18 21:36:01,114 INFO L214 etLargeBlockEncoding]: Total number of compositions: 119 [2019-12-18 21:36:01,118 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 92 places, 99 transitions [2019-12-18 21:36:04,254 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 38654 states. [2019-12-18 21:36:04,256 INFO L276 IsEmpty]: Start isEmpty. Operand 38654 states. [2019-12-18 21:36:04,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 21:36:04,263 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:36:04,263 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:36:04,264 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:36:04,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:36:04,269 INFO L82 PathProgramCache]: Analyzing trace with hash -313660218, now seen corresponding path program 1 times [2019-12-18 21:36:04,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:36:04,276 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89495228] [2019-12-18 21:36:04,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:36:04,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:36:04,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:36:04,644 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89495228] [2019-12-18 21:36:04,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:36:04,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 21:36:04,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862011641] [2019-12-18 21:36:04,652 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:36:04,652 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:36:04,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:36:04,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:36:04,665 INFO L87 Difference]: Start difference. First operand 38654 states. Second operand 3 states. [2019-12-18 21:36:05,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:36:05,443 INFO L93 Difference]: Finished difference Result 36046 states and 153176 transitions. [2019-12-18 21:36:05,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:36:05,445 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-18 21:36:05,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:36:05,777 INFO L225 Difference]: With dead ends: 36046 [2019-12-18 21:36:05,777 INFO L226 Difference]: Without dead ends: 35318 [2019-12-18 21:36:05,778 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:36:07,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35318 states. [2019-12-18 21:36:08,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35318 to 35318. [2019-12-18 21:36:08,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35318 states. [2019-12-18 21:36:08,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35318 states to 35318 states and 150208 transitions. [2019-12-18 21:36:08,719 INFO L78 Accepts]: Start accepts. Automaton has 35318 states and 150208 transitions. Word has length 9 [2019-12-18 21:36:08,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:36:08,721 INFO L462 AbstractCegarLoop]: Abstraction has 35318 states and 150208 transitions. [2019-12-18 21:36:08,722 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:36:08,722 INFO L276 IsEmpty]: Start isEmpty. Operand 35318 states and 150208 transitions. [2019-12-18 21:36:08,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 21:36:08,735 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:36:08,735 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:36:08,735 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:36:08,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:36:08,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1224255535, now seen corresponding path program 1 times [2019-12-18 21:36:08,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:36:08,736 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786197953] [2019-12-18 21:36:08,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:36:08,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:36:08,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:36:08,889 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786197953] [2019-12-18 21:36:08,889 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:36:08,889 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:36:08,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365724925] [2019-12-18 21:36:08,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:36:08,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:36:08,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:36:08,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:36:08,893 INFO L87 Difference]: Start difference. First operand 35318 states and 150208 transitions. Second operand 4 states. [2019-12-18 21:36:11,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:36:11,289 INFO L93 Difference]: Finished difference Result 54990 states and 226052 transitions. [2019-12-18 21:36:11,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:36:11,290 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-18 21:36:11,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:36:11,596 INFO L225 Difference]: With dead ends: 54990 [2019-12-18 21:36:11,596 INFO L226 Difference]: Without dead ends: 54962 [2019-12-18 21:36:11,598 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:36:12,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54962 states. [2019-12-18 21:36:13,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54962 to 50002. [2019-12-18 21:36:13,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50002 states. [2019-12-18 21:36:13,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50002 states to 50002 states and 207548 transitions. [2019-12-18 21:36:13,780 INFO L78 Accepts]: Start accepts. Automaton has 50002 states and 207548 transitions. Word has length 15 [2019-12-18 21:36:13,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:36:13,780 INFO L462 AbstractCegarLoop]: Abstraction has 50002 states and 207548 transitions. [2019-12-18 21:36:13,780 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:36:13,780 INFO L276 IsEmpty]: Start isEmpty. Operand 50002 states and 207548 transitions. [2019-12-18 21:36:13,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 21:36:13,783 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:36:13,783 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:36:13,783 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:36:13,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:36:13,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1764776836, now seen corresponding path program 1 times [2019-12-18 21:36:13,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:36:13,784 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92470793] [2019-12-18 21:36:13,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:36:13,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:36:13,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:36:13,828 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92470793] [2019-12-18 21:36:13,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:36:13,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:36:13,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593254060] [2019-12-18 21:36:13,829 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:36:13,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:36:13,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:36:13,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:36:13,830 INFO L87 Difference]: Start difference. First operand 50002 states and 207548 transitions. Second operand 3 states. [2019-12-18 21:36:13,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:36:13,999 INFO L93 Difference]: Finished difference Result 39218 states and 150397 transitions. [2019-12-18 21:36:13,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:36:14,000 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-18 21:36:14,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:36:14,232 INFO L225 Difference]: With dead ends: 39218 [2019-12-18 21:36:14,232 INFO L226 Difference]: Without dead ends: 39218 [2019-12-18 21:36:14,233 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-18 21:36:16,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39218 states. [2019-12-18 21:36:17,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39218 to 39218. [2019-12-18 21:36:17,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39218 states. [2019-12-18 21:36:17,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39218 states to 39218 states and 150397 transitions. [2019-12-18 21:36:17,716 INFO L78 Accepts]: Start accepts. Automaton has 39218 states and 150397 transitions. Word has length 15 [2019-12-18 21:36:17,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:36:17,717 INFO L462 AbstractCegarLoop]: Abstraction has 39218 states and 150397 transitions. [2019-12-18 21:36:17,717 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:36:17,717 INFO L276 IsEmpty]: Start isEmpty. Operand 39218 states and 150397 transitions. [2019-12-18 21:36:17,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 21:36:17,720 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:36:17,720 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:36:17,720 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:36:17,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:36:17,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1883411785, now seen corresponding path program 1 times [2019-12-18 21:36:17,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:36:17,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934659938] [2019-12-18 21:36:17,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:36:17,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:36:17,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:36:17,772 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934659938] [2019-12-18 21:36:17,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:36:17,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:36:17,773 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768989719] [2019-12-18 21:36:17,773 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:36:17,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:36:17,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:36:17,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:36:17,775 INFO L87 Difference]: Start difference. First operand 39218 states and 150397 transitions. Second operand 4 states. [2019-12-18 21:36:17,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:36:17,860 INFO L93 Difference]: Finished difference Result 16304 states and 51852 transitions. [2019-12-18 21:36:17,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:36:17,860 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 21:36:17,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:36:17,895 INFO L225 Difference]: With dead ends: 16304 [2019-12-18 21:36:17,895 INFO L226 Difference]: Without dead ends: 16304 [2019-12-18 21:36:17,895 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-18 21:36:17,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16304 states. [2019-12-18 21:36:18,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16304 to 16304. [2019-12-18 21:36:18,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16304 states. [2019-12-18 21:36:18,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16304 states to 16304 states and 51852 transitions. [2019-12-18 21:36:18,280 INFO L78 Accepts]: Start accepts. Automaton has 16304 states and 51852 transitions. Word has length 16 [2019-12-18 21:36:18,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:36:18,281 INFO L462 AbstractCegarLoop]: Abstraction has 16304 states and 51852 transitions. [2019-12-18 21:36:18,281 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:36:18,281 INFO L276 IsEmpty]: Start isEmpty. Operand 16304 states and 51852 transitions. [2019-12-18 21:36:18,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 21:36:18,283 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:36:18,283 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:36:18,283 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:36:18,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:36:18,284 INFO L82 PathProgramCache]: Analyzing trace with hash 471912602, now seen corresponding path program 1 times [2019-12-18 21:36:18,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:36:18,284 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817547851] [2019-12-18 21:36:18,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:36:18,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:36:18,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:36:18,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817547851] [2019-12-18 21:36:18,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:36:18,332 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:36:18,332 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112115030] [2019-12-18 21:36:18,333 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:36:18,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:36:18,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:36:18,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:36:18,333 INFO L87 Difference]: Start difference. First operand 16304 states and 51852 transitions. Second operand 5 states. [2019-12-18 21:36:18,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:36:18,372 INFO L93 Difference]: Finished difference Result 2786 states and 7200 transitions. [2019-12-18 21:36:18,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:36:18,372 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-18 21:36:18,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:36:18,377 INFO L225 Difference]: With dead ends: 2786 [2019-12-18 21:36:18,377 INFO L226 Difference]: Without dead ends: 2786 [2019-12-18 21:36:18,378 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:36:18,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2786 states. [2019-12-18 21:36:18,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2786 to 2786. [2019-12-18 21:36:18,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2786 states. [2019-12-18 21:36:18,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2786 states to 2786 states and 7200 transitions. [2019-12-18 21:36:18,416 INFO L78 Accepts]: Start accepts. Automaton has 2786 states and 7200 transitions. Word has length 17 [2019-12-18 21:36:18,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:36:18,417 INFO L462 AbstractCegarLoop]: Abstraction has 2786 states and 7200 transitions. [2019-12-18 21:36:18,417 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:36:18,417 INFO L276 IsEmpty]: Start isEmpty. Operand 2786 states and 7200 transitions. [2019-12-18 21:36:18,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-18 21:36:18,421 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:36:18,421 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] [2019-12-18 21:36:18,422 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:36:18,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:36:18,422 INFO L82 PathProgramCache]: Analyzing trace with hash -1539396208, now seen corresponding path program 1 times [2019-12-18 21:36:18,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:36:18,422 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472824251] [2019-12-18 21:36:18,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:36:18,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:36:18,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:36:18,817 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472824251] [2019-12-18 21:36:18,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:36:18,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:36:18,818 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323119459] [2019-12-18 21:36:18,818 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:36:18,820 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:36:18,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:36:18,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:36:18,821 INFO L87 Difference]: Start difference. First operand 2786 states and 7200 transitions. Second operand 6 states. [2019-12-18 21:36:18,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:36:18,872 INFO L93 Difference]: Finished difference Result 1356 states and 3887 transitions. [2019-12-18 21:36:18,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 21:36:18,872 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-12-18 21:36:18,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:36:18,875 INFO L225 Difference]: With dead ends: 1356 [2019-12-18 21:36:18,876 INFO L226 Difference]: Without dead ends: 1356 [2019-12-18 21:36:18,876 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:36:18,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1356 states. [2019-12-18 21:36:18,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1356 to 1216. [2019-12-18 21:36:18,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1216 states. [2019-12-18 21:36:18,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1216 states to 1216 states and 3487 transitions. [2019-12-18 21:36:18,897 INFO L78 Accepts]: Start accepts. Automaton has 1216 states and 3487 transitions. Word has length 29 [2019-12-18 21:36:18,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:36:18,897 INFO L462 AbstractCegarLoop]: Abstraction has 1216 states and 3487 transitions. [2019-12-18 21:36:18,897 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:36:18,898 INFO L276 IsEmpty]: Start isEmpty. Operand 1216 states and 3487 transitions. [2019-12-18 21:36:18,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 21:36:18,904 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:36:18,905 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:36:18,905 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:36:18,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:36:18,913 INFO L82 PathProgramCache]: Analyzing trace with hash -1329665717, now seen corresponding path program 1 times [2019-12-18 21:36:18,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:36:18,913 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509319484] [2019-12-18 21:36:18,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:36:18,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:36:19,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:36:19,018 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509319484] [2019-12-18 21:36:19,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:36:19,019 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:36:19,019 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364761416] [2019-12-18 21:36:19,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:36:19,020 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:36:19,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:36:19,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:36:19,021 INFO L87 Difference]: Start difference. First operand 1216 states and 3487 transitions. Second operand 3 states. [2019-12-18 21:36:19,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:36:19,070 INFO L93 Difference]: Finished difference Result 1224 states and 3495 transitions. [2019-12-18 21:36:19,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:36:19,071 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-18 21:36:19,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:36:19,073 INFO L225 Difference]: With dead ends: 1224 [2019-12-18 21:36:19,074 INFO L226 Difference]: Without dead ends: 1224 [2019-12-18 21:36:19,074 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:36:19,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2019-12-18 21:36:19,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 1219. [2019-12-18 21:36:19,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1219 states. [2019-12-18 21:36:19,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1219 states to 1219 states and 3490 transitions. [2019-12-18 21:36:19,095 INFO L78 Accepts]: Start accepts. Automaton has 1219 states and 3490 transitions. Word has length 58 [2019-12-18 21:36:19,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:36:19,097 INFO L462 AbstractCegarLoop]: Abstraction has 1219 states and 3490 transitions. [2019-12-18 21:36:19,097 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:36:19,097 INFO L276 IsEmpty]: Start isEmpty. Operand 1219 states and 3490 transitions. [2019-12-18 21:36:19,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 21:36:19,101 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:36:19,101 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] [2019-12-18 21:36:19,101 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:36:19,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:36:19,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1606563127, now seen corresponding path program 1 times [2019-12-18 21:36:19,102 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:36:19,102 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388139628] [2019-12-18 21:36:19,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:36:19,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:36:19,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:36:19,237 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388139628] [2019-12-18 21:36:19,237 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:36:19,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:36:19,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070639050] [2019-12-18 21:36:19,238 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:36:19,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:36:19,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:36:19,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:36:19,239 INFO L87 Difference]: Start difference. First operand 1219 states and 3490 transitions. Second operand 5 states. [2019-12-18 21:36:19,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:36:19,510 INFO L93 Difference]: Finished difference Result 1760 states and 5012 transitions. [2019-12-18 21:36:19,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 21:36:19,511 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-12-18 21:36:19,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:36:19,515 INFO L225 Difference]: With dead ends: 1760 [2019-12-18 21:36:19,515 INFO L226 Difference]: Without dead ends: 1760 [2019-12-18 21:36:19,516 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:36:19,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1760 states. [2019-12-18 21:36:19,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1760 to 1415. [2019-12-18 21:36:19,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1415 states. [2019-12-18 21:36:19,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1415 states to 1415 states and 4066 transitions. [2019-12-18 21:36:19,548 INFO L78 Accepts]: Start accepts. Automaton has 1415 states and 4066 transitions. Word has length 58 [2019-12-18 21:36:19,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:36:19,549 INFO L462 AbstractCegarLoop]: Abstraction has 1415 states and 4066 transitions. [2019-12-18 21:36:19,549 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:36:19,549 INFO L276 IsEmpty]: Start isEmpty. Operand 1415 states and 4066 transitions. [2019-12-18 21:36:19,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 21:36:19,555 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:36:19,555 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] [2019-12-18 21:36:19,555 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:36:19,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:36:19,556 INFO L82 PathProgramCache]: Analyzing trace with hash 595510245, now seen corresponding path program 2 times [2019-12-18 21:36:19,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:36:19,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307132913] [2019-12-18 21:36:19,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:36:19,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:36:19,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:36:19,708 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307132913] [2019-12-18 21:36:19,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:36:19,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:36:19,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744433854] [2019-12-18 21:36:19,711 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:36:19,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:36:19,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:36:19,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:36:19,713 INFO L87 Difference]: Start difference. First operand 1415 states and 4066 transitions. Second operand 6 states. [2019-12-18 21:36:20,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:36:20,087 INFO L93 Difference]: Finished difference Result 2366 states and 6730 transitions. [2019-12-18 21:36:20,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 21:36:20,088 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-12-18 21:36:20,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:36:20,094 INFO L225 Difference]: With dead ends: 2366 [2019-12-18 21:36:20,094 INFO L226 Difference]: Without dead ends: 2366 [2019-12-18 21:36:20,094 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-18 21:36:20,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2366 states. [2019-12-18 21:36:20,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2366 to 1499. [2019-12-18 21:36:20,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1499 states. [2019-12-18 21:36:20,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1499 states to 1499 states and 4314 transitions. [2019-12-18 21:36:20,118 INFO L78 Accepts]: Start accepts. Automaton has 1499 states and 4314 transitions. Word has length 58 [2019-12-18 21:36:20,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:36:20,118 INFO L462 AbstractCegarLoop]: Abstraction has 1499 states and 4314 transitions. [2019-12-18 21:36:20,118 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:36:20,118 INFO L276 IsEmpty]: Start isEmpty. Operand 1499 states and 4314 transitions. [2019-12-18 21:36:20,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 21:36:20,123 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:36:20,123 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] [2019-12-18 21:36:20,123 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:36:20,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:36:20,123 INFO L82 PathProgramCache]: Analyzing trace with hash 1233712533, now seen corresponding path program 3 times [2019-12-18 21:36:20,124 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:36:20,124 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576529578] [2019-12-18 21:36:20,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:36:20,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:36:20,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:36:20,199 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576529578] [2019-12-18 21:36:20,200 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:36:20,200 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:36:20,200 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070627318] [2019-12-18 21:36:20,200 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:36:20,201 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:36:20,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:36:20,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:36:20,201 INFO L87 Difference]: Start difference. First operand 1499 states and 4314 transitions. Second operand 3 states. [2019-12-18 21:36:20,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:36:20,247 INFO L93 Difference]: Finished difference Result 1499 states and 4313 transitions. [2019-12-18 21:36:20,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:36:20,247 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-18 21:36:20,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:36:20,250 INFO L225 Difference]: With dead ends: 1499 [2019-12-18 21:36:20,250 INFO L226 Difference]: Without dead ends: 1499 [2019-12-18 21:36:20,251 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:36:20,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1499 states. [2019-12-18 21:36:20,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1499 to 1078. [2019-12-18 21:36:20,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1078 states. [2019-12-18 21:36:20,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1078 states to 1078 states and 3127 transitions. [2019-12-18 21:36:20,272 INFO L78 Accepts]: Start accepts. Automaton has 1078 states and 3127 transitions. Word has length 58 [2019-12-18 21:36:20,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:36:20,272 INFO L462 AbstractCegarLoop]: Abstraction has 1078 states and 3127 transitions. [2019-12-18 21:36:20,273 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:36:20,273 INFO L276 IsEmpty]: Start isEmpty. Operand 1078 states and 3127 transitions. [2019-12-18 21:36:20,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 21:36:20,275 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:36:20,276 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] [2019-12-18 21:36:20,276 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:36:20,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:36:20,276 INFO L82 PathProgramCache]: Analyzing trace with hash 2055576731, now seen corresponding path program 1 times [2019-12-18 21:36:20,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:36:20,277 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36467016] [2019-12-18 21:36:20,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:36:20,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:36:20,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:36:20,448 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36467016] [2019-12-18 21:36:20,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:36:20,449 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:36:20,449 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133030720] [2019-12-18 21:36:20,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:36:20,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:36:20,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:36:20,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:36:20,451 INFO L87 Difference]: Start difference. First operand 1078 states and 3127 transitions. Second operand 7 states. [2019-12-18 21:36:20,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:36:20,607 INFO L93 Difference]: Finished difference Result 2240 states and 6163 transitions. [2019-12-18 21:36:20,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 21:36:20,608 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2019-12-18 21:36:20,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:36:20,612 INFO L225 Difference]: With dead ends: 2240 [2019-12-18 21:36:20,612 INFO L226 Difference]: Without dead ends: 1591 [2019-12-18 21:36:20,612 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-18 21:36:20,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1591 states. [2019-12-18 21:36:20,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1591 to 948. [2019-12-18 21:36:20,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 948 states. [2019-12-18 21:36:20,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 2687 transitions. [2019-12-18 21:36:20,633 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 2687 transitions. Word has length 59 [2019-12-18 21:36:20,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:36:20,633 INFO L462 AbstractCegarLoop]: Abstraction has 948 states and 2687 transitions. [2019-12-18 21:36:20,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:36:20,633 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 2687 transitions. [2019-12-18 21:36:20,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 21:36:20,636 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:36:20,636 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] [2019-12-18 21:36:20,636 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:36:20,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:36:20,637 INFO L82 PathProgramCache]: Analyzing trace with hash -1719937123, now seen corresponding path program 2 times [2019-12-18 21:36:20,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:36:20,638 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086396276] [2019-12-18 21:36:20,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:36:20,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:36:20,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:36:20,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086396276] [2019-12-18 21:36:20,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:36:20,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:36:20,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50524736] [2019-12-18 21:36:20,750 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:36:20,750 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:36:20,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:36:20,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:36:20,751 INFO L87 Difference]: Start difference. First operand 948 states and 2687 transitions. Second operand 3 states. [2019-12-18 21:36:20,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:36:20,766 INFO L93 Difference]: Finished difference Result 892 states and 2459 transitions. [2019-12-18 21:36:20,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:36:20,767 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-18 21:36:20,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:36:20,769 INFO L225 Difference]: With dead ends: 892 [2019-12-18 21:36:20,769 INFO L226 Difference]: Without dead ends: 892 [2019-12-18 21:36:20,769 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:36:20,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892 states. [2019-12-18 21:36:20,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 828. [2019-12-18 21:36:20,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 828 states. [2019-12-18 21:36:20,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 2275 transitions. [2019-12-18 21:36:20,783 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 2275 transitions. Word has length 59 [2019-12-18 21:36:20,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:36:20,784 INFO L462 AbstractCegarLoop]: Abstraction has 828 states and 2275 transitions. [2019-12-18 21:36:20,784 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:36:20,784 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 2275 transitions. [2019-12-18 21:36:20,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 21:36:20,786 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:36:20,786 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:36:20,786 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:36:20,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:36:20,787 INFO L82 PathProgramCache]: Analyzing trace with hash 140492592, now seen corresponding path program 1 times [2019-12-18 21:36:20,787 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:36:20,787 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749551963] [2019-12-18 21:36:20,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:36:20,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:36:20,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:36:20,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749551963] [2019-12-18 21:36:20,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:36:20,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:36:20,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821447086] [2019-12-18 21:36:20,941 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:36:20,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:36:20,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:36:20,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:36:20,942 INFO L87 Difference]: Start difference. First operand 828 states and 2275 transitions. Second operand 6 states. [2019-12-18 21:36:21,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:36:21,033 INFO L93 Difference]: Finished difference Result 1422 states and 3620 transitions. [2019-12-18 21:36:21,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 21:36:21,033 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-12-18 21:36:21,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:36:21,035 INFO L225 Difference]: With dead ends: 1422 [2019-12-18 21:36:21,035 INFO L226 Difference]: Without dead ends: 781 [2019-12-18 21:36:21,036 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-18 21:36:21,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 781 states. [2019-12-18 21:36:21,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 602. [2019-12-18 21:36:21,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2019-12-18 21:36:21,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 1452 transitions. [2019-12-18 21:36:21,047 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 1452 transitions. Word has length 60 [2019-12-18 21:36:21,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:36:21,048 INFO L462 AbstractCegarLoop]: Abstraction has 602 states and 1452 transitions. [2019-12-18 21:36:21,048 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:36:21,048 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 1452 transitions. [2019-12-18 21:36:21,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 21:36:21,050 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:36:21,050 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] [2019-12-18 21:36:21,050 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:36:21,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:36:21,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1587836330, now seen corresponding path program 2 times [2019-12-18 21:36:21,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:36:21,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604949223] [2019-12-18 21:36:21,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:36:21,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:36:21,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:36:21,198 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604949223] [2019-12-18 21:36:21,198 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:36:21,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:36:21,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173286905] [2019-12-18 21:36:21,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:36:21,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:36:21,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:36:21,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:36:21,199 INFO L87 Difference]: Start difference. First operand 602 states and 1452 transitions. Second operand 6 states. [2019-12-18 21:36:21,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:36:21,477 INFO L93 Difference]: Finished difference Result 989 states and 2339 transitions. [2019-12-18 21:36:21,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 21:36:21,477 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-12-18 21:36:21,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:36:21,478 INFO L225 Difference]: With dead ends: 989 [2019-12-18 21:36:21,478 INFO L226 Difference]: Without dead ends: 266 [2019-12-18 21:36:21,479 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-18 21:36:21,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-12-18 21:36:21,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 234. [2019-12-18 21:36:21,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-12-18 21:36:21,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 413 transitions. [2019-12-18 21:36:21,483 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 413 transitions. Word has length 60 [2019-12-18 21:36:21,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:36:21,483 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 413 transitions. [2019-12-18 21:36:21,483 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:36:21,483 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 413 transitions. [2019-12-18 21:36:21,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 21:36:21,484 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:36:21,485 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] [2019-12-18 21:36:21,485 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:36:21,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:36:21,485 INFO L82 PathProgramCache]: Analyzing trace with hash 91372008, now seen corresponding path program 3 times [2019-12-18 21:36:21,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:36:21,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181831218] [2019-12-18 21:36:21,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:36:21,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:36:21,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:36:21,876 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181831218] [2019-12-18 21:36:21,876 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:36:21,876 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 21:36:21,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685142432] [2019-12-18 21:36:21,877 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 21:36:21,877 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:36:21,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 21:36:21,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-18 21:36:21,878 INFO L87 Difference]: Start difference. First operand 234 states and 413 transitions. Second operand 12 states. [2019-12-18 21:36:22,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:36:22,262 INFO L93 Difference]: Finished difference Result 382 states and 655 transitions. [2019-12-18 21:36:22,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 21:36:22,263 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 60 [2019-12-18 21:36:22,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:36:22,263 INFO L225 Difference]: With dead ends: 382 [2019-12-18 21:36:22,264 INFO L226 Difference]: Without dead ends: 352 [2019-12-18 21:36:22,264 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2019-12-18 21:36:22,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2019-12-18 21:36:22,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 342. [2019-12-18 21:36:22,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2019-12-18 21:36:22,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 598 transitions. [2019-12-18 21:36:22,269 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 598 transitions. Word has length 60 [2019-12-18 21:36:22,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:36:22,270 INFO L462 AbstractCegarLoop]: Abstraction has 342 states and 598 transitions. [2019-12-18 21:36:22,270 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 21:36:22,270 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 598 transitions. [2019-12-18 21:36:22,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 21:36:22,271 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:36:22,271 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] [2019-12-18 21:36:22,271 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:36:22,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:36:22,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1093452108, now seen corresponding path program 4 times [2019-12-18 21:36:22,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:36:22,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454937055] [2019-12-18 21:36:22,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:36:22,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:36:22,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:36:22,426 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 21:36:22,428 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 21:36:22,432 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] ULTIMATE.startENTRY-->L831: Formula: (let ((.cse0 (store |v_#valid_73| 0 0))) (and (= v_~z$r_buff0_thd0~0_78 0) (= v_~main$tmp_guard0~0_10 0) (= 0 v_~z$w_buff1~0_25) (= 0 v_~weak$$choice0~0_8) (= v_~z$r_buff1_thd2~0_8 0) (= v_~x~0_14 0) (= 0 v_~a~0_8) (= 0 v_~__unbuffered_p3_EBX~0_11) (= v_~z$r_buff0_thd3~0_20 0) (= v_~z$w_buff0_used~0_104 0) (= v_~z$mem_tmp~0_11 0) (= |v_#NULL.offset_6| 0) (= v_~z$r_buff0_thd1~0_8 0) (= v_~z$r_buff1_thd1~0_8 0) (= 0 v_~__unbuffered_p3_EAX~0_11) (= 0 v_~z$r_buff1_thd4~0_15) (= 0 v_~weak$$choice2~0_34) (= v_~z$read_delayed~0_5 0) (= v_~z$read_delayed_var~0.base_5 0) (= 0 v_~z$r_buff1_thd0~0_51) (= 0 v_~__unbuffered_cnt~0_26) (= 0 v_~z$flush_delayed~0_16) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t1277~0.base_21|) (= v_~z$r_buff0_thd4~0_26 0) (= v_~z$read_delayed_var~0.offset_5 0) (= 0 |v_#NULL.base_6|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1277~0.base_21|)) (= 0 v_~z$r_buff1_thd3~0_15) (< 0 |v_#StackHeapBarrier_20|) (= (store .cse0 |v_ULTIMATE.start_main_~#t1277~0.base_21| 1) |v_#valid_71|) (= v_~z~0_27 0) (= (store |v_#length_30| |v_ULTIMATE.start_main_~#t1277~0.base_21| 4) |v_#length_29|) (= v_~z$r_buff0_thd2~0_9 0) (= 0 v_~z$w_buff0~0_26) (= v_~y~0_11 0) (= v_~main$tmp_guard1~0_13 0) (= v_~b~0_12 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1277~0.base_21| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1277~0.base_21|) |v_ULTIMATE.start_main_~#t1277~0.offset_17| 0)) |v_#memory_int_23|) (= 0 v_~z$w_buff1_used~0_66) (= |v_ULTIMATE.start_main_~#t1277~0.offset_17| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #valid=|v_#valid_73|, #memory_int=|v_#memory_int_24|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_~#t1277~0.base=|v_ULTIMATE.start_main_~#t1277~0.base_21|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_12|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_8, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_10|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_15|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_12|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_17|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_10|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_15|, ULTIMATE.start_main_~#t1280~0.base=|v_ULTIMATE.start_main_~#t1280~0.base_23|, ~a~0=v_~a~0_8, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_78, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_26, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_11, #length=|v_#length_29|, ~z$mem_tmp~0=v_~z$mem_tmp~0_11, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_15|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_13|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_66, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_12|, ~z$flush_delayed~0=v_~z$flush_delayed~0_16, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_14|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_16|, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_20|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_12|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_8, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_9|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_5, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_20, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_26, ~x~0=v_~x~0_14, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_15, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_12|, ~z$read_delayed~0=v_~z$read_delayed~0_5, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_14|, ~z$w_buff1~0=v_~z$w_buff1~0_25, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_12|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_5, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_10|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_16|, ULTIMATE.start_main_~#t1277~0.offset=|v_ULTIMATE.start_main_~#t1277~0.offset_17|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_10|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_13|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_14|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_51, ULTIMATE.start_main_#t~nondet26=|v_ULTIMATE.start_main_#t~nondet26_8|, ~y~0=v_~y~0_11, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_9, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_104, ~z$w_buff0~0=v_~z$w_buff0~0_26, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_12|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_8|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_15, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_15|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_13|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_11, ULTIMATE.start_main_~#t1279~0.offset=|v_ULTIMATE.start_main_~#t1279~0.offset_18|, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_13|, ULTIMATE.start_main_~#t1278~0.base=|v_ULTIMATE.start_main_~#t1278~0.base_23|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_14|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_14|, ULTIMATE.start_main_~#t1279~0.base=|v_ULTIMATE.start_main_~#t1279~0.base_22|, ~b~0=v_~b~0_12, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, #valid=|v_#valid_71|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_9|, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_8|, ~z~0=v_~z~0_27, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_8, ULTIMATE.start_main_~#t1280~0.offset=|v_ULTIMATE.start_main_~#t1280~0.offset_18|, ULTIMATE.start_main_~#t1278~0.offset=|v_ULTIMATE.start_main_~#t1278~0.offset_18|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1277~0.base, ULTIMATE.start_main_#t~ite28, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_~#t1280~0.base, ~a~0, ~z$r_buff0_thd0~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ULTIMATE.start_main_#t~nondet15, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~ite29, ~z$read_delayed~0, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_~#t1277~0.offset, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ~z$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet26, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_~#t1279~0.offset, ULTIMATE.start_main_#t~ite32, ULTIMATE.start_main_~#t1278~0.base, #NULL.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_~#t1279~0.base, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_#t~nondet18, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ULTIMATE.start_main_~#t1280~0.offset, ULTIMATE.start_main_~#t1278~0.offset] because there is no mapped edge [2019-12-18 21:36:22,433 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L831-1-->L833: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1278~0.base_13| 0)) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t1278~0.base_13| 4) |v_#length_21|) (= 0 (select |v_#valid_45| |v_ULTIMATE.start_main_~#t1278~0.base_13|)) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1278~0.base_13|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1278~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1278~0.base_13|) |v_ULTIMATE.start_main_~#t1278~0.offset_11| 1)) |v_#memory_int_15|) (= |v_#valid_44| (store |v_#valid_45| |v_ULTIMATE.start_main_~#t1278~0.base_13| 1)) (= 0 |v_ULTIMATE.start_main_~#t1278~0.offset_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_16|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_6|, #length=|v_#length_21|, ULTIMATE.start_main_~#t1278~0.base=|v_ULTIMATE.start_main_~#t1278~0.base_13|, ULTIMATE.start_main_~#t1278~0.offset=|v_ULTIMATE.start_main_~#t1278~0.offset_11|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t1278~0.base, ULTIMATE.start_main_~#t1278~0.offset] because there is no mapped edge [2019-12-18 21:36:22,434 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L833-1-->L835: Formula: (and (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1279~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1279~0.base_11|) |v_ULTIMATE.start_main_~#t1279~0.offset_10| 2))) (not (= 0 |v_ULTIMATE.start_main_~#t1279~0.base_11|)) (= (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1279~0.base_11|) 0) (= 0 |v_ULTIMATE.start_main_~#t1279~0.offset_10|) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1279~0.base_11| 1)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1279~0.base_11|) (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t1279~0.base_11| 4) |v_#length_19|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_14|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t1279~0.base=|v_ULTIMATE.start_main_~#t1279~0.base_11|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_6|, #length=|v_#length_19|, ULTIMATE.start_main_~#t1279~0.offset=|v_ULTIMATE.start_main_~#t1279~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1279~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, #length, ULTIMATE.start_main_~#t1279~0.offset] because there is no mapped edge [2019-12-18 21:36:22,435 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L835-1-->L837: Formula: (and (= 0 (select |v_#valid_47| |v_ULTIMATE.start_main_~#t1280~0.base_13|)) (= |v_ULTIMATE.start_main_~#t1280~0.offset_11| 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1280~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1280~0.base_13|) |v_ULTIMATE.start_main_~#t1280~0.offset_11| 3)) |v_#memory_int_17|) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t1280~0.base_13| 4) |v_#length_23|) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1280~0.base_13|) (= (store |v_#valid_47| |v_ULTIMATE.start_main_~#t1280~0.base_13| 1) |v_#valid_46|) (not (= |v_ULTIMATE.start_main_~#t1280~0.base_13| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_18|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_17|, #length=|v_#length_23|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_5|, ULTIMATE.start_main_~#t1280~0.offset=|v_ULTIMATE.start_main_~#t1280~0.offset_11|, ULTIMATE.start_main_~#t1280~0.base=|v_ULTIMATE.start_main_~#t1280~0.base_13|} AuxVars[] AssignedVars[#valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet17, ULTIMATE.start_main_~#t1280~0.offset, ULTIMATE.start_main_~#t1280~0.base] because there is no mapped edge [2019-12-18 21:36:22,437 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L4-->L808: Formula: (and (= v_~z$r_buff0_thd3~0_14 v_~z$r_buff1_thd3~0_10) (= v_~z$r_buff0_thd0~0_61 v_~z$r_buff1_thd0~0_39) (= v_~z$r_buff1_thd1~0_4 v_~z$r_buff0_thd1~0_3) (= v_~__unbuffered_p3_EBX~0_4 v_~b~0_5) (not (= 0 v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_8)) (= v_~__unbuffered_p3_EAX~0_4 v_~a~0_3) (= v_~z$r_buff0_thd4~0_17 v_~z$r_buff1_thd4~0_10) (= v_~z$r_buff1_thd2~0_4 v_~z$r_buff0_thd2~0_3) (= v_~z$r_buff0_thd4~0_16 1) (= 1 v_~a~0_3)) InVars {P3Thread1of1ForFork3___VERIFIER_assert_~expression=v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_8, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_61, ~b~0=v_~b~0_5, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_17, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_14, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_3, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_3} OutVars{P3Thread1of1ForFork3___VERIFIER_assert_~expression=v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_8, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_10, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_10, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_4, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_4, ~a~0=v_~a~0_3, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_61, ~b~0=v_~b~0_5, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_39, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_4, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_4, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_16, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_14, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_3, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_3} AuxVars[] AssignedVars[~a~0, ~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EBX~0] because there is no mapped edge [2019-12-18 21:36:22,439 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] P0ENTRY-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_22 1) v_~__unbuffered_cnt~0_21) (= v_~x~0_10 1) (= v_P0Thread1of1ForFork0_~arg.base_5 |v_P0Thread1of1ForFork0_#in~arg.base_5|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= 1 v_~b~0_8) (= v_P0Thread1of1ForFork0_~arg.offset_5 |v_P0Thread1of1ForFork0_#in~arg.offset_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, ~b~0=v_~b~0_8, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_5, ~x~0=v_~x~0_10, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_5} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, ~b~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, ~x~0, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-18 21:36:22,439 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] P1ENTRY-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= 2 v_~x~0_8) (= 1 v_~y~0_5) (= |v_P1Thread1of1ForFork1_#in~arg.offset_4| v_P1Thread1of1ForFork1_~arg.offset_4) (= (+ v_~__unbuffered_cnt~0_18 1) v_~__unbuffered_cnt~0_17) (= v_P1Thread1of1ForFork1_~arg.base_4 |v_P1Thread1of1ForFork1_#in~arg.base_4|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_4|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_4, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_4, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_4|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17, ~y~0=v_~y~0_5, ~x~0=v_~x~0_8, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_~arg.base, ~__unbuffered_cnt~0, ~y~0, ~x~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 21:36:22,440 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L809-->L809-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In2072779154 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In2072779154 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P3Thread1of1ForFork3_#t~ite11_Out2072779154|)) (and (= ~z$w_buff0_used~0_In2072779154 |P3Thread1of1ForFork3_#t~ite11_Out2072779154|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2072779154, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In2072779154} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2072779154, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In2072779154, P3Thread1of1ForFork3_#t~ite11=|P3Thread1of1ForFork3_#t~ite11_Out2072779154|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite11] because there is no mapped edge [2019-12-18 21:36:22,442 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L810-->L810-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In-2139967602 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd4~0_In-2139967602 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-2139967602 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-2139967602 256)))) (or (and (= |P3Thread1of1ForFork3_#t~ite12_Out-2139967602| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$w_buff1_used~0_In-2139967602 |P3Thread1of1ForFork3_#t~ite12_Out-2139967602|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-2139967602, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2139967602, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-2139967602, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2139967602} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-2139967602, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2139967602, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-2139967602, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2139967602, P3Thread1of1ForFork3_#t~ite12=|P3Thread1of1ForFork3_#t~ite12_Out-2139967602|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite12] because there is no mapped edge [2019-12-18 21:36:22,442 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L772-2-->L772-4: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In-106336059 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-106336059 256)))) (or (and (or .cse0 .cse1) (= ~z~0_In-106336059 |P2Thread1of1ForFork2_#t~ite3_Out-106336059|)) (and (not .cse0) (= ~z$w_buff1~0_In-106336059 |P2Thread1of1ForFork2_#t~ite3_Out-106336059|) (not .cse1)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-106336059, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-106336059, ~z$w_buff1~0=~z$w_buff1~0_In-106336059, ~z~0=~z~0_In-106336059} OutVars{P2Thread1of1ForFork2_#t~ite3=|P2Thread1of1ForFork2_#t~ite3_Out-106336059|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-106336059, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-106336059, ~z$w_buff1~0=~z$w_buff1~0_In-106336059, ~z~0=~z~0_In-106336059} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-18 21:36:22,442 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [663] [663] L772-4-->L773: Formula: (= v_~z~0_17 |v_P2Thread1of1ForFork2_#t~ite3_8|) InVars {P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_8|} OutVars{P2Thread1of1ForFork2_#t~ite4=|v_P2Thread1of1ForFork2_#t~ite4_7|, P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_7|, ~z~0=v_~z~0_17} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite4, P2Thread1of1ForFork2_#t~ite3, ~z~0] because there is no mapped edge [2019-12-18 21:36:22,443 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L773-->L773-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In234661086 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In234661086 256)))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite5_Out234661086|) (not .cse1)) (and (= ~z$w_buff0_used~0_In234661086 |P2Thread1of1ForFork2_#t~ite5_Out234661086|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In234661086, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In234661086} OutVars{P2Thread1of1ForFork2_#t~ite5=|P2Thread1of1ForFork2_#t~ite5_Out234661086|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In234661086, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In234661086} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-18 21:36:22,443 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L774-->L774-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd3~0_In1220036224 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In1220036224 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1220036224 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In1220036224 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite6_Out1220036224| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |P2Thread1of1ForFork2_#t~ite6_Out1220036224| ~z$w_buff1_used~0_In1220036224)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1220036224, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1220036224, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1220036224, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1220036224} OutVars{P2Thread1of1ForFork2_#t~ite6=|P2Thread1of1ForFork2_#t~ite6_Out1220036224|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1220036224, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1220036224, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1220036224, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1220036224} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-18 21:36:22,444 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L775-->L775-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-302525051 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-302525051 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite7_Out-302525051| 0)) (and (= |P2Thread1of1ForFork2_#t~ite7_Out-302525051| ~z$r_buff0_thd3~0_In-302525051) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-302525051, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-302525051} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-302525051, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-302525051, P2Thread1of1ForFork2_#t~ite7=|P2Thread1of1ForFork2_#t~ite7_Out-302525051|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-18 21:36:22,445 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L776-->L776-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In-1361316687 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In-1361316687 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1361316687 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-1361316687 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite8_Out-1361316687| 0)) (and (or .cse2 .cse3) (= ~z$r_buff1_thd3~0_In-1361316687 |P2Thread1of1ForFork2_#t~ite8_Out-1361316687|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1361316687, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1361316687, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1361316687, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1361316687} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1361316687, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1361316687, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1361316687, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1361316687, P2Thread1of1ForFork2_#t~ite8=|P2Thread1of1ForFork2_#t~ite8_Out-1361316687|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 21:36:22,445 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L776-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= v_~z$r_buff1_thd3~0_12 |v_P2Thread1of1ForFork2_#t~ite8_8|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_8|} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_12, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_7|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset, P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 21:36:22,446 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L811-->L812: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In1040386640 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1040386640 256)))) (or (and (not .cse0) (not .cse1) (= ~z$r_buff0_thd4~0_Out1040386640 0)) (and (= ~z$r_buff0_thd4~0_Out1040386640 ~z$r_buff0_thd4~0_In1040386640) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1040386640, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1040386640} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1040386640, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out1040386640, P3Thread1of1ForFork3_#t~ite13=|P3Thread1of1ForFork3_#t~ite13_Out1040386640|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~ite13] because there is no mapped edge [2019-12-18 21:36:22,446 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L812-->L812-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In413595628 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd4~0_In413595628 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In413595628 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd4~0_In413595628 256)))) (or (and (= |P3Thread1of1ForFork3_#t~ite14_Out413595628| ~z$r_buff1_thd4~0_In413595628) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork3_#t~ite14_Out413595628| 0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In413595628, ~z$w_buff0_used~0=~z$w_buff0_used~0_In413595628, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In413595628, ~z$w_buff1_used~0=~z$w_buff1_used~0_In413595628} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In413595628, ~z$w_buff0_used~0=~z$w_buff0_used~0_In413595628, P3Thread1of1ForFork3_#t~ite14=|P3Thread1of1ForFork3_#t~ite14_Out413595628|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In413595628, ~z$w_buff1_used~0=~z$w_buff1_used~0_In413595628} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite14] because there is no mapped edge [2019-12-18 21:36:22,446 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L812-2-->P3EXIT: Formula: (and (= 0 |v_P3Thread1of1ForFork3_#res.offset_5|) (= 0 |v_P3Thread1of1ForFork3_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_20 1) v_~__unbuffered_cnt~0_19) (= |v_P3Thread1of1ForFork3_#t~ite14_8| v_~z$r_buff1_thd4~0_13)) InVars {P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_13, P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_7|, P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19, P3Thread1of1ForFork3_#res.offset=|v_P3Thread1of1ForFork3_#res.offset_5|} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, P3Thread1of1ForFork3_#t~ite14, P3Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-18 21:36:22,447 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L837-1-->L843: Formula: (and (= 4 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_4|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet18] because there is no mapped edge [2019-12-18 21:36:22,447 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L843-2-->L843-5: Formula: (let ((.cse1 (= |ULTIMATE.start_main_#t~ite20_Out1302705053| |ULTIMATE.start_main_#t~ite19_Out1302705053|)) (.cse0 (= (mod ~z$r_buff1_thd0~0_In1302705053 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In1302705053 256)))) (or (and (= ~z$w_buff1~0_In1302705053 |ULTIMATE.start_main_#t~ite19_Out1302705053|) (not .cse0) .cse1 (not .cse2)) (and (= ~z~0_In1302705053 |ULTIMATE.start_main_#t~ite19_Out1302705053|) .cse1 (or .cse0 .cse2)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1302705053, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1302705053, ~z$w_buff1~0=~z$w_buff1~0_In1302705053, ~z~0=~z~0_In1302705053} OutVars{ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out1302705053|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1302705053, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1302705053, ~z$w_buff1~0=~z$w_buff1~0_In1302705053, ~z~0=~z~0_In1302705053, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out1302705053|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-18 21:36:22,448 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L844-->L844-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1959568241 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In1959568241 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite21_Out1959568241| ~z$w_buff0_used~0_In1959568241)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite21_Out1959568241|) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1959568241, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1959568241} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1959568241, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1959568241, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out1959568241|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-18 21:36:22,449 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L845-->L845-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In1151205360 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd0~0_In1151205360 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In1151205360 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1151205360 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In1151205360 |ULTIMATE.start_main_#t~ite22_Out1151205360|)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |ULTIMATE.start_main_#t~ite22_Out1151205360|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1151205360, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1151205360, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1151205360, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1151205360} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1151205360, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1151205360, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1151205360, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1151205360, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out1151205360|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-18 21:36:22,450 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L846-->L846-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1344163849 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-1344163849 256) 0))) (or (and (= ~z$r_buff0_thd0~0_In-1344163849 |ULTIMATE.start_main_#t~ite23_Out-1344163849|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite23_Out-1344163849|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1344163849, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1344163849} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1344163849, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1344163849, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-1344163849|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-18 21:36:22,451 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L847-->L847-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In-470187236 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In-470187236 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd0~0_In-470187236 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In-470187236 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite24_Out-470187236| ~z$r_buff1_thd0~0_In-470187236) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite24_Out-470187236| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-470187236, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-470187236, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-470187236, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-470187236} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-470187236, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-470187236, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-470187236, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-470187236|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-470187236} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24] because there is no mapped edge [2019-12-18 21:36:22,453 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L855-->L855-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-1047487831 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite30_Out-1047487831| ~z$w_buff0~0_In-1047487831) (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-1047487831 256)))) (or (= (mod ~z$w_buff0_used~0_In-1047487831 256) 0) (and (= (mod ~z$r_buff1_thd0~0_In-1047487831 256) 0) .cse0) (and .cse0 (= 0 (mod ~z$w_buff1_used~0_In-1047487831 256))))) .cse1 (= |ULTIMATE.start_main_#t~ite30_Out-1047487831| |ULTIMATE.start_main_#t~ite31_Out-1047487831|)) (and (= |ULTIMATE.start_main_#t~ite30_In-1047487831| |ULTIMATE.start_main_#t~ite30_Out-1047487831|) (= ~z$w_buff0~0_In-1047487831 |ULTIMATE.start_main_#t~ite31_Out-1047487831|) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1047487831, ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_In-1047487831|, ~z$w_buff0~0=~z$w_buff0~0_In-1047487831, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1047487831, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1047487831, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1047487831, ~weak$$choice2~0=~weak$$choice2~0_In-1047487831} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1047487831, ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_Out-1047487831|, ~z$w_buff0~0=~z$w_buff0~0_In-1047487831, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1047487831, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1047487831, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1047487831, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_Out-1047487831|, ~weak$$choice2~0=~weak$$choice2~0_In-1047487831} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_#t~ite31] because there is no mapped edge [2019-12-18 21:36:22,454 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L856-->L856-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In615849508 256)))) (or (and (= ~z$w_buff1~0_In615849508 |ULTIMATE.start_main_#t~ite33_Out615849508|) (= |ULTIMATE.start_main_#t~ite34_Out615849508| |ULTIMATE.start_main_#t~ite33_Out615849508|) (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In615849508 256)))) (or (= 0 (mod ~z$w_buff0_used~0_In615849508 256)) (and (= 0 (mod ~z$r_buff1_thd0~0_In615849508 256)) .cse0) (and (= (mod ~z$w_buff1_used~0_In615849508 256) 0) .cse0))) .cse1) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite33_In615849508| |ULTIMATE.start_main_#t~ite33_Out615849508|) (= ~z$w_buff1~0_In615849508 |ULTIMATE.start_main_#t~ite34_Out615849508|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In615849508, ~z$w_buff0_used~0=~z$w_buff0_used~0_In615849508, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In615849508, ~z$w_buff1_used~0=~z$w_buff1_used~0_In615849508, ~z$w_buff1~0=~z$w_buff1~0_In615849508, ~weak$$choice2~0=~weak$$choice2~0_In615849508, ULTIMATE.start_main_#t~ite33=|ULTIMATE.start_main_#t~ite33_In615849508|} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In615849508, ~z$w_buff0_used~0=~z$w_buff0_used~0_In615849508, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In615849508, ~z$w_buff1_used~0=~z$w_buff1_used~0_In615849508, ~z$w_buff1~0=~z$w_buff1~0_In615849508, ~weak$$choice2~0=~weak$$choice2~0_In615849508, ULTIMATE.start_main_#t~ite33=|ULTIMATE.start_main_#t~ite33_Out615849508|, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out615849508|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite33, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-18 21:36:22,459 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L859-->L860: Formula: (and (not (= (mod v_~weak$$choice2~0_21 256) 0)) (= v_~z$r_buff0_thd0~0_59 v_~z$r_buff0_thd0~0_58)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_59, ~weak$$choice2~0=v_~weak$$choice2~0_21} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_8|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_58, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_9|, ~weak$$choice2~0=v_~weak$$choice2~0_21, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 21:36:22,459 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L860-->L860-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1418978547 256) 0))) (or (and .cse0 (= |ULTIMATE.start_main_#t~ite45_Out1418978547| ~z$r_buff1_thd0~0_In1418978547) (= |ULTIMATE.start_main_#t~ite45_Out1418978547| |ULTIMATE.start_main_#t~ite46_Out1418978547|) (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In1418978547 256) 0))) (or (and .cse1 (= 0 (mod ~z$r_buff1_thd0~0_In1418978547 256))) (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In1418978547 256))) (= 0 (mod ~z$w_buff0_used~0_In1418978547 256))))) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite45_In1418978547| |ULTIMATE.start_main_#t~ite45_Out1418978547|) (= |ULTIMATE.start_main_#t~ite46_Out1418978547| ~z$r_buff1_thd0~0_In1418978547)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1418978547, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1418978547, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1418978547, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1418978547, ~weak$$choice2~0=~weak$$choice2~0_In1418978547, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_In1418978547|} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1418978547, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1418978547, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1418978547, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1418978547, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out1418978547|, ~weak$$choice2~0=~weak$$choice2~0_In1418978547, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1418978547|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 21:36:22,461 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L862-->L4: Formula: (and (= v_~z~0_20 v_~z$mem_tmp~0_6) (= (mod v_~main$tmp_guard1~0_6 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|) (not (= 0 (mod v_~z$flush_delayed~0_10 256))) (= 0 v_~z$flush_delayed~0_9)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_6, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_6, ~z$flush_delayed~0=v_~z$flush_delayed~0_10} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_6, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_9, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_9|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_6, ~z$flush_delayed~0=v_~z$flush_delayed~0_9, ~z~0=v_~z~0_20, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~z$flush_delayed~0, ~z~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 21:36:22,461 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 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_12, 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-18 21:36:22,603 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 09:36:22 BasicIcfg [2019-12-18 21:36:22,603 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 21:36:22,606 INFO L168 Benchmark]: Toolchain (without parser) took 27687.65 ms. Allocated memory was 143.1 MB in the beginning and 1.5 GB in the end (delta: 1.3 GB). Free memory was 99.7 MB in the beginning and 727.4 MB in the end (delta: -627.7 MB). Peak memory consumption was 695.1 MB. Max. memory is 7.1 GB. [2019-12-18 21:36:22,607 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 143.1 MB. Free memory was 119.5 MB in the beginning and 119.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 21:36:22,612 INFO L168 Benchmark]: CACSL2BoogieTranslator took 844.44 ms. Allocated memory was 143.1 MB in the beginning and 199.8 MB in the end (delta: 56.6 MB). Free memory was 99.5 MB in the beginning and 152.1 MB in the end (delta: -52.6 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. [2019-12-18 21:36:22,614 INFO L168 Benchmark]: Boogie Procedure Inliner took 78.73 ms. Allocated memory is still 199.8 MB. Free memory was 152.1 MB in the beginning and 149.3 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-18 21:36:22,615 INFO L168 Benchmark]: Boogie Preprocessor took 43.21 ms. Allocated memory is still 199.8 MB. Free memory was 149.3 MB in the beginning and 146.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-18 21:36:22,616 INFO L168 Benchmark]: RCFGBuilder took 944.25 ms. Allocated memory is still 199.8 MB. Free memory was 146.6 MB in the beginning and 97.3 MB in the end (delta: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 7.1 GB. [2019-12-18 21:36:22,617 INFO L168 Benchmark]: TraceAbstraction took 25772.03 ms. Allocated memory was 199.8 MB in the beginning and 1.5 GB in the end (delta: 1.3 GB). Free memory was 96.7 MB in the beginning and 727.4 MB in the end (delta: -630.8 MB). Peak memory consumption was 635.4 MB. Max. memory is 7.1 GB. [2019-12-18 21:36:22,629 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 143.1 MB. Free memory was 119.5 MB in the beginning and 119.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 844.44 ms. Allocated memory was 143.1 MB in the beginning and 199.8 MB in the end (delta: 56.6 MB). Free memory was 99.5 MB in the beginning and 152.1 MB in the end (delta: -52.6 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 78.73 ms. Allocated memory is still 199.8 MB. Free memory was 152.1 MB in the beginning and 149.3 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.21 ms. Allocated memory is still 199.8 MB. Free memory was 149.3 MB in the beginning and 146.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 944.25 ms. Allocated memory is still 199.8 MB. Free memory was 146.6 MB in the beginning and 97.3 MB in the end (delta: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 25772.03 ms. Allocated memory was 199.8 MB in the beginning and 1.5 GB in the end (delta: 1.3 GB). Free memory was 96.7 MB in the beginning and 727.4 MB in the end (delta: -630.8 MB). Peak memory consumption was 635.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.0s, 180 ProgramPointsBefore, 92 ProgramPointsAfterwards, 208 TransitionsBefore, 99 TransitionsAfterwards, 12668 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 36 ConcurrentYvCompositions, 26 ChoiceCompositions, 4932 VarBasedMoverChecksPositive, 155 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 52826 CheckedPairsTotal, 119 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L831] FCALL, FORK 0 pthread_create(&t1277, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L833] FCALL, FORK 0 pthread_create(&t1278, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L835] FCALL, FORK 0 pthread_create(&t1279, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L837] FCALL, FORK 0 pthread_create(&t1280, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L786] 4 z$w_buff1 = z$w_buff0 [L787] 4 z$w_buff0 = 2 [L788] 4 z$w_buff1_used = z$w_buff0_used [L789] 4 z$w_buff0_used = (_Bool)1 [L808] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L766] 3 y = 2 [L769] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L808] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L772] 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 [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L773] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L774] 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 [L775] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L810] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L843] EXPR 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}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L843] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L844] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L845] 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 [L846] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L847] 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 [L850] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L851] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L852] 0 z$flush_delayed = weak$$choice2 [L853] 0 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L854] 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}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L854] 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) [L855] 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)) [L856] 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)) [L857] 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}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L857] 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)) [L858] 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}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L858] 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)) [L860] 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)) [L861] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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 5 procedures, 168 locations, 2 error locations. Result: UNSAFE, OverallTime: 25.4s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 6.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1601 SDtfs, 1548 SDslu, 3291 SDs, 0 SdLazy, 1196 SolverSat, 111 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 97 GetRequests, 22 SyntacticMatches, 8 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50002occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 9.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 7666 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 691 NumberOfCodeBlocks, 691 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 616 ConstructedInterpolants, 0 QuantifiedInterpolants, 121732 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...