/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix047_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 22:46:51,840 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 22:46:51,842 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 22:46:51,861 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 22:46:51,861 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 22:46:51,864 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 22:46:51,866 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 22:46:51,879 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 22:46:51,881 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 22:46:51,882 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 22:46:51,884 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 22:46:51,886 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 22:46:51,887 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 22:46:51,890 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 22:46:51,892 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 22:46:51,893 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 22:46:51,894 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 22:46:51,894 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 22:46:51,896 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 22:46:51,898 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 22:46:51,899 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 22:46:51,900 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 22:46:51,901 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 22:46:51,902 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 22:46:51,904 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 22:46:51,904 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 22:46:51,904 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 22:46:51,905 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 22:46:51,906 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 22:46:51,906 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 22:46:51,907 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 22:46:51,907 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 22:46:51,908 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 22:46:51,909 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 22:46:51,910 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 22:46:51,910 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 22:46:51,911 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 22:46:51,911 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 22:46:51,911 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 22:46:51,912 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 22:46:51,913 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 22:46:51,913 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-26 22:46:51,927 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 22:46:51,927 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 22:46:51,928 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 22:46:51,929 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 22:46:51,929 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 22:46:51,929 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 22:46:51,929 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 22:46:51,929 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 22:46:51,930 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 22:46:51,930 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 22:46:51,930 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 22:46:51,930 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 22:46:51,930 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 22:46:51,931 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 22:46:51,931 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 22:46:51,931 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 22:46:51,931 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 22:46:51,931 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 22:46:51,932 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 22:46:51,932 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 22:46:51,932 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 22:46:51,932 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 22:46:51,932 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 22:46:51,933 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 22:46:51,933 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 22:46:51,933 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 22:46:51,933 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 22:46:51,933 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 22:46:51,934 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 22:46:51,934 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 22:46:52,209 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 22:46:52,222 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 22:46:52,225 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 22:46:52,227 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 22:46:52,227 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 22:46:52,228 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-26 22:46:52,290 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c99958821/8d02fb6338c34666a7a83caf8be32da7/FLAG8afb3ab89 [2019-12-26 22:46:52,836 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 22:46:52,836 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix047_tso.opt.i [2019-12-26 22:46:52,850 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c99958821/8d02fb6338c34666a7a83caf8be32da7/FLAG8afb3ab89 [2019-12-26 22:46:53,063 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c99958821/8d02fb6338c34666a7a83caf8be32da7 [2019-12-26 22:46:53,073 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 22:46:53,075 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 22:46:53,076 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 22:46:53,076 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 22:46:53,079 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 22:46:53,081 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 10:46:53" (1/1) ... [2019-12-26 22:46:53,083 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b86c31c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:46:53, skipping insertion in model container [2019-12-26 22:46:53,084 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 10:46:53" (1/1) ... [2019-12-26 22:46:53,092 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 22:46:53,159 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 22:46:53,669 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 22:46:53,680 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 22:46:53,755 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 22:46:53,835 INFO L208 MainTranslator]: Completed translation [2019-12-26 22:46:53,836 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:46:53 WrapperNode [2019-12-26 22:46:53,836 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 22:46:53,837 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 22:46:53,837 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 22:46:53,837 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 22:46:53,846 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:46:53" (1/1) ... [2019-12-26 22:46:53,866 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:46:53" (1/1) ... [2019-12-26 22:46:53,908 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 22:46:53,909 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 22:46:53,909 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 22:46:53,909 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 22:46:53,921 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:46:53" (1/1) ... [2019-12-26 22:46:53,921 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:46:53" (1/1) ... [2019-12-26 22:46:53,929 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:46:53" (1/1) ... [2019-12-26 22:46:53,929 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:46:53" (1/1) ... [2019-12-26 22:46:53,947 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:46:53" (1/1) ... [2019-12-26 22:46:53,951 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:46:53" (1/1) ... [2019-12-26 22:46:53,954 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:46:53" (1/1) ... [2019-12-26 22:46:53,960 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 22:46:53,960 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 22:46:53,961 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 22:46:53,961 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 22:46:53,962 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:46:53" (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-26 22:46:54,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 22:46:54,026 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 22:46:54,026 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 22:46:54,026 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 22:46:54,026 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 22:46:54,026 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 22:46:54,027 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 22:46:54,027 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 22:46:54,027 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-26 22:46:54,027 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-26 22:46:54,027 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-26 22:46:54,027 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-26 22:46:54,027 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 22:46:54,028 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 22:46:54,028 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 22:46:54,030 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 22:46:54,816 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 22:46:54,817 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 22:46:54,818 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 10:46:54 BoogieIcfgContainer [2019-12-26 22:46:54,819 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 22:46:54,820 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 22:46:54,820 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 22:46:54,823 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 22:46:54,824 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 10:46:53" (1/3) ... [2019-12-26 22:46:54,825 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c738862 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 10:46:54, skipping insertion in model container [2019-12-26 22:46:54,825 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:46:53" (2/3) ... [2019-12-26 22:46:54,825 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c738862 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 10:46:54, skipping insertion in model container [2019-12-26 22:46:54,826 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 10:46:54" (3/3) ... [2019-12-26 22:46:54,827 INFO L109 eAbstractionObserver]: Analyzing ICFG mix047_tso.opt.i [2019-12-26 22:46:54,837 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 22:46:54,837 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 22:46:54,845 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 22:46:54,846 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 22:46:54,883 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:54,884 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:54,884 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:54,884 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:54,885 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:54,885 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:54,886 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:54,886 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:54,886 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:54,886 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:54,887 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:54,887 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:54,888 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:54,888 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:54,888 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:54,888 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:54,889 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:54,889 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:54,889 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:54,889 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:54,890 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:54,890 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:54,890 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:54,891 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:54,891 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:54,891 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:54,891 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:54,892 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:54,892 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:54,892 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:54,892 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:54,893 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:54,893 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:54,893 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:54,893 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:54,894 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:54,894 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:54,894 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:54,894 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:54,895 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:54,895 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:54,895 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:54,896 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:54,896 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:54,897 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:54,897 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:54,897 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:54,897 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:54,898 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:54,898 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:54,898 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:54,899 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:54,899 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:54,920 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:54,920 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:54,921 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:54,921 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:54,921 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:54,921 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:54,921 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:54,922 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:54,922 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:54,922 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:54,922 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:54,923 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:54,923 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:54,923 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:54,923 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:54,923 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:54,924 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:54,924 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:54,924 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:54,924 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:54,925 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:54,925 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:54,925 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:54,928 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:54,929 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:54,929 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:54,929 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:54,934 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:54,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:54,935 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:54,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:54,939 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:54,939 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:54,939 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:54,940 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:54,940 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:54,940 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:54,940 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:54,940 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:54,941 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:54,941 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:54,943 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:54,943 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:54,943 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:54,944 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:54,944 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:54,944 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:54,944 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:54,944 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:54,945 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:54,946 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:54,947 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:54,947 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:54,962 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-26 22:46:54,981 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 22:46:54,982 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 22:46:54,982 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 22:46:54,982 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 22:46:54,982 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 22:46:54,982 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 22:46:54,982 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 22:46:54,982 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 22:46:55,001 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 180 places, 208 transitions [2019-12-26 22:46:55,003 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 208 transitions [2019-12-26 22:46:55,109 INFO L132 PetriNetUnfolder]: 41/204 cut-off events. [2019-12-26 22:46:55,109 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 22:46:55,126 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. 0/161 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-26 22:46:55,145 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 208 transitions [2019-12-26 22:46:55,229 INFO L132 PetriNetUnfolder]: 41/204 cut-off events. [2019-12-26 22:46:55,229 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 22:46:55,235 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. 0/161 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-26 22:46:55,251 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12668 [2019-12-26 22:46:55,252 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 22:47:00,530 WARN L192 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-26 22:47:00,686 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-12-26 22:47:00,732 INFO L206 etLargeBlockEncoding]: Checked pairs total: 49999 [2019-12-26 22:47:00,732 INFO L214 etLargeBlockEncoding]: Total number of compositions: 122 [2019-12-26 22:47:00,735 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 89 places, 95 transitions [2019-12-26 22:47:03,700 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34566 states. [2019-12-26 22:47:03,702 INFO L276 IsEmpty]: Start isEmpty. Operand 34566 states. [2019-12-26 22:47:03,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-26 22:47:03,709 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:47:03,709 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:47:03,710 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-26 22:47:03,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:47:03,715 INFO L82 PathProgramCache]: Analyzing trace with hash -1471654446, now seen corresponding path program 1 times [2019-12-26 22:47:03,722 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:47:03,723 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222557480] [2019-12-26 22:47:03,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:47:03,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:47:04,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:47:04,043 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222557480] [2019-12-26 22:47:04,044 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:47:04,044 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 22:47:04,045 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959906729] [2019-12-26 22:47:04,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:47:04,052 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:47:04,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:47:04,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:47:04,069 INFO L87 Difference]: Start difference. First operand 34566 states. Second operand 3 states. [2019-12-26 22:47:04,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:47:04,802 INFO L93 Difference]: Finished difference Result 34366 states and 145616 transitions. [2019-12-26 22:47:04,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:47:04,804 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-26 22:47:04,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:47:05,333 INFO L225 Difference]: With dead ends: 34366 [2019-12-26 22:47:05,334 INFO L226 Difference]: Without dead ends: 33638 [2019-12-26 22:47:05,335 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-26 22:47:05,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33638 states. [2019-12-26 22:47:06,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33638 to 33638. [2019-12-26 22:47:06,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33638 states. [2019-12-26 22:47:07,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33638 states to 33638 states and 142648 transitions. [2019-12-26 22:47:07,013 INFO L78 Accepts]: Start accepts. Automaton has 33638 states and 142648 transitions. Word has length 9 [2019-12-26 22:47:07,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:47:07,014 INFO L462 AbstractCegarLoop]: Abstraction has 33638 states and 142648 transitions. [2019-12-26 22:47:07,015 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:47:07,016 INFO L276 IsEmpty]: Start isEmpty. Operand 33638 states and 142648 transitions. [2019-12-26 22:47:07,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-26 22:47:07,032 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:47:07,032 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:47:07,032 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-26 22:47:07,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:47:07,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1198985017, now seen corresponding path program 1 times [2019-12-26 22:47:07,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:47:07,033 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088885463] [2019-12-26 22:47:07,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:47:07,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:47:07,161 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-26 22:47:07,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088885463] [2019-12-26 22:47:07,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:47:07,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:47:07,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889834685] [2019-12-26 22:47:07,166 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:47:07,166 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:47:07,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:47:07,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:47:07,167 INFO L87 Difference]: Start difference. First operand 33638 states and 142648 transitions. Second operand 4 states. [2019-12-26 22:47:09,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:47:09,203 INFO L93 Difference]: Finished difference Result 52350 states and 214824 transitions. [2019-12-26 22:47:09,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:47:09,203 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-26 22:47:09,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:47:09,476 INFO L225 Difference]: With dead ends: 52350 [2019-12-26 22:47:09,476 INFO L226 Difference]: Without dead ends: 52322 [2019-12-26 22:47:09,477 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-26 22:47:10,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52322 states. [2019-12-26 22:47:11,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52322 to 47746. [2019-12-26 22:47:11,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47746 states. [2019-12-26 22:47:11,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47746 states to 47746 states and 197744 transitions. [2019-12-26 22:47:11,659 INFO L78 Accepts]: Start accepts. Automaton has 47746 states and 197744 transitions. Word has length 15 [2019-12-26 22:47:11,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:47:11,659 INFO L462 AbstractCegarLoop]: Abstraction has 47746 states and 197744 transitions. [2019-12-26 22:47:11,659 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:47:11,659 INFO L276 IsEmpty]: Start isEmpty. Operand 47746 states and 197744 transitions. [2019-12-26 22:47:11,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-26 22:47:11,663 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:47:11,663 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:47:11,663 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-26 22:47:11,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:47:11,664 INFO L82 PathProgramCache]: Analyzing trace with hash -633584, now seen corresponding path program 1 times [2019-12-26 22:47:11,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:47:11,664 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443845580] [2019-12-26 22:47:11,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:47:11,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:47:11,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:47:11,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443845580] [2019-12-26 22:47:11,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:47:11,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:47:11,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749802136] [2019-12-26 22:47:11,719 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:47:11,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:47:11,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:47:11,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:47:11,721 INFO L87 Difference]: Start difference. First operand 47746 states and 197744 transitions. Second operand 3 states. [2019-12-26 22:47:11,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:47:11,879 INFO L93 Difference]: Finished difference Result 37462 states and 143322 transitions. [2019-12-26 22:47:11,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:47:11,879 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-26 22:47:11,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:47:13,995 INFO L225 Difference]: With dead ends: 37462 [2019-12-26 22:47:13,995 INFO L226 Difference]: Without dead ends: 37462 [2019-12-26 22:47:13,996 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-26 22:47:14,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37462 states. [2019-12-26 22:47:15,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37462 to 37462. [2019-12-26 22:47:15,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37462 states. [2019-12-26 22:47:15,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37462 states to 37462 states and 143322 transitions. [2019-12-26 22:47:15,247 INFO L78 Accepts]: Start accepts. Automaton has 37462 states and 143322 transitions. Word has length 15 [2019-12-26 22:47:15,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:47:15,247 INFO L462 AbstractCegarLoop]: Abstraction has 37462 states and 143322 transitions. [2019-12-26 22:47:15,247 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:47:15,247 INFO L276 IsEmpty]: Start isEmpty. Operand 37462 states and 143322 transitions. [2019-12-26 22:47:15,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-26 22:47:15,250 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:47:15,250 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:47:15,250 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-26 22:47:15,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:47:15,250 INFO L82 PathProgramCache]: Analyzing trace with hash -375525237, now seen corresponding path program 1 times [2019-12-26 22:47:15,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:47:15,251 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216929148] [2019-12-26 22:47:15,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:47:15,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:47:15,304 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-26 22:47:15,304 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216929148] [2019-12-26 22:47:15,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:47:15,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:47:15,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257666973] [2019-12-26 22:47:15,305 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:47:15,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:47:15,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:47:15,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:47:15,307 INFO L87 Difference]: Start difference. First operand 37462 states and 143322 transitions. Second operand 4 states. [2019-12-26 22:47:15,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:47:15,380 INFO L93 Difference]: Finished difference Result 15610 states and 49514 transitions. [2019-12-26 22:47:15,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 22:47:15,381 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-26 22:47:15,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:47:15,411 INFO L225 Difference]: With dead ends: 15610 [2019-12-26 22:47:15,412 INFO L226 Difference]: Without dead ends: 15610 [2019-12-26 22:47:15,412 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-26 22:47:15,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15610 states. [2019-12-26 22:47:15,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15610 to 15610. [2019-12-26 22:47:15,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15610 states. [2019-12-26 22:47:15,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15610 states to 15610 states and 49514 transitions. [2019-12-26 22:47:15,777 INFO L78 Accepts]: Start accepts. Automaton has 15610 states and 49514 transitions. Word has length 16 [2019-12-26 22:47:15,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:47:15,778 INFO L462 AbstractCegarLoop]: Abstraction has 15610 states and 49514 transitions. [2019-12-26 22:47:15,778 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:47:15,778 INFO L276 IsEmpty]: Start isEmpty. Operand 15610 states and 49514 transitions. [2019-12-26 22:47:15,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-26 22:47:15,780 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:47:15,780 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:47:15,780 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-26 22:47:15,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:47:15,781 INFO L82 PathProgramCache]: Analyzing trace with hash 680326116, now seen corresponding path program 1 times [2019-12-26 22:47:15,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:47:15,781 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412306307] [2019-12-26 22:47:15,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:47:15,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:47:15,834 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-26 22:47:15,834 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412306307] [2019-12-26 22:47:15,835 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:47:15,835 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 22:47:15,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700864681] [2019-12-26 22:47:15,835 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:47:15,835 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:47:15,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:47:15,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:47:15,836 INFO L87 Difference]: Start difference. First operand 15610 states and 49514 transitions. Second operand 5 states. [2019-12-26 22:47:15,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:47:15,875 INFO L93 Difference]: Finished difference Result 2718 states and 7032 transitions. [2019-12-26 22:47:15,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:47:15,875 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-26 22:47:15,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:47:15,880 INFO L225 Difference]: With dead ends: 2718 [2019-12-26 22:47:15,880 INFO L226 Difference]: Without dead ends: 2718 [2019-12-26 22:47:15,880 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-26 22:47:15,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2718 states. [2019-12-26 22:47:15,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2718 to 2718. [2019-12-26 22:47:15,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2718 states. [2019-12-26 22:47:15,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2718 states to 2718 states and 7032 transitions. [2019-12-26 22:47:15,920 INFO L78 Accepts]: Start accepts. Automaton has 2718 states and 7032 transitions. Word has length 17 [2019-12-26 22:47:15,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:47:15,921 INFO L462 AbstractCegarLoop]: Abstraction has 2718 states and 7032 transitions. [2019-12-26 22:47:15,921 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:47:15,921 INFO L276 IsEmpty]: Start isEmpty. Operand 2718 states and 7032 transitions. [2019-12-26 22:47:15,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-26 22:47:15,926 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:47:15,926 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-26 22:47:15,926 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-26 22:47:15,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:47:15,927 INFO L82 PathProgramCache]: Analyzing trace with hash 794969432, now seen corresponding path program 1 times [2019-12-26 22:47:15,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:47:15,927 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138921856] [2019-12-26 22:47:15,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:47:15,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:47:16,014 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-26 22:47:16,014 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138921856] [2019-12-26 22:47:16,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:47:16,015 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 22:47:16,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781928445] [2019-12-26 22:47:16,015 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 22:47:16,015 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:47:16,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 22:47:16,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:47:16,016 INFO L87 Difference]: Start difference. First operand 2718 states and 7032 transitions. Second operand 6 states. [2019-12-26 22:47:16,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:47:16,062 INFO L93 Difference]: Finished difference Result 1354 states and 3884 transitions. [2019-12-26 22:47:16,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 22:47:16,063 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-12-26 22:47:16,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:47:16,066 INFO L225 Difference]: With dead ends: 1354 [2019-12-26 22:47:16,066 INFO L226 Difference]: Without dead ends: 1354 [2019-12-26 22:47:16,066 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-26 22:47:16,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2019-12-26 22:47:16,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1214. [2019-12-26 22:47:16,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1214 states. [2019-12-26 22:47:16,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1214 states to 1214 states and 3484 transitions. [2019-12-26 22:47:16,087 INFO L78 Accepts]: Start accepts. Automaton has 1214 states and 3484 transitions. Word has length 29 [2019-12-26 22:47:16,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:47:16,088 INFO L462 AbstractCegarLoop]: Abstraction has 1214 states and 3484 transitions. [2019-12-26 22:47:16,088 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 22:47:16,088 INFO L276 IsEmpty]: Start isEmpty. Operand 1214 states and 3484 transitions. [2019-12-26 22:47:16,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-26 22:47:16,093 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:47:16,094 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-26 22:47:16,094 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-26 22:47:16,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:47:16,094 INFO L82 PathProgramCache]: Analyzing trace with hash 593702588, now seen corresponding path program 1 times [2019-12-26 22:47:16,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:47:16,095 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799542002] [2019-12-26 22:47:16,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:47:16,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:47:16,182 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-26 22:47:16,182 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799542002] [2019-12-26 22:47:16,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:47:16,183 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:47:16,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308720307] [2019-12-26 22:47:16,184 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:47:16,184 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:47:16,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:47:16,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:47:16,184 INFO L87 Difference]: Start difference. First operand 1214 states and 3484 transitions. Second operand 3 states. [2019-12-26 22:47:16,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:47:16,232 INFO L93 Difference]: Finished difference Result 1222 states and 3492 transitions. [2019-12-26 22:47:16,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:47:16,233 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-26 22:47:16,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:47:16,235 INFO L225 Difference]: With dead ends: 1222 [2019-12-26 22:47:16,235 INFO L226 Difference]: Without dead ends: 1222 [2019-12-26 22:47:16,236 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-26 22:47:16,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1222 states. [2019-12-26 22:47:16,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1222 to 1217. [2019-12-26 22:47:16,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1217 states. [2019-12-26 22:47:16,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 1217 states and 3487 transitions. [2019-12-26 22:47:16,255 INFO L78 Accepts]: Start accepts. Automaton has 1217 states and 3487 transitions. Word has length 58 [2019-12-26 22:47:16,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:47:16,256 INFO L462 AbstractCegarLoop]: Abstraction has 1217 states and 3487 transitions. [2019-12-26 22:47:16,256 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:47:16,256 INFO L276 IsEmpty]: Start isEmpty. Operand 1217 states and 3487 transitions. [2019-12-26 22:47:16,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-26 22:47:16,260 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:47:16,261 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-26 22:47:16,261 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-26 22:47:16,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:47:16,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1128085639, now seen corresponding path program 1 times [2019-12-26 22:47:16,261 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:47:16,262 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876850277] [2019-12-26 22:47:16,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:47:16,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:47:16,388 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-26 22:47:16,389 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876850277] [2019-12-26 22:47:16,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:47:16,389 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 22:47:16,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473607933] [2019-12-26 22:47:16,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:47:16,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:47:16,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:47:16,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:47:16,391 INFO L87 Difference]: Start difference. First operand 1217 states and 3487 transitions. Second operand 5 states. [2019-12-26 22:47:16,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:47:16,649 INFO L93 Difference]: Finished difference Result 1758 states and 5009 transitions. [2019-12-26 22:47:16,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 22:47:16,650 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-12-26 22:47:16,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:47:16,652 INFO L225 Difference]: With dead ends: 1758 [2019-12-26 22:47:16,652 INFO L226 Difference]: Without dead ends: 1758 [2019-12-26 22:47:16,653 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-26 22:47:16,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1758 states. [2019-12-26 22:47:16,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1758 to 1413. [2019-12-26 22:47:16,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1413 states. [2019-12-26 22:47:16,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1413 states to 1413 states and 4063 transitions. [2019-12-26 22:47:16,678 INFO L78 Accepts]: Start accepts. Automaton has 1413 states and 4063 transitions. Word has length 58 [2019-12-26 22:47:16,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:47:16,678 INFO L462 AbstractCegarLoop]: Abstraction has 1413 states and 4063 transitions. [2019-12-26 22:47:16,678 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:47:16,678 INFO L276 IsEmpty]: Start isEmpty. Operand 1413 states and 4063 transitions. [2019-12-26 22:47:16,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-26 22:47:16,683 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:47:16,683 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-26 22:47:16,683 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-26 22:47:16,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:47:16,684 INFO L82 PathProgramCache]: Analyzing trace with hash -2139138521, now seen corresponding path program 2 times [2019-12-26 22:47:16,684 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:47:16,684 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507826563] [2019-12-26 22:47:16,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:47:16,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:47:16,797 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-26 22:47:16,797 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507826563] [2019-12-26 22:47:16,798 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:47:16,798 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 22:47:16,798 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189303222] [2019-12-26 22:47:16,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 22:47:16,799 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:47:16,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 22:47:16,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:47:16,799 INFO L87 Difference]: Start difference. First operand 1413 states and 4063 transitions. Second operand 6 states. [2019-12-26 22:47:17,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:47:17,144 INFO L93 Difference]: Finished difference Result 2360 states and 6721 transitions. [2019-12-26 22:47:17,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 22:47:17,144 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-12-26 22:47:17,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:47:17,149 INFO L225 Difference]: With dead ends: 2360 [2019-12-26 22:47:17,149 INFO L226 Difference]: Without dead ends: 2360 [2019-12-26 22:47:17,149 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-26 22:47:17,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2360 states. [2019-12-26 22:47:17,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2360 to 1497. [2019-12-26 22:47:17,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1497 states. [2019-12-26 22:47:17,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1497 states to 1497 states and 4311 transitions. [2019-12-26 22:47:17,172 INFO L78 Accepts]: Start accepts. Automaton has 1497 states and 4311 transitions. Word has length 58 [2019-12-26 22:47:17,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:47:17,173 INFO L462 AbstractCegarLoop]: Abstraction has 1497 states and 4311 transitions. [2019-12-26 22:47:17,173 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 22:47:17,173 INFO L276 IsEmpty]: Start isEmpty. Operand 1497 states and 4311 transitions. [2019-12-26 22:47:17,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-26 22:47:17,177 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:47:17,178 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-26 22:47:17,178 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-26 22:47:17,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:47:17,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1500936233, now seen corresponding path program 3 times [2019-12-26 22:47:17,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:47:17,179 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219263239] [2019-12-26 22:47:17,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:47:17,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:47:17,286 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-26 22:47:17,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219263239] [2019-12-26 22:47:17,287 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:47:17,287 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 22:47:17,287 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555945239] [2019-12-26 22:47:17,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 22:47:17,288 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:47:17,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 22:47:17,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:47:17,288 INFO L87 Difference]: Start difference. First operand 1497 states and 4311 transitions. Second operand 6 states. [2019-12-26 22:47:17,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:47:17,637 INFO L93 Difference]: Finished difference Result 2371 states and 6747 transitions. [2019-12-26 22:47:17,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-26 22:47:17,642 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-12-26 22:47:17,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:47:17,645 INFO L225 Difference]: With dead ends: 2371 [2019-12-26 22:47:17,645 INFO L226 Difference]: Without dead ends: 2371 [2019-12-26 22:47:17,646 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-26 22:47:17,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2371 states. [2019-12-26 22:47:17,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2371 to 1685. [2019-12-26 22:47:17,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1685 states. [2019-12-26 22:47:17,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1685 states to 1685 states and 4855 transitions. [2019-12-26 22:47:17,668 INFO L78 Accepts]: Start accepts. Automaton has 1685 states and 4855 transitions. Word has length 58 [2019-12-26 22:47:17,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:47:17,668 INFO L462 AbstractCegarLoop]: Abstraction has 1685 states and 4855 transitions. [2019-12-26 22:47:17,668 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 22:47:17,668 INFO L276 IsEmpty]: Start isEmpty. Operand 1685 states and 4855 transitions. [2019-12-26 22:47:17,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-26 22:47:17,672 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:47:17,673 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-26 22:47:17,673 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-26 22:47:17,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:47:17,673 INFO L82 PathProgramCache]: Analyzing trace with hash -774913423, now seen corresponding path program 4 times [2019-12-26 22:47:17,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:47:17,674 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387178520] [2019-12-26 22:47:17,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:47:17,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:47:17,778 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-26 22:47:17,778 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387178520] [2019-12-26 22:47:17,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:47:17,779 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 22:47:17,779 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319516627] [2019-12-26 22:47:17,779 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 22:47:17,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:47:17,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 22:47:17,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:47:17,780 INFO L87 Difference]: Start difference. First operand 1685 states and 4855 transitions. Second operand 7 states. [2019-12-26 22:47:18,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:47:18,229 INFO L93 Difference]: Finished difference Result 2624 states and 7473 transitions. [2019-12-26 22:47:18,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-26 22:47:18,229 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 58 [2019-12-26 22:47:18,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:47:18,234 INFO L225 Difference]: With dead ends: 2624 [2019-12-26 22:47:18,234 INFO L226 Difference]: Without dead ends: 2624 [2019-12-26 22:47:18,235 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-26 22:47:18,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2624 states. [2019-12-26 22:47:18,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2624 to 1601. [2019-12-26 22:47:18,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1601 states. [2019-12-26 22:47:18,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1601 states to 1601 states and 4607 transitions. [2019-12-26 22:47:18,274 INFO L78 Accepts]: Start accepts. Automaton has 1601 states and 4607 transitions. Word has length 58 [2019-12-26 22:47:18,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:47:18,274 INFO L462 AbstractCegarLoop]: Abstraction has 1601 states and 4607 transitions. [2019-12-26 22:47:18,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 22:47:18,275 INFO L276 IsEmpty]: Start isEmpty. Operand 1601 states and 4607 transitions. [2019-12-26 22:47:18,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-26 22:47:18,279 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:47:18,279 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-26 22:47:18,279 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-26 22:47:18,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:47:18,280 INFO L82 PathProgramCache]: Analyzing trace with hash -240075320, now seen corresponding path program 1 times [2019-12-26 22:47:18,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:47:18,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611637282] [2019-12-26 22:47:18,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:47:18,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:47:18,351 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-26 22:47:18,351 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611637282] [2019-12-26 22:47:18,351 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:47:18,351 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:47:18,352 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170493951] [2019-12-26 22:47:18,352 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:47:18,352 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:47:18,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:47:18,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:47:18,353 INFO L87 Difference]: Start difference. First operand 1601 states and 4607 transitions. Second operand 3 states. [2019-12-26 22:47:18,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:47:18,416 INFO L93 Difference]: Finished difference Result 1601 states and 4606 transitions. [2019-12-26 22:47:18,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:47:18,416 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-26 22:47:18,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:47:18,419 INFO L225 Difference]: With dead ends: 1601 [2019-12-26 22:47:18,419 INFO L226 Difference]: Without dead ends: 1601 [2019-12-26 22:47:18,420 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-26 22:47:18,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1601 states. [2019-12-26 22:47:18,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1601 to 1076. [2019-12-26 22:47:18,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1076 states. [2019-12-26 22:47:18,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1076 states to 1076 states and 3124 transitions. [2019-12-26 22:47:18,443 INFO L78 Accepts]: Start accepts. Automaton has 1076 states and 3124 transitions. Word has length 59 [2019-12-26 22:47:18,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:47:18,443 INFO L462 AbstractCegarLoop]: Abstraction has 1076 states and 3124 transitions. [2019-12-26 22:47:18,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:47:18,443 INFO L276 IsEmpty]: Start isEmpty. Operand 1076 states and 3124 transitions. [2019-12-26 22:47:18,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-26 22:47:18,446 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:47:18,446 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-26 22:47:18,447 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-26 22:47:18,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:47:18,447 INFO L82 PathProgramCache]: Analyzing trace with hash -248733535, now seen corresponding path program 1 times [2019-12-26 22:47:18,447 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:47:18,448 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64422634] [2019-12-26 22:47:18,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:47:18,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:47:18,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-26 22:47:18,644 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64422634] [2019-12-26 22:47:18,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:47:18,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 22:47:18,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368094322] [2019-12-26 22:47:18,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 22:47:18,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:47:18,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 22:47:18,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:47:18,646 INFO L87 Difference]: Start difference. First operand 1076 states and 3124 transitions. Second operand 7 states. [2019-12-26 22:47:18,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:47:18,804 INFO L93 Difference]: Finished difference Result 2236 states and 6157 transitions. [2019-12-26 22:47:18,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-26 22:47:18,804 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2019-12-26 22:47:18,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:47:18,808 INFO L225 Difference]: With dead ends: 2236 [2019-12-26 22:47:18,808 INFO L226 Difference]: Without dead ends: 1589 [2019-12-26 22:47:18,808 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-26 22:47:18,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1589 states. [2019-12-26 22:47:18,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1589 to 946. [2019-12-26 22:47:18,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 946 states. [2019-12-26 22:47:18,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 946 states to 946 states and 2684 transitions. [2019-12-26 22:47:18,837 INFO L78 Accepts]: Start accepts. Automaton has 946 states and 2684 transitions. Word has length 59 [2019-12-26 22:47:18,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:47:18,838 INFO L462 AbstractCegarLoop]: Abstraction has 946 states and 2684 transitions. [2019-12-26 22:47:18,838 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 22:47:18,838 INFO L276 IsEmpty]: Start isEmpty. Operand 946 states and 2684 transitions. [2019-12-26 22:47:18,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-26 22:47:18,842 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:47:18,842 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-26 22:47:18,842 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-26 22:47:18,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:47:18,843 INFO L82 PathProgramCache]: Analyzing trace with hash 1360237091, now seen corresponding path program 2 times [2019-12-26 22:47:18,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:47:18,844 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229264005] [2019-12-26 22:47:18,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:47:18,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:47:18,918 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-26 22:47:18,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229264005] [2019-12-26 22:47:18,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:47:18,920 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:47:18,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891821222] [2019-12-26 22:47:18,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:47:18,921 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:47:18,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:47:18,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:47:18,922 INFO L87 Difference]: Start difference. First operand 946 states and 2684 transitions. Second operand 3 states. [2019-12-26 22:47:18,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:47:18,944 INFO L93 Difference]: Finished difference Result 890 states and 2456 transitions. [2019-12-26 22:47:18,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:47:18,944 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-26 22:47:18,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:47:18,947 INFO L225 Difference]: With dead ends: 890 [2019-12-26 22:47:18,947 INFO L226 Difference]: Without dead ends: 890 [2019-12-26 22:47:18,947 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-26 22:47:18,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states. [2019-12-26 22:47:18,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 826. [2019-12-26 22:47:18,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 826 states. [2019-12-26 22:47:18,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 826 states to 826 states and 2272 transitions. [2019-12-26 22:47:18,969 INFO L78 Accepts]: Start accepts. Automaton has 826 states and 2272 transitions. Word has length 59 [2019-12-26 22:47:18,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:47:18,970 INFO L462 AbstractCegarLoop]: Abstraction has 826 states and 2272 transitions. [2019-12-26 22:47:18,970 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:47:18,970 INFO L276 IsEmpty]: Start isEmpty. Operand 826 states and 2272 transitions. [2019-12-26 22:47:18,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-26 22:47:18,973 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:47:18,974 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-26 22:47:18,974 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-26 22:47:18,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:47:18,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1465585068, now seen corresponding path program 1 times [2019-12-26 22:47:18,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:47:18,975 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111137316] [2019-12-26 22:47:18,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:47:19,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:47:19,116 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-26 22:47:19,116 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111137316] [2019-12-26 22:47:19,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:47:19,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 22:47:19,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984196206] [2019-12-26 22:47:19,117 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:47:19,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:47:19,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:47:19,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:47:19,119 INFO L87 Difference]: Start difference. First operand 826 states and 2272 transitions. Second operand 5 states. [2019-12-26 22:47:19,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:47:19,181 INFO L93 Difference]: Finished difference Result 1031 states and 2639 transitions. [2019-12-26 22:47:19,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:47:19,181 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2019-12-26 22:47:19,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:47:19,183 INFO L225 Difference]: With dead ends: 1031 [2019-12-26 22:47:19,183 INFO L226 Difference]: Without dead ends: 600 [2019-12-26 22:47:19,184 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:47:19,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2019-12-26 22:47:19,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 600. [2019-12-26 22:47:19,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2019-12-26 22:47:19,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 1449 transitions. [2019-12-26 22:47:19,198 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 1449 transitions. Word has length 60 [2019-12-26 22:47:19,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:47:19,198 INFO L462 AbstractCegarLoop]: Abstraction has 600 states and 1449 transitions. [2019-12-26 22:47:19,198 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:47:19,199 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 1449 transitions. [2019-12-26 22:47:19,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-26 22:47:19,201 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:47:19,201 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-26 22:47:19,201 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-26 22:47:19,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:47:19,202 INFO L82 PathProgramCache]: Analyzing trace with hash -665728346, now seen corresponding path program 2 times [2019-12-26 22:47:19,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:47:19,202 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458225642] [2019-12-26 22:47:19,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:47:19,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:47:19,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:47:19,341 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458225642] [2019-12-26 22:47:19,344 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:47:19,345 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 22:47:19,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236300428] [2019-12-26 22:47:19,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:47:19,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:47:19,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:47:19,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:47:19,347 INFO L87 Difference]: Start difference. First operand 600 states and 1449 transitions. Second operand 5 states. [2019-12-26 22:47:19,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:47:19,407 INFO L93 Difference]: Finished difference Result 785 states and 1776 transitions. [2019-12-26 22:47:19,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:47:19,407 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2019-12-26 22:47:19,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:47:19,408 INFO L225 Difference]: With dead ends: 785 [2019-12-26 22:47:19,409 INFO L226 Difference]: Without dead ends: 232 [2019-12-26 22:47:19,409 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:47:19,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2019-12-26 22:47:19,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2019-12-26 22:47:19,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-12-26 22:47:19,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 410 transitions. [2019-12-26 22:47:19,415 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 410 transitions. Word has length 60 [2019-12-26 22:47:19,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:47:19,415 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 410 transitions. [2019-12-26 22:47:19,415 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:47:19,416 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 410 transitions. [2019-12-26 22:47:19,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-26 22:47:19,417 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:47:19,417 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-26 22:47:19,418 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:47:19,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:47:19,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1097199394, now seen corresponding path program 3 times [2019-12-26 22:47:19,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:47:19,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4696923] [2019-12-26 22:47:19,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:47:19,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:47:19,830 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-26 22:47:19,830 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4696923] [2019-12-26 22:47:19,830 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:47:19,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-26 22:47:19,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484881543] [2019-12-26 22:47:19,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-26 22:47:19,832 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:47:19,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-26 22:47:19,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-12-26 22:47:19,833 INFO L87 Difference]: Start difference. First operand 232 states and 410 transitions. Second operand 14 states. [2019-12-26 22:47:20,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:47:20,440 INFO L93 Difference]: Finished difference Result 402 states and 693 transitions. [2019-12-26 22:47:20,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-26 22:47:20,441 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 60 [2019-12-26 22:47:20,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:47:20,442 INFO L225 Difference]: With dead ends: 402 [2019-12-26 22:47:20,442 INFO L226 Difference]: Without dead ends: 374 [2019-12-26 22:47:20,442 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=452, Unknown=0, NotChecked=0, Total=552 [2019-12-26 22:47:20,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2019-12-26 22:47:20,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 328. [2019-12-26 22:47:20,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-12-26 22:47:20,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 574 transitions. [2019-12-26 22:47:20,447 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 574 transitions. Word has length 60 [2019-12-26 22:47:20,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:47:20,447 INFO L462 AbstractCegarLoop]: Abstraction has 328 states and 574 transitions. [2019-12-26 22:47:20,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-26 22:47:20,448 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 574 transitions. [2019-12-26 22:47:20,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-26 22:47:20,448 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:47:20,449 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:47:20,449 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:47:20,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:47:20,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1151648330, now seen corresponding path program 4 times [2019-12-26 22:47:20,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:47:20,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500387280] [2019-12-26 22:47:20,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:47:20,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:47:20,796 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-26 22:47:20,797 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500387280] [2019-12-26 22:47:20,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:47:20,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-26 22:47:20,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341715991] [2019-12-26 22:47:20,803 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-26 22:47:20,804 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:47:20,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-26 22:47:20,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-12-26 22:47:20,804 INFO L87 Difference]: Start difference. First operand 328 states and 574 transitions. Second operand 14 states. [2019-12-26 22:47:21,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:47:21,480 INFO L93 Difference]: Finished difference Result 458 states and 779 transitions. [2019-12-26 22:47:21,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-26 22:47:21,480 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 60 [2019-12-26 22:47:21,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:47:21,482 INFO L225 Difference]: With dead ends: 458 [2019-12-26 22:47:21,482 INFO L226 Difference]: Without dead ends: 430 [2019-12-26 22:47:21,483 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=106, Invalid=494, Unknown=0, NotChecked=0, Total=600 [2019-12-26 22:47:21,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2019-12-26 22:47:21,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 332. [2019-12-26 22:47:21,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2019-12-26 22:47:21,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 581 transitions. [2019-12-26 22:47:21,488 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 581 transitions. Word has length 60 [2019-12-26 22:47:21,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:47:21,488 INFO L462 AbstractCegarLoop]: Abstraction has 332 states and 581 transitions. [2019-12-26 22:47:21,488 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-26 22:47:21,489 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 581 transitions. [2019-12-26 22:47:21,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-26 22:47:21,489 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:47:21,490 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-26 22:47:21,490 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:47:21,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:47:21,490 INFO L82 PathProgramCache]: Analyzing trace with hash -2140500766, now seen corresponding path program 5 times [2019-12-26 22:47:21,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:47:21,491 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874964911] [2019-12-26 22:47:21,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:47:21,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:47:21,702 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-26 22:47:21,703 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874964911] [2019-12-26 22:47:21,703 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:47:21,703 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-26 22:47:21,703 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418549536] [2019-12-26 22:47:21,704 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-26 22:47:21,704 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:47:21,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-26 22:47:21,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-12-26 22:47:21,704 INFO L87 Difference]: Start difference. First operand 332 states and 581 transitions. Second operand 13 states. [2019-12-26 22:47:21,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:47:21,998 INFO L93 Difference]: Finished difference Result 446 states and 758 transitions. [2019-12-26 22:47:21,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-26 22:47:21,998 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 60 [2019-12-26 22:47:21,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:47:21,999 INFO L225 Difference]: With dead ends: 446 [2019-12-26 22:47:21,999 INFO L226 Difference]: Without dead ends: 418 [2019-12-26 22:47:21,999 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2019-12-26 22:47:22,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2019-12-26 22:47:22,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 340. [2019-12-26 22:47:22,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2019-12-26 22:47:22,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 595 transitions. [2019-12-26 22:47:22,003 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 595 transitions. Word has length 60 [2019-12-26 22:47:22,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:47:22,003 INFO L462 AbstractCegarLoop]: Abstraction has 340 states and 595 transitions. [2019-12-26 22:47:22,003 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-26 22:47:22,003 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 595 transitions. [2019-12-26 22:47:22,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-26 22:47:22,005 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:47:22,005 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-26 22:47:22,005 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:47:22,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:47:22,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1858118138, now seen corresponding path program 6 times [2019-12-26 22:47:22,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:47:22,006 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209979855] [2019-12-26 22:47:22,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:47:22,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 22:47:22,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 22:47:22,120 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 22:47:22,121 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 22:47:22,125 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] ULTIMATE.startENTRY-->L831: Formula: (let ((.cse0 (store |v_#valid_75| 0 0))) (and (= 0 v_~z$flush_delayed~0_54) (< |v_#StackHeapBarrier_21| |v_ULTIMATE.start_main_~#t1277~0.base_21|) (= (store .cse0 |v_ULTIMATE.start_main_~#t1277~0.base_21| 1) |v_#valid_73|) (= |v_#NULL.offset_7| 0) (= v_~z$w_buff1_used~0_609 0) (= 0 v_~z$r_buff1_thd3~0_278) (= v_~z$w_buff0_used~0_830 0) (= v_~z$r_buff0_thd1~0_77 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1277~0.base_21|) 0) (= v_~x~0_53 0) (< 0 |v_#StackHeapBarrier_21|) (= v_~z$w_buff0~0_376 0) (= v_~z$r_buff0_thd0~0_415 0) (= v_~z$read_delayed~0_5 0) (= 0 v_~weak$$choice0~0_32) (= v_~z$read_delayed_var~0.base_5 0) (= v_~z$w_buff1~0_367 0) (= v_~weak$$choice2~0_172 0) (= v_~z$r_buff1_thd2~0_207 0) (= v_~z$r_buff1_thd1~0_207 0) (= v_~z$read_delayed_var~0.offset_5 0) (= v_~y~0_52 0) (= 0 v_~z$r_buff1_thd4~0_260) (= v_~z$mem_tmp~0_37 0) (= 0 v_~z$r_buff0_thd3~0_189) (= v_~__unbuffered_cnt~0_145 0) (= 0 |v_#NULL.base_7|) (= v_~main$tmp_guard0~0_21 0) (= v_~z~0_157 0) (= v_~a~0_207 0) (= (store |v_#length_30| |v_ULTIMATE.start_main_~#t1277~0.base_21| 4) |v_#length_29|) (= 0 v_~z$r_buff0_thd4~0_332) (= 0 v_~__unbuffered_p3_EBX~0_219) (= v_~z$r_buff0_thd2~0_78 0) (= v_~main$tmp_guard1~0_24 0) (= v_~z$r_buff1_thd0~0_431 0) (= v_~b~0_98 0) (= v_~__unbuffered_p3_EAX~0_219 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|) (= |v_ULTIMATE.start_main_~#t1277~0.offset_17| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_21|, #valid=|v_#valid_75|, #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_42|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_207, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_72|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_33|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_40|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_35|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_134|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_39|, ULTIMATE.start_main_~#t1280~0.base=|v_ULTIMATE.start_main_~#t1280~0.base_23|, ~a~0=v_~a~0_207, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_415, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_332, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_219, #length=|v_#length_29|, ~z$mem_tmp~0=v_~z$mem_tmp~0_37, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_66|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_41|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_609, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_40|, ~z$flush_delayed~0=v_~z$flush_delayed~0_54, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_52|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_76|, ~weak$$choice0~0=v_~weak$$choice0~0_32, #StackHeapBarrier=|v_#StackHeapBarrier_21|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_40|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_207, 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_189, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_145, ~x~0=v_~x~0_53, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_260, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_36|, ~z$read_delayed~0=v_~z$read_delayed~0_5, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_42|, ~z$w_buff1~0=v_~z$w_buff1~0_367, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_24, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_30|, ~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_44|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_34|, 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_36|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_42|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_48|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_431, ULTIMATE.start_main_#t~nondet26=|v_ULTIMATE.start_main_#t~nondet26_56|, ~y~0=v_~y~0_52, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_78, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_830, ~z$w_buff0~0=v_~z$w_buff0~0_376, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_30|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_56|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_278, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_53|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_82|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_219, 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_55|, ULTIMATE.start_main_~#t1278~0.base=|v_ULTIMATE.start_main_~#t1278~0.base_23|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_70|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_34|, ULTIMATE.start_main_~#t1279~0.base=|v_ULTIMATE.start_main_~#t1279~0.base_22|, ~b~0=v_~b~0_98, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, #valid=|v_#valid_73|, #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_20|, ~z~0=v_~z~0_157, ~weak$$choice2~0=v_~weak$$choice2~0_172, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_77, 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-26 22:47:22,126 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] 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-26 22:47:22,127 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] 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-26 22:47:22,127 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] 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-26 22:47:22,129 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L4-->L808: Formula: (and (= v_~z$r_buff0_thd4~0_36 1) (= v_~z$r_buff1_thd2~0_8 v_~z$r_buff0_thd2~0_7) (= v_~z$r_buff0_thd0~0_114 v_~z$r_buff1_thd0~0_75) (= 1 v_~a~0_7) (= v_~z$r_buff0_thd4~0_37 v_~z$r_buff1_thd4~0_34) (not (= v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_18 0)) (= v_~__unbuffered_p3_EAX~0_8 v_~a~0_7) (= v_~z$r_buff1_thd1~0_8 v_~z$r_buff0_thd1~0_7) (= v_~z$r_buff0_thd3~0_42 v_~z$r_buff1_thd3~0_34) (= v_~b~0_17 v_~__unbuffered_p3_EBX~0_8)) InVars {P3Thread1of1ForFork3___VERIFIER_assert_~expression=v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_18, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_114, ~b~0=v_~b~0_17, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_37, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_42, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_7, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_7} OutVars{P3Thread1of1ForFork3___VERIFIER_assert_~expression=v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_18, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_34, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_34, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_8, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_8, ~a~0=v_~a~0_7, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_114, ~b~0=v_~b~0_17, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_75, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_8, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_8, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_36, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_42, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_7, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_7} 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-26 22:47:22,130 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork0_~arg.offset_21 |v_P0Thread1of1ForFork0_#in~arg.offset_21|) (= v_~b~0_62 1) (= v_P0Thread1of1ForFork0_~arg.base_21 |v_P0Thread1of1ForFork0_#in~arg.base_21|) (= |v_P0Thread1of1ForFork0_#res.base_11| 0) (= 0 |v_P0Thread1of1ForFork0_#res.offset_11|) (= v_~__unbuffered_cnt~0_119 (+ v_~__unbuffered_cnt~0_120 1)) (= v_~x~0_42 1)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_21|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_21|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_120} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_21|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_11|, ~b~0=v_~b~0_62, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_21|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_119, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_21, ~x~0=v_~x~0_42, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_21} 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-26 22:47:22,130 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] P1ENTRY-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= |v_P1Thread1of1ForFork1_#in~arg.offset_14| v_P1Thread1of1ForFork1_~arg.offset_14) (= v_P1Thread1of1ForFork1_~arg.base_14 |v_P1Thread1of1ForFork1_#in~arg.base_14|) (= v_~y~0_33 1) (= v_~x~0_29 2) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_84 1) v_~__unbuffered_cnt~0_83)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_14|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_14|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_14, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_14, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_14|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_14|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83, ~y~0=v_~y~0_33, ~x~0=v_~x~0_29, 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-26 22:47:22,132 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L809-->L809-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd4~0_In1950388045 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1950388045 256)))) (or (and (= 0 |P3Thread1of1ForFork3_#t~ite11_Out1950388045|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In1950388045 |P3Thread1of1ForFork3_#t~ite11_Out1950388045|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1950388045, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1950388045} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1950388045, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1950388045, P3Thread1of1ForFork3_#t~ite11=|P3Thread1of1ForFork3_#t~ite11_Out1950388045|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite11] because there is no mapped edge [2019-12-26 22:47:22,133 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L810-->L810-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In-1682877216 256))) (.cse2 (= (mod ~z$r_buff1_thd4~0_In-1682877216 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1682877216 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-1682877216 256)))) (or (and (= 0 |P3Thread1of1ForFork3_#t~ite12_Out-1682877216|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~z$w_buff1_used~0_In-1682877216 |P3Thread1of1ForFork3_#t~ite12_Out-1682877216|)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1682877216, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1682877216, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1682877216, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1682877216} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1682877216, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1682877216, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1682877216, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1682877216, P3Thread1of1ForFork3_#t~ite12=|P3Thread1of1ForFork3_#t~ite12_Out-1682877216|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite12] because there is no mapped edge [2019-12-26 22:47:22,134 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L772-2-->L772-4: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd3~0_In447263142 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In447263142 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite3_Out447263142| ~z$w_buff1~0_In447263142) (not .cse1)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite3_Out447263142| ~z~0_In447263142)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In447263142, ~z$w_buff1_used~0=~z$w_buff1_used~0_In447263142, ~z$w_buff1~0=~z$w_buff1~0_In447263142, ~z~0=~z~0_In447263142} OutVars{P2Thread1of1ForFork2_#t~ite3=|P2Thread1of1ForFork2_#t~ite3_Out447263142|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In447263142, ~z$w_buff1_used~0=~z$w_buff1_used~0_In447263142, ~z$w_buff1~0=~z$w_buff1~0_In447263142, ~z~0=~z~0_In447263142} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-26 22:47:22,134 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [663] [663] L772-4-->L773: Formula: (= |v_P2Thread1of1ForFork2_#t~ite3_10| v_~z~0_32) InVars {P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_10|} OutVars{P2Thread1of1ForFork2_#t~ite4=|v_P2Thread1of1ForFork2_#t~ite4_15|, P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_9|, ~z~0=v_~z~0_32} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite4, P2Thread1of1ForFork2_#t~ite3, ~z~0] because there is no mapped edge [2019-12-26 22:47:22,134 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L773-->L773-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In73297991 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In73297991 256)))) (or (and (= ~z$w_buff0_used~0_In73297991 |P2Thread1of1ForFork2_#t~ite5_Out73297991|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite5_Out73297991|) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In73297991, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In73297991} OutVars{P2Thread1of1ForFork2_#t~ite5=|P2Thread1of1ForFork2_#t~ite5_Out73297991|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In73297991, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In73297991} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-26 22:47:22,135 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L774-->L774-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In-2114484916 256))) (.cse1 (= (mod ~z$r_buff1_thd3~0_In-2114484916 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd3~0_In-2114484916 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-2114484916 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite6_Out-2114484916|)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~z$w_buff1_used~0_In-2114484916 |P2Thread1of1ForFork2_#t~ite6_Out-2114484916|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2114484916, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2114484916, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2114484916, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2114484916} OutVars{P2Thread1of1ForFork2_#t~ite6=|P2Thread1of1ForFork2_#t~ite6_Out-2114484916|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2114484916, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2114484916, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2114484916, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2114484916} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-26 22:47:22,136 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L775-->L775-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1718480820 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd3~0_In1718480820 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork2_#t~ite7_Out1718480820|)) (and (= ~z$r_buff0_thd3~0_In1718480820 |P2Thread1of1ForFork2_#t~ite7_Out1718480820|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1718480820, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1718480820} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1718480820, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1718480820, P2Thread1of1ForFork2_#t~ite7=|P2Thread1of1ForFork2_#t~ite7_Out1718480820|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-26 22:47:22,137 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L776-->L776-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In2095448268 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In2095448268 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In2095448268 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd3~0_In2095448268 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd3~0_In2095448268 |P2Thread1of1ForFork2_#t~ite8_Out2095448268|) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork2_#t~ite8_Out2095448268|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2095448268, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2095448268, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2095448268, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2095448268} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2095448268, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2095448268, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2095448268, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2095448268, P2Thread1of1ForFork2_#t~ite8=|P2Thread1of1ForFork2_#t~ite8_Out2095448268|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-26 22:47:22,137 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L776-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#t~ite8_36| v_~z$r_buff1_thd3~0_64) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_77 (+ v_~__unbuffered_cnt~0_78 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_36|} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_64, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_35|} 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-26 22:47:22,138 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L811-->L812: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In-78760162 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-78760162 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd4~0_Out-78760162 ~z$r_buff0_thd4~0_In-78760162)) (and (not .cse0) (not .cse1) (= 0 ~z$r_buff0_thd4~0_Out-78760162)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-78760162, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-78760162} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-78760162, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-78760162, P3Thread1of1ForFork3_#t~ite13=|P3Thread1of1ForFork3_#t~ite13_Out-78760162|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~ite13] because there is no mapped edge [2019-12-26 22:47:22,138 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L812-->L812-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd4~0_In1842657477 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In1842657477 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd4~0_In1842657477 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In1842657477 256)))) (or (and (= |P3Thread1of1ForFork3_#t~ite14_Out1842657477| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P3Thread1of1ForFork3_#t~ite14_Out1842657477| ~z$r_buff1_thd4~0_In1842657477)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1842657477, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1842657477, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1842657477, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1842657477} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1842657477, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1842657477, P3Thread1of1ForFork3_#t~ite14=|P3Thread1of1ForFork3_#t~ite14_Out1842657477|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1842657477, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1842657477} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite14] because there is no mapped edge [2019-12-26 22:47:22,138 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L812-2-->P3EXIT: Formula: (and (= v_~__unbuffered_cnt~0_107 (+ v_~__unbuffered_cnt~0_108 1)) (= |v_P3Thread1of1ForFork3_#t~ite14_46| v_~z$r_buff1_thd4~0_75) (= 0 |v_P3Thread1of1ForFork3_#res.offset_5|) (= 0 |v_P3Thread1of1ForFork3_#res.base_5|)) InVars {P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_46|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_108} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_75, P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_45|, P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107, 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-26 22:47:22,138 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L837-1-->L843: Formula: (and (= 4 v_~__unbuffered_cnt~0_62) (= v_~main$tmp_guard0~0_8 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_8|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet18] because there is no mapped edge [2019-12-26 22:47:22,139 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L843-2-->L843-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite20_Out895473042| |ULTIMATE.start_main_#t~ite19_Out895473042|)) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In895473042 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In895473042 256)))) (or (and .cse0 (or .cse1 .cse2) (= ~z~0_In895473042 |ULTIMATE.start_main_#t~ite19_Out895473042|)) (and (= ~z$w_buff1~0_In895473042 |ULTIMATE.start_main_#t~ite19_Out895473042|) .cse0 (not .cse1) (not .cse2)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In895473042, ~z$w_buff1_used~0=~z$w_buff1_used~0_In895473042, ~z$w_buff1~0=~z$w_buff1~0_In895473042, ~z~0=~z~0_In895473042} OutVars{ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out895473042|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In895473042, ~z$w_buff1_used~0=~z$w_buff1_used~0_In895473042, ~z$w_buff1~0=~z$w_buff1~0_In895473042, ~z~0=~z~0_In895473042, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out895473042|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-26 22:47:22,140 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L844-->L844-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In2095770526 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In2095770526 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite21_Out2095770526| ~z$w_buff0_used~0_In2095770526)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite21_Out2095770526| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2095770526, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2095770526} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2095770526, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2095770526, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out2095770526|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-26 22:47:22,141 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L845-->L845-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In-749479037 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In-749479037 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-749479037 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-749479037 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite22_Out-749479037|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~z$w_buff1_used~0_In-749479037 |ULTIMATE.start_main_#t~ite22_Out-749479037|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-749479037, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-749479037, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-749479037, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-749479037} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-749479037, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-749479037, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-749479037, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-749479037, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-749479037|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-26 22:47:22,142 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L846-->L846-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1585010071 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-1585010071 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite23_Out-1585010071|)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In-1585010071 |ULTIMATE.start_main_#t~ite23_Out-1585010071|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1585010071, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1585010071} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1585010071, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1585010071, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-1585010071|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-26 22:47:22,143 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L847-->L847-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In-1954190168 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1954190168 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1954190168 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-1954190168 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite24_Out-1954190168| 0)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite24_Out-1954190168| ~z$r_buff1_thd0~0_In-1954190168)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1954190168, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1954190168, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1954190168, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1954190168} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1954190168, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1954190168, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1954190168, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-1954190168|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1954190168} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24] because there is no mapped edge [2019-12-26 22:47:22,146 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L855-->L855-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-508393368 256)))) (or (and (= |ULTIMATE.start_main_#t~ite30_In-508393368| |ULTIMATE.start_main_#t~ite30_Out-508393368|) (not .cse0) (= ~z$w_buff0~0_In-508393368 |ULTIMATE.start_main_#t~ite31_Out-508393368|)) (and (= ~z$w_buff0~0_In-508393368 |ULTIMATE.start_main_#t~ite30_Out-508393368|) (= |ULTIMATE.start_main_#t~ite31_Out-508393368| |ULTIMATE.start_main_#t~ite30_Out-508393368|) .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-508393368 256)))) (or (= 0 (mod ~z$w_buff0_used~0_In-508393368 256)) (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In-508393368 256))) (and .cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-508393368 256)))))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-508393368, ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_In-508393368|, ~z$w_buff0~0=~z$w_buff0~0_In-508393368, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-508393368, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-508393368, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-508393368, ~weak$$choice2~0=~weak$$choice2~0_In-508393368} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-508393368, ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_Out-508393368|, ~z$w_buff0~0=~z$w_buff0~0_In-508393368, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-508393368, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-508393368, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-508393368, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_Out-508393368|, ~weak$$choice2~0=~weak$$choice2~0_In-508393368} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_#t~ite31] because there is no mapped edge [2019-12-26 22:47:22,147 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L856-->L856-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In62152808 256) 0))) (or (and .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In62152808 256)))) (or (= (mod ~z$w_buff0_used~0_In62152808 256) 0) (and .cse1 (= (mod ~z$w_buff1_used~0_In62152808 256) 0)) (and .cse1 (= 0 (mod ~z$r_buff1_thd0~0_In62152808 256))))) (= |ULTIMATE.start_main_#t~ite34_Out62152808| |ULTIMATE.start_main_#t~ite33_Out62152808|) (= |ULTIMATE.start_main_#t~ite33_Out62152808| ~z$w_buff1~0_In62152808)) (and (= |ULTIMATE.start_main_#t~ite34_Out62152808| ~z$w_buff1~0_In62152808) (= |ULTIMATE.start_main_#t~ite33_In62152808| |ULTIMATE.start_main_#t~ite33_Out62152808|) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In62152808, ~z$w_buff0_used~0=~z$w_buff0_used~0_In62152808, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In62152808, ~z$w_buff1_used~0=~z$w_buff1_used~0_In62152808, ~z$w_buff1~0=~z$w_buff1~0_In62152808, ~weak$$choice2~0=~weak$$choice2~0_In62152808, ULTIMATE.start_main_#t~ite33=|ULTIMATE.start_main_#t~ite33_In62152808|} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In62152808, ~z$w_buff0_used~0=~z$w_buff0_used~0_In62152808, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In62152808, ~z$w_buff1_used~0=~z$w_buff1_used~0_In62152808, ~z$w_buff1~0=~z$w_buff1~0_In62152808, ~weak$$choice2~0=~weak$$choice2~0_In62152808, ULTIMATE.start_main_#t~ite33=|ULTIMATE.start_main_#t~ite33_Out62152808|, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out62152808|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite33, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-26 22:47:22,150 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L859-->L860: Formula: (and (= v_~z$r_buff0_thd0~0_108 v_~z$r_buff0_thd0~0_107) (not (= 0 (mod v_~weak$$choice2~0_33 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_108, ~weak$$choice2~0=v_~weak$$choice2~0_33} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_8|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_107, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_9|, ~weak$$choice2~0=v_~weak$$choice2~0_33, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_11|} 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-26 22:47:22,151 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L860-->L860-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In217628249 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out217628249| ~z$r_buff1_thd0~0_In217628249) .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In217628249 256)))) (or (= (mod ~z$w_buff0_used~0_In217628249 256) 0) (and .cse1 (= (mod ~z$w_buff1_used~0_In217628249 256) 0)) (and .cse1 (= (mod ~z$r_buff1_thd0~0_In217628249 256) 0)))) (= |ULTIMATE.start_main_#t~ite45_Out217628249| |ULTIMATE.start_main_#t~ite46_Out217628249|)) (and (not .cse0) (= ~z$r_buff1_thd0~0_In217628249 |ULTIMATE.start_main_#t~ite46_Out217628249|) (= |ULTIMATE.start_main_#t~ite45_In217628249| |ULTIMATE.start_main_#t~ite45_Out217628249|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In217628249, ~z$w_buff0_used~0=~z$w_buff0_used~0_In217628249, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In217628249, ~z$w_buff1_used~0=~z$w_buff1_used~0_In217628249, ~weak$$choice2~0=~weak$$choice2~0_In217628249, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_In217628249|} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In217628249, ~z$w_buff0_used~0=~z$w_buff0_used~0_In217628249, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In217628249, ~z$w_buff1_used~0=~z$w_buff1_used~0_In217628249, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out217628249|, ~weak$$choice2~0=~weak$$choice2~0_In217628249, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out217628249|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-26 22:47:22,152 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L862-->L4: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5| (mod v_~main$tmp_guard1~0_8 256)) (not (= 0 (mod v_~z$flush_delayed~0_30 256))) (= v_~z$mem_tmp~0_20 v_~z~0_83) (= 0 v_~z$flush_delayed~0_29)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_20, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~z$flush_delayed~0=v_~z$flush_delayed~0_30} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_20, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_9, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_17|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~z$flush_delayed~0=v_~z$flush_delayed~0_29, ~z~0=v_~z~0_83, 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-26 22:47:22,152 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] 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-26 22:47:22,263 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 10:47:22 BasicIcfg [2019-12-26 22:47:22,264 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 22:47:22,265 INFO L168 Benchmark]: Toolchain (without parser) took 29191.23 ms. Allocated memory was 138.9 MB in the beginning and 1.5 GB in the end (delta: 1.4 GB). Free memory was 102.1 MB in the beginning and 658.6 MB in the end (delta: -556.5 MB). Peak memory consumption was 795.1 MB. Max. memory is 7.1 GB. [2019-12-26 22:47:22,266 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-26 22:47:22,267 INFO L168 Benchmark]: CACSL2BoogieTranslator took 760.74 ms. Allocated memory was 138.9 MB in the beginning and 203.9 MB in the end (delta: 65.0 MB). Free memory was 101.9 MB in the beginning and 157.4 MB in the end (delta: -55.5 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. [2019-12-26 22:47:22,268 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.30 ms. Allocated memory is still 203.9 MB. Free memory was 157.4 MB in the beginning and 154.1 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-12-26 22:47:22,268 INFO L168 Benchmark]: Boogie Preprocessor took 51.47 ms. Allocated memory is still 203.9 MB. Free memory was 154.1 MB in the beginning and 152.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-26 22:47:22,269 INFO L168 Benchmark]: RCFGBuilder took 858.31 ms. Allocated memory is still 203.9 MB. Free memory was 152.1 MB in the beginning and 102.7 MB in the end (delta: 49.4 MB). Peak memory consumption was 49.4 MB. Max. memory is 7.1 GB. [2019-12-26 22:47:22,270 INFO L168 Benchmark]: TraceAbstraction took 27443.73 ms. Allocated memory was 203.9 MB in the beginning and 1.5 GB in the end (delta: 1.3 GB). Free memory was 102.1 MB in the beginning and 658.6 MB in the end (delta: -556.5 MB). Peak memory consumption was 730.1 MB. Max. memory is 7.1 GB. [2019-12-26 22:47:22,273 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.21 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 760.74 ms. Allocated memory was 138.9 MB in the beginning and 203.9 MB in the end (delta: 65.0 MB). Free memory was 101.9 MB in the beginning and 157.4 MB in the end (delta: -55.5 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 71.30 ms. Allocated memory is still 203.9 MB. Free memory was 157.4 MB in the beginning and 154.1 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 51.47 ms. Allocated memory is still 203.9 MB. Free memory was 154.1 MB in the beginning and 152.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 858.31 ms. Allocated memory is still 203.9 MB. Free memory was 152.1 MB in the beginning and 102.7 MB in the end (delta: 49.4 MB). Peak memory consumption was 49.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 27443.73 ms. Allocated memory was 203.9 MB in the beginning and 1.5 GB in the end (delta: 1.3 GB). Free memory was 102.1 MB in the beginning and 658.6 MB in the end (delta: -556.5 MB). Peak memory consumption was 730.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.7s, 180 ProgramPointsBefore, 89 ProgramPointsAfterwards, 208 TransitionsBefore, 95 TransitionsAfterwards, 12668 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 36 ConcurrentYvCompositions, 27 ChoiceCompositions, 5121 VarBasedMoverChecksPositive, 269 VarBasedMoverChecksNegative, 136 SemBasedMoverChecksPositive, 198 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.5s, 0 MoverChecksTotal, 49999 CheckedPairsTotal, 122 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: 27.1s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 9.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1992 SDtfs, 2020 SDslu, 5376 SDs, 0 SdLazy, 2547 SolverSat, 180 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 177 GetRequests, 36 SyntacticMatches, 13 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=47746occurred 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: 5.7s AutomataMinimizationTime, 19 MinimizatonAttempts, 9092 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 928 NumberOfCodeBlocks, 928 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 849 ConstructedInterpolants, 0 QuantifiedInterpolants, 192208 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...