/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix040_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 17:23:01,826 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 17:23:01,829 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 17:23:01,847 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 17:23:01,847 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 17:23:01,849 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 17:23:01,850 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 17:23:01,852 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 17:23:01,854 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 17:23:01,855 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 17:23:01,856 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 17:23:01,857 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 17:23:01,857 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 17:23:01,858 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 17:23:01,859 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 17:23:01,860 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 17:23:01,861 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 17:23:01,862 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 17:23:01,864 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 17:23:01,866 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 17:23:01,867 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 17:23:01,868 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 17:23:01,869 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 17:23:01,870 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 17:23:01,876 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 17:23:01,876 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 17:23:01,876 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 17:23:01,877 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 17:23:01,878 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 17:23:01,881 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 17:23:01,881 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 17:23:01,883 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 17:23:01,884 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 17:23:01,885 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 17:23:01,886 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 17:23:01,886 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 17:23:01,887 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 17:23:01,887 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 17:23:01,887 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 17:23:01,891 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 17:23:01,892 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 17:23:01,892 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-18 17:23:01,915 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 17:23:01,916 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 17:23:01,919 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 17:23:01,919 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 17:23:01,920 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 17:23:01,920 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 17:23:01,920 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 17:23:01,921 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 17:23:01,921 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 17:23:01,921 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 17:23:01,922 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 17:23:01,922 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 17:23:01,922 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 17:23:01,923 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 17:23:01,923 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 17:23:01,923 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 17:23:01,923 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 17:23:01,924 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 17:23:01,924 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 17:23:01,924 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 17:23:01,925 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 17:23:01,925 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 17:23:01,925 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 17:23:01,925 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 17:23:01,925 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 17:23:01,926 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 17:23:01,926 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 17:23:01,926 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 17:23:01,926 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 17:23:02,240 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 17:23:02,258 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 17:23:02,261 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 17:23:02,263 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 17:23:02,263 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 17:23:02,264 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix040_power.opt.i [2019-12-18 17:23:02,332 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff5548d83/fc7d096dbd744a2fb0b5445c94505f4e/FLAG25eb394ec [2019-12-18 17:23:02,862 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 17:23:02,863 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix040_power.opt.i [2019-12-18 17:23:02,878 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff5548d83/fc7d096dbd744a2fb0b5445c94505f4e/FLAG25eb394ec [2019-12-18 17:23:03,188 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff5548d83/fc7d096dbd744a2fb0b5445c94505f4e [2019-12-18 17:23:03,198 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 17:23:03,200 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 17:23:03,201 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 17:23:03,201 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 17:23:03,205 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 17:23:03,206 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 05:23:03" (1/1) ... [2019-12-18 17:23:03,209 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75cc43a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:23:03, skipping insertion in model container [2019-12-18 17:23:03,209 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 05:23:03" (1/1) ... [2019-12-18 17:23:03,217 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 17:23:03,266 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 17:23:03,784 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 17:23:03,798 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 17:23:03,872 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 17:23:03,947 INFO L208 MainTranslator]: Completed translation [2019-12-18 17:23:03,948 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:23:03 WrapperNode [2019-12-18 17:23:03,948 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 17:23:03,949 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 17:23:03,949 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 17:23:03,949 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 17:23:03,958 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:23:03" (1/1) ... [2019-12-18 17:23:03,981 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:23:03" (1/1) ... [2019-12-18 17:23:04,014 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 17:23:04,014 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 17:23:04,014 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 17:23:04,015 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 17:23:04,024 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:23:03" (1/1) ... [2019-12-18 17:23:04,024 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:23:03" (1/1) ... [2019-12-18 17:23:04,030 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:23:03" (1/1) ... [2019-12-18 17:23:04,031 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:23:03" (1/1) ... [2019-12-18 17:23:04,050 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:23:03" (1/1) ... [2019-12-18 17:23:04,053 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:23:03" (1/1) ... [2019-12-18 17:23:04,057 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:23:03" (1/1) ... [2019-12-18 17:23:04,062 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 17:23:04,068 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 17:23:04,069 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 17:23:04,069 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 17:23:04,070 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:23:03" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 17:23:04,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 17:23:04,122 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 17:23:04,122 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 17:23:04,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 17:23:04,123 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 17:23:04,123 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 17:23:04,124 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 17:23:04,125 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 17:23:04,126 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 17:23:04,126 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 17:23:04,127 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-18 17:23:04,128 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-18 17:23:04,128 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 17:23:04,128 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 17:23:04,128 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 17:23:04,130 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 17:23:04,872 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 17:23:04,872 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 17:23:04,875 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 05:23:04 BoogieIcfgContainer [2019-12-18 17:23:04,875 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 17:23:04,877 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 17:23:04,877 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 17:23:04,881 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 17:23:04,882 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 05:23:03" (1/3) ... [2019-12-18 17:23:04,883 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6121321f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 05:23:04, skipping insertion in model container [2019-12-18 17:23:04,883 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:23:03" (2/3) ... [2019-12-18 17:23:04,884 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6121321f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 05:23:04, skipping insertion in model container [2019-12-18 17:23:04,884 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 05:23:04" (3/3) ... [2019-12-18 17:23:04,886 INFO L109 eAbstractionObserver]: Analyzing ICFG mix040_power.opt.i [2019-12-18 17:23:04,897 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 17:23:04,898 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 17:23:04,910 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 17:23:04,911 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 17:23:04,961 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,962 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,962 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,962 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,963 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,963 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,964 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,964 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,966 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,966 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,966 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,967 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,967 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,967 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,967 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,967 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,968 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,968 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,969 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,969 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,969 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,969 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,970 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,970 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,970 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,971 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,971 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,971 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,971 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,971 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,972 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,972 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,972 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,973 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,973 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,973 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,973 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,974 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,974 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,974 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,975 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,975 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,975 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,975 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,976 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,976 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,976 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,976 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,977 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,977 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,977 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,977 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,977 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,978 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,978 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,978 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,978 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,979 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,979 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,979 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,980 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,980 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,980 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,980 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,981 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,981 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,981 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,981 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,994 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,994 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,994 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,995 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,995 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,995 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,996 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,996 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,997 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,997 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,998 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,998 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,998 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,998 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,999 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,999 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,999 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:04,999 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:05,000 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:05,000 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:05,000 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:05,000 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:05,001 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:05,001 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:05,001 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:05,001 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:05,001 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:05,002 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:05,002 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:05,002 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:05,002 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:05,003 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:05,003 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:05,003 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:05,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:05,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:05,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:05,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:05,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:05,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:05,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:05,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:05,026 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:05,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:05,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:05,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:05,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:05,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:05,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:05,028 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:05,028 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:05,028 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:05,028 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:05,028 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:05,029 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:05,029 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:05,029 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:05,029 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:05,029 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:05,029 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:05,031 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:05,037 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:05,038 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:05,038 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:05,038 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:05,038 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:05,038 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:05,040 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:05,040 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:05,040 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:05,040 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:05,041 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:05,041 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:05,043 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:05,043 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:05,044 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:05,044 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:05,045 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:05,046 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:05,046 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:05,046 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:23:05,060 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-18 17:23:05,081 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 17:23:05,081 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 17:23:05,081 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 17:23:05,081 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 17:23:05,081 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 17:23:05,082 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 17:23:05,082 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 17:23:05,082 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 17:23:05,099 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 169 places, 191 transitions [2019-12-18 17:23:05,101 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 169 places, 191 transitions [2019-12-18 17:23:05,182 INFO L126 PetriNetUnfolder]: 35/187 cut-off events. [2019-12-18 17:23:05,183 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 17:23:05,199 INFO L76 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 187 events. 35/187 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 349 event pairs. 12/162 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-18 17:23:05,220 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 169 places, 191 transitions [2019-12-18 17:23:05,263 INFO L126 PetriNetUnfolder]: 35/187 cut-off events. [2019-12-18 17:23:05,263 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 17:23:05,269 INFO L76 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 187 events. 35/187 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 349 event pairs. 12/162 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-18 17:23:05,285 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12650 [2019-12-18 17:23:05,286 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 17:23:10,529 WARN L192 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-18 17:23:10,696 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-12-18 17:23:10,708 INFO L206 etLargeBlockEncoding]: Checked pairs total: 46301 [2019-12-18 17:23:10,709 INFO L214 etLargeBlockEncoding]: Total number of compositions: 118 [2019-12-18 17:23:10,712 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 79 places, 83 transitions [2019-12-18 17:23:12,306 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 27254 states. [2019-12-18 17:23:12,308 INFO L276 IsEmpty]: Start isEmpty. Operand 27254 states. [2019-12-18 17:23:12,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 17:23:12,315 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:23:12,315 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:23:12,316 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:23:12,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:23:12,322 INFO L82 PathProgramCache]: Analyzing trace with hash -2114616633, now seen corresponding path program 1 times [2019-12-18 17:23:12,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:23:12,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108213893] [2019-12-18 17:23:12,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:23:12,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:23:12,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:23:12,677 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108213893] [2019-12-18 17:23:12,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:23:12,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 17:23:12,679 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624133871] [2019-12-18 17:23:12,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:23:12,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:23:12,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:23:12,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:23:12,713 INFO L87 Difference]: Start difference. First operand 27254 states. Second operand 3 states. [2019-12-18 17:23:14,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:23:14,314 INFO L93 Difference]: Finished difference Result 26518 states and 112736 transitions. [2019-12-18 17:23:14,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:23:14,316 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-18 17:23:14,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:23:14,575 INFO L225 Difference]: With dead ends: 26518 [2019-12-18 17:23:14,575 INFO L226 Difference]: Without dead ends: 24958 [2019-12-18 17:23:14,577 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:23:14,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24958 states. [2019-12-18 17:23:15,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24958 to 24958. [2019-12-18 17:23:15,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24958 states. [2019-12-18 17:23:15,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24958 states to 24958 states and 105960 transitions. [2019-12-18 17:23:15,823 INFO L78 Accepts]: Start accepts. Automaton has 24958 states and 105960 transitions. Word has length 9 [2019-12-18 17:23:15,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:23:15,825 INFO L462 AbstractCegarLoop]: Abstraction has 24958 states and 105960 transitions. [2019-12-18 17:23:15,825 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:23:15,825 INFO L276 IsEmpty]: Start isEmpty. Operand 24958 states and 105960 transitions. [2019-12-18 17:23:15,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 17:23:15,837 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:23:15,837 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:23:15,837 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:23:15,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:23:15,838 INFO L82 PathProgramCache]: Analyzing trace with hash -1982620494, now seen corresponding path program 1 times [2019-12-18 17:23:15,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:23:15,838 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100289039] [2019-12-18 17:23:15,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:23:15,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:23:15,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:23:15,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100289039] [2019-12-18 17:23:15,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:23:15,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:23:15,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844638491] [2019-12-18 17:23:15,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:23:15,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:23:15,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:23:15,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:23:15,899 INFO L87 Difference]: Start difference. First operand 24958 states and 105960 transitions. Second operand 3 states. [2019-12-18 17:23:16,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:23:16,323 INFO L93 Difference]: Finished difference Result 19953 states and 78654 transitions. [2019-12-18 17:23:16,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:23:16,324 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-18 17:23:16,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:23:16,441 INFO L225 Difference]: With dead ends: 19953 [2019-12-18 17:23:16,441 INFO L226 Difference]: Without dead ends: 19953 [2019-12-18 17:23:16,443 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:23:18,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19953 states. [2019-12-18 17:23:18,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19953 to 19953. [2019-12-18 17:23:18,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19953 states. [2019-12-18 17:23:18,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19953 states to 19953 states and 78654 transitions. [2019-12-18 17:23:18,485 INFO L78 Accepts]: Start accepts. Automaton has 19953 states and 78654 transitions. Word has length 15 [2019-12-18 17:23:18,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:23:18,486 INFO L462 AbstractCegarLoop]: Abstraction has 19953 states and 78654 transitions. [2019-12-18 17:23:18,486 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:23:18,486 INFO L276 IsEmpty]: Start isEmpty. Operand 19953 states and 78654 transitions. [2019-12-18 17:23:18,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 17:23:18,489 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:23:18,489 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:23:18,490 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:23:18,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:23:18,490 INFO L82 PathProgramCache]: Analyzing trace with hash 832904726, now seen corresponding path program 1 times [2019-12-18 17:23:18,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:23:18,491 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993226327] [2019-12-18 17:23:18,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:23:18,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:23:18,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:23:18,598 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993226327] [2019-12-18 17:23:18,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:23:18,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:23:18,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463422885] [2019-12-18 17:23:18,599 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:23:18,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:23:18,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:23:18,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:23:18,600 INFO L87 Difference]: Start difference. First operand 19953 states and 78654 transitions. Second operand 4 states. [2019-12-18 17:23:18,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:23:18,681 INFO L93 Difference]: Finished difference Result 9211 states and 30743 transitions. [2019-12-18 17:23:18,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 17:23:18,682 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 17:23:18,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:23:18,714 INFO L225 Difference]: With dead ends: 9211 [2019-12-18 17:23:18,714 INFO L226 Difference]: Without dead ends: 9211 [2019-12-18 17:23:18,715 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:23:19,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9211 states. [2019-12-18 17:23:19,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9211 to 9211. [2019-12-18 17:23:19,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9211 states. [2019-12-18 17:23:19,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9211 states to 9211 states and 30743 transitions. [2019-12-18 17:23:19,184 INFO L78 Accepts]: Start accepts. Automaton has 9211 states and 30743 transitions. Word has length 16 [2019-12-18 17:23:19,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:23:19,184 INFO L462 AbstractCegarLoop]: Abstraction has 9211 states and 30743 transitions. [2019-12-18 17:23:19,184 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:23:19,184 INFO L276 IsEmpty]: Start isEmpty. Operand 9211 states and 30743 transitions. [2019-12-18 17:23:19,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 17:23:19,187 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:23:19,187 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:23:19,187 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:23:19,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:23:19,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1159456736, now seen corresponding path program 1 times [2019-12-18 17:23:19,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:23:19,188 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741559291] [2019-12-18 17:23:19,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:23:19,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:23:19,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:23:19,270 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741559291] [2019-12-18 17:23:19,270 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:23:19,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 17:23:19,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069855307] [2019-12-18 17:23:19,271 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:23:19,271 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:23:19,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:23:19,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:23:19,272 INFO L87 Difference]: Start difference. First operand 9211 states and 30743 transitions. Second operand 5 states. [2019-12-18 17:23:19,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:23:19,334 INFO L93 Difference]: Finished difference Result 2716 states and 8200 transitions. [2019-12-18 17:23:19,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:23:19,335 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-18 17:23:19,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:23:19,344 INFO L225 Difference]: With dead ends: 2716 [2019-12-18 17:23:19,345 INFO L226 Difference]: Without dead ends: 2716 [2019-12-18 17:23:19,345 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:23:19,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2716 states. [2019-12-18 17:23:19,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2716 to 2716. [2019-12-18 17:23:19,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2716 states. [2019-12-18 17:23:19,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2716 states to 2716 states and 8200 transitions. [2019-12-18 17:23:19,399 INFO L78 Accepts]: Start accepts. Automaton has 2716 states and 8200 transitions. Word has length 17 [2019-12-18 17:23:19,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:23:19,399 INFO L462 AbstractCegarLoop]: Abstraction has 2716 states and 8200 transitions. [2019-12-18 17:23:19,401 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:23:19,401 INFO L276 IsEmpty]: Start isEmpty. Operand 2716 states and 8200 transitions. [2019-12-18 17:23:19,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 17:23:19,403 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:23:19,403 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:23:19,403 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:23:19,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:23:19,404 INFO L82 PathProgramCache]: Analyzing trace with hash 965433528, now seen corresponding path program 1 times [2019-12-18 17:23:19,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:23:19,405 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529722677] [2019-12-18 17:23:19,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:23:19,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:23:19,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:23:19,542 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529722677] [2019-12-18 17:23:19,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:23:19,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:23:19,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368262045] [2019-12-18 17:23:19,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:23:19,543 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:23:19,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:23:19,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:23:19,544 INFO L87 Difference]: Start difference. First operand 2716 states and 8200 transitions. Second operand 4 states. [2019-12-18 17:23:19,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:23:19,754 INFO L93 Difference]: Finished difference Result 3607 states and 10783 transitions. [2019-12-18 17:23:19,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:23:19,755 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-18 17:23:19,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:23:19,762 INFO L225 Difference]: With dead ends: 3607 [2019-12-18 17:23:19,762 INFO L226 Difference]: Without dead ends: 3607 [2019-12-18 17:23:19,763 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:23:19,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3607 states. [2019-12-18 17:23:19,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3607 to 3415. [2019-12-18 17:23:19,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3415 states. [2019-12-18 17:23:19,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3415 states to 3415 states and 10347 transitions. [2019-12-18 17:23:19,842 INFO L78 Accepts]: Start accepts. Automaton has 3415 states and 10347 transitions. Word has length 18 [2019-12-18 17:23:19,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:23:19,842 INFO L462 AbstractCegarLoop]: Abstraction has 3415 states and 10347 transitions. [2019-12-18 17:23:19,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:23:19,843 INFO L276 IsEmpty]: Start isEmpty. Operand 3415 states and 10347 transitions. [2019-12-18 17:23:19,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-18 17:23:19,850 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:23:19,850 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] [2019-12-18 17:23:19,850 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:23:19,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:23:19,851 INFO L82 PathProgramCache]: Analyzing trace with hash -792380239, now seen corresponding path program 1 times [2019-12-18 17:23:19,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:23:19,851 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745990386] [2019-12-18 17:23:19,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:23:19,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:23:19,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:23:19,944 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745990386] [2019-12-18 17:23:19,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:23:19,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:23:19,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368796942] [2019-12-18 17:23:19,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:23:19,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:23:19,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:23:19,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:23:19,945 INFO L87 Difference]: Start difference. First operand 3415 states and 10347 transitions. Second operand 3 states. [2019-12-18 17:23:19,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:23:19,978 INFO L93 Difference]: Finished difference Result 5436 states and 15699 transitions. [2019-12-18 17:23:19,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:23:19,979 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-12-18 17:23:19,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:23:19,986 INFO L225 Difference]: With dead ends: 5436 [2019-12-18 17:23:19,986 INFO L226 Difference]: Without dead ends: 3574 [2019-12-18 17:23:19,987 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:23:19,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3574 states. [2019-12-18 17:23:20,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3574 to 3488. [2019-12-18 17:23:20,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3488 states. [2019-12-18 17:23:20,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3488 states to 3488 states and 9360 transitions. [2019-12-18 17:23:20,053 INFO L78 Accepts]: Start accepts. Automaton has 3488 states and 9360 transitions. Word has length 32 [2019-12-18 17:23:20,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:23:20,053 INFO L462 AbstractCegarLoop]: Abstraction has 3488 states and 9360 transitions. [2019-12-18 17:23:20,053 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:23:20,053 INFO L276 IsEmpty]: Start isEmpty. Operand 3488 states and 9360 transitions. [2019-12-18 17:23:20,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-18 17:23:20,061 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:23:20,061 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] [2019-12-18 17:23:20,061 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:23:20,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:23:20,061 INFO L82 PathProgramCache]: Analyzing trace with hash -617388800, now seen corresponding path program 1 times [2019-12-18 17:23:20,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:23:20,062 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779409131] [2019-12-18 17:23:20,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:23:20,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:23:20,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:23:20,110 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779409131] [2019-12-18 17:23:20,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:23:20,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:23:20,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699549310] [2019-12-18 17:23:20,111 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:23:20,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:23:20,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:23:20,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:23:20,112 INFO L87 Difference]: Start difference. First operand 3488 states and 9360 transitions. Second operand 3 states. [2019-12-18 17:23:20,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:23:20,165 INFO L93 Difference]: Finished difference Result 5140 states and 13647 transitions. [2019-12-18 17:23:20,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:23:20,166 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-12-18 17:23:20,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:23:20,173 INFO L225 Difference]: With dead ends: 5140 [2019-12-18 17:23:20,173 INFO L226 Difference]: Without dead ends: 5140 [2019-12-18 17:23:20,174 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:23:20,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5140 states. [2019-12-18 17:23:20,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5140 to 4152. [2019-12-18 17:23:20,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4152 states. [2019-12-18 17:23:20,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4152 states to 4152 states and 11165 transitions. [2019-12-18 17:23:20,254 INFO L78 Accepts]: Start accepts. Automaton has 4152 states and 11165 transitions. Word has length 32 [2019-12-18 17:23:20,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:23:20,255 INFO L462 AbstractCegarLoop]: Abstraction has 4152 states and 11165 transitions. [2019-12-18 17:23:20,255 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:23:20,255 INFO L276 IsEmpty]: Start isEmpty. Operand 4152 states and 11165 transitions. [2019-12-18 17:23:20,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-18 17:23:20,264 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:23:20,264 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] [2019-12-18 17:23:20,265 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:23:20,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:23:20,265 INFO L82 PathProgramCache]: Analyzing trace with hash 937445460, now seen corresponding path program 1 times [2019-12-18 17:23:20,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:23:20,266 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43696054] [2019-12-18 17:23:20,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:23:20,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:23:20,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:23:20,313 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43696054] [2019-12-18 17:23:20,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:23:20,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:23:20,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031264936] [2019-12-18 17:23:20,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:23:20,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:23:20,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:23:20,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:23:20,315 INFO L87 Difference]: Start difference. First operand 4152 states and 11165 transitions. Second operand 3 states. [2019-12-18 17:23:20,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:23:20,381 INFO L93 Difference]: Finished difference Result 5140 states and 13308 transitions. [2019-12-18 17:23:20,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:23:20,382 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-12-18 17:23:20,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:23:20,392 INFO L225 Difference]: With dead ends: 5140 [2019-12-18 17:23:20,392 INFO L226 Difference]: Without dead ends: 5140 [2019-12-18 17:23:20,393 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:23:20,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5140 states. [2019-12-18 17:23:20,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5140 to 4108. [2019-12-18 17:23:20,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4108 states. [2019-12-18 17:23:20,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4108 states to 4108 states and 10730 transitions. [2019-12-18 17:23:20,510 INFO L78 Accepts]: Start accepts. Automaton has 4108 states and 10730 transitions. Word has length 32 [2019-12-18 17:23:20,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:23:20,510 INFO L462 AbstractCegarLoop]: Abstraction has 4108 states and 10730 transitions. [2019-12-18 17:23:20,511 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:23:20,511 INFO L276 IsEmpty]: Start isEmpty. Operand 4108 states and 10730 transitions. [2019-12-18 17:23:20,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-18 17:23:20,729 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:23:20,729 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] [2019-12-18 17:23:20,729 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:23:20,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:23:20,730 INFO L82 PathProgramCache]: Analyzing trace with hash 1469218903, now seen corresponding path program 1 times [2019-12-18 17:23:20,730 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:23:20,730 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710634123] [2019-12-18 17:23:20,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:23:20,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:23:20,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:23:20,826 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710634123] [2019-12-18 17:23:20,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:23:20,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 17:23:20,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206824218] [2019-12-18 17:23:20,827 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:23:20,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:23:20,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:23:20,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:23:20,829 INFO L87 Difference]: Start difference. First operand 4108 states and 10730 transitions. Second operand 6 states. [2019-12-18 17:23:20,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:23:20,914 INFO L93 Difference]: Finished difference Result 3096 states and 8255 transitions. [2019-12-18 17:23:20,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 17:23:20,915 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-12-18 17:23:20,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:23:20,919 INFO L225 Difference]: With dead ends: 3096 [2019-12-18 17:23:20,919 INFO L226 Difference]: Without dead ends: 1590 [2019-12-18 17:23:20,920 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:23:20,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1590 states. [2019-12-18 17:23:20,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1590 to 1480. [2019-12-18 17:23:20,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1480 states. [2019-12-18 17:23:20,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1480 states to 1480 states and 3877 transitions. [2019-12-18 17:23:20,954 INFO L78 Accepts]: Start accepts. Automaton has 1480 states and 3877 transitions. Word has length 32 [2019-12-18 17:23:20,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:23:20,955 INFO L462 AbstractCegarLoop]: Abstraction has 1480 states and 3877 transitions. [2019-12-18 17:23:20,955 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:23:20,955 INFO L276 IsEmpty]: Start isEmpty. Operand 1480 states and 3877 transitions. [2019-12-18 17:23:20,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-18 17:23:20,961 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:23:20,962 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] [2019-12-18 17:23:20,962 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:23:20,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:23:20,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1467210822, now seen corresponding path program 1 times [2019-12-18 17:23:20,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:23:20,965 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608170941] [2019-12-18 17:23:20,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:23:20,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:23:21,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:23:21,075 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608170941] [2019-12-18 17:23:21,075 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:23:21,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:23:21,075 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446309546] [2019-12-18 17:23:21,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:23:21,076 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:23:21,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:23:21,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:23:21,076 INFO L87 Difference]: Start difference. First operand 1480 states and 3877 transitions. Second operand 3 states. [2019-12-18 17:23:21,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:23:21,091 INFO L93 Difference]: Finished difference Result 2211 states and 5434 transitions. [2019-12-18 17:23:21,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:23:21,091 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-12-18 17:23:21,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:23:21,093 INFO L225 Difference]: With dead ends: 2211 [2019-12-18 17:23:21,093 INFO L226 Difference]: Without dead ends: 775 [2019-12-18 17:23:21,093 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:23:21,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2019-12-18 17:23:21,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 775. [2019-12-18 17:23:21,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2019-12-18 17:23:21,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 1640 transitions. [2019-12-18 17:23:21,104 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 1640 transitions. Word has length 47 [2019-12-18 17:23:21,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:23:21,104 INFO L462 AbstractCegarLoop]: Abstraction has 775 states and 1640 transitions. [2019-12-18 17:23:21,105 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:23:21,105 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 1640 transitions. [2019-12-18 17:23:21,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-18 17:23:21,107 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:23:21,108 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] [2019-12-18 17:23:21,108 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:23:21,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:23:21,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1384248998, now seen corresponding path program 2 times [2019-12-18 17:23:21,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:23:21,109 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884965790] [2019-12-18 17:23:21,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:23:21,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:23:21,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:23:21,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884965790] [2019-12-18 17:23:21,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:23:21,235 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 17:23:21,236 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919250031] [2019-12-18 17:23:21,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 17:23:21,236 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:23:21,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 17:23:21,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:23:21,237 INFO L87 Difference]: Start difference. First operand 775 states and 1640 transitions. Second operand 7 states. [2019-12-18 17:23:21,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:23:21,504 INFO L93 Difference]: Finished difference Result 1953 states and 4058 transitions. [2019-12-18 17:23:21,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 17:23:21,505 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 47 [2019-12-18 17:23:21,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:23:21,507 INFO L225 Difference]: With dead ends: 1953 [2019-12-18 17:23:21,507 INFO L226 Difference]: Without dead ends: 1317 [2019-12-18 17:23:21,507 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-18 17:23:21,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1317 states. [2019-12-18 17:23:21,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1317 to 878. [2019-12-18 17:23:21,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 878 states. [2019-12-18 17:23:21,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 1848 transitions. [2019-12-18 17:23:21,523 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 1848 transitions. Word has length 47 [2019-12-18 17:23:21,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:23:21,523 INFO L462 AbstractCegarLoop]: Abstraction has 878 states and 1848 transitions. [2019-12-18 17:23:21,523 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 17:23:21,523 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1848 transitions. [2019-12-18 17:23:21,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-18 17:23:21,526 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:23:21,526 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] [2019-12-18 17:23:21,526 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:23:21,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:23:21,526 INFO L82 PathProgramCache]: Analyzing trace with hash -801480632, now seen corresponding path program 3 times [2019-12-18 17:23:21,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:23:21,527 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453179463] [2019-12-18 17:23:21,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:23:21,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:23:21,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:23:21,601 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453179463] [2019-12-18 17:23:21,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:23:21,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:23:21,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040678242] [2019-12-18 17:23:21,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:23:21,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:23:21,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:23:21,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:23:21,603 INFO L87 Difference]: Start difference. First operand 878 states and 1848 transitions. Second operand 4 states. [2019-12-18 17:23:21,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:23:21,629 INFO L93 Difference]: Finished difference Result 1419 states and 2990 transitions. [2019-12-18 17:23:21,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 17:23:21,630 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-12-18 17:23:21,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:23:21,631 INFO L225 Difference]: With dead ends: 1419 [2019-12-18 17:23:21,631 INFO L226 Difference]: Without dead ends: 573 [2019-12-18 17:23:21,631 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:23:21,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2019-12-18 17:23:21,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 573. [2019-12-18 17:23:21,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 573 states. [2019-12-18 17:23:21,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 1194 transitions. [2019-12-18 17:23:21,641 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 1194 transitions. Word has length 47 [2019-12-18 17:23:21,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:23:21,642 INFO L462 AbstractCegarLoop]: Abstraction has 573 states and 1194 transitions. [2019-12-18 17:23:21,642 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:23:21,642 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 1194 transitions. [2019-12-18 17:23:21,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-18 17:23:21,643 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:23:21,643 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] [2019-12-18 17:23:21,644 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:23:21,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:23:21,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1009662868, now seen corresponding path program 4 times [2019-12-18 17:23:21,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:23:21,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208595311] [2019-12-18 17:23:21,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:23:21,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:23:21,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:23:21,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208595311] [2019-12-18 17:23:21,910 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:23:21,910 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 17:23:21,911 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854457541] [2019-12-18 17:23:21,911 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 17:23:21,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:23:21,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 17:23:21,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-18 17:23:21,912 INFO L87 Difference]: Start difference. First operand 573 states and 1194 transitions. Second operand 9 states. [2019-12-18 17:23:22,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:23:22,840 INFO L93 Difference]: Finished difference Result 1057 states and 2020 transitions. [2019-12-18 17:23:22,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 17:23:22,841 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 47 [2019-12-18 17:23:22,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:23:22,842 INFO L225 Difference]: With dead ends: 1057 [2019-12-18 17:23:22,843 INFO L226 Difference]: Without dead ends: 1033 [2019-12-18 17:23:22,843 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2019-12-18 17:23:22,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1033 states. [2019-12-18 17:23:22,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1033 to 612. [2019-12-18 17:23:22,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2019-12-18 17:23:22,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 1191 transitions. [2019-12-18 17:23:22,854 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 1191 transitions. Word has length 47 [2019-12-18 17:23:22,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:23:22,854 INFO L462 AbstractCegarLoop]: Abstraction has 612 states and 1191 transitions. [2019-12-18 17:23:22,854 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 17:23:22,855 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 1191 transitions. [2019-12-18 17:23:22,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-18 17:23:22,857 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:23:22,857 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] [2019-12-18 17:23:22,857 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:23:22,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:23:22,858 INFO L82 PathProgramCache]: Analyzing trace with hash 610940604, now seen corresponding path program 5 times [2019-12-18 17:23:22,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:23:22,858 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092231661] [2019-12-18 17:23:22,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:23:22,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:23:22,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:23:22,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092231661] [2019-12-18 17:23:22,979 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:23:22,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 17:23:22,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143961555] [2019-12-18 17:23:22,980 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 17:23:22,980 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:23:22,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 17:23:22,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:23:22,981 INFO L87 Difference]: Start difference. First operand 612 states and 1191 transitions. Second operand 7 states. [2019-12-18 17:23:23,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:23:23,703 INFO L93 Difference]: Finished difference Result 1089 states and 2100 transitions. [2019-12-18 17:23:23,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 17:23:23,703 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 47 [2019-12-18 17:23:23,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:23:23,705 INFO L225 Difference]: With dead ends: 1089 [2019-12-18 17:23:23,706 INFO L226 Difference]: Without dead ends: 1089 [2019-12-18 17:23:23,706 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2019-12-18 17:23:23,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1089 states. [2019-12-18 17:23:23,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1089 to 642. [2019-12-18 17:23:23,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-12-18 17:23:23,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 1259 transitions. [2019-12-18 17:23:23,719 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 1259 transitions. Word has length 47 [2019-12-18 17:23:23,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:23:23,719 INFO L462 AbstractCegarLoop]: Abstraction has 642 states and 1259 transitions. [2019-12-18 17:23:23,719 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 17:23:23,719 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 1259 transitions. [2019-12-18 17:23:23,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-18 17:23:23,728 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:23:23,728 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] [2019-12-18 17:23:23,728 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:23:23,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:23:23,729 INFO L82 PathProgramCache]: Analyzing trace with hash -1819205216, now seen corresponding path program 6 times [2019-12-18 17:23:23,729 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:23:23,729 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038587964] [2019-12-18 17:23:23,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:23:23,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:23:23,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:23:23,967 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038587964] [2019-12-18 17:23:23,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:23:23,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:23:23,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887548394] [2019-12-18 17:23:23,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:23:23,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:23:23,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:23:23,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:23:23,968 INFO L87 Difference]: Start difference. First operand 642 states and 1259 transitions. Second operand 3 states. [2019-12-18 17:23:23,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:23:23,985 INFO L93 Difference]: Finished difference Result 640 states and 1254 transitions. [2019-12-18 17:23:23,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:23:23,985 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-12-18 17:23:23,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:23:23,986 INFO L225 Difference]: With dead ends: 640 [2019-12-18 17:23:23,986 INFO L226 Difference]: Without dead ends: 640 [2019-12-18 17:23:23,987 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:23:23,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2019-12-18 17:23:23,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 509. [2019-12-18 17:23:23,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 509 states. [2019-12-18 17:23:23,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 1000 transitions. [2019-12-18 17:23:23,997 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 1000 transitions. Word has length 47 [2019-12-18 17:23:23,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:23:23,997 INFO L462 AbstractCegarLoop]: Abstraction has 509 states and 1000 transitions. [2019-12-18 17:23:23,997 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:23:23,997 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 1000 transitions. [2019-12-18 17:23:23,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-18 17:23:23,998 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:23:23,999 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] [2019-12-18 17:23:23,999 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:23:23,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:23:23,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1502542547, now seen corresponding path program 1 times [2019-12-18 17:23:23,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:23:24,000 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320876358] [2019-12-18 17:23:24,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:23:24,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 17:23:24,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 17:23:24,111 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 17:23:24,112 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 17:23:24,119 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] ULTIMATE.startENTRY-->L841: Formula: (let ((.cse0 (store |v_#valid_97| 0 0))) (and (= 0 v_~z$r_buff1_thd1~0_69) (= 0 v_~z$r_buff1_thd2~0_69) (= v_~z$w_buff0~0_326 0) (= 0 v_~z$r_buff1_thd4~0_128) (= v_~z$read_delayed_var~0.offset_6 0) (= |v_#NULL.offset_7| 0) (= 0 v_~__unbuffered_p3_EBX~0_104) (= v_~b~0_46 0) (= v_~weak$$choice2~0_157 0) (= 0 v_~__unbuffered_p2_EAX~0_59) (= 0 v_~z$r_buff0_thd3~0_271) (= v_~z$r_buff0_thd0~0_83 0) (= 0 v_~z$flush_delayed~0_78) (= v_~main$tmp_guard1~0_45 0) (= (store |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1061~0.base_46| (store (select |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1061~0.base_46|) |v_ULTIMATE.start_main_~#t1061~0.offset_30| 0)) |v_#memory_int_25|) (= v_~a~0_68 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1061~0.base_46|)) (= v_~z$r_buff0_thd1~0_26 0) (= v_~main$tmp_guard0~0_23 0) (= 0 v_~weak$$choice0~0_39) (= v_~z$read_delayed_var~0.base_6 0) (= v_~z~0_172 0) (= 0 v_~z$r_buff0_thd4~0_139) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t1061~0.base_46|) (= |v_#length_27| (store |v_#length_28| |v_ULTIMATE.start_main_~#t1061~0.base_46| 4)) (= v_~y~0_82 0) (= |v_#valid_95| (store .cse0 |v_ULTIMATE.start_main_~#t1061~0.base_46| 1)) (= v_~z$read_delayed~0_7 0) (= 0 |v_ULTIMATE.start_main_~#t1061~0.offset_30|) (< 0 |v_#StackHeapBarrier_20|) (= 0 v_~z$r_buff1_thd3~0_242) (= 0 |v_#NULL.base_7|) (= v_~z$mem_tmp~0_49 0) (= v_~z$w_buff1_used~0_372 0) (= v_~z$r_buff1_thd0~0_144 0) (= v_~z$w_buff0_used~0_607 0) (= v_~x~0_74 0) (= v_~__unbuffered_p3_EAX~0_105 0) (= v_~z$w_buff1~0_201 0) (= v_~__unbuffered_cnt~0_157 0) (= v_~z$r_buff0_thd2~0_25 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #valid=|v_#valid_97|, #memory_int=|v_#memory_int_26|, #length=|v_#length_28|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_8|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_8|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_69, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_~#t1063~0.offset=|v_ULTIMATE.start_main_~#t1063~0.offset_29|, ~a~0=v_~a~0_68, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_83, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_139, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_105, #length=|v_#length_27|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_59, ~z$mem_tmp~0=v_~z$mem_tmp~0_49, ULTIMATE.start_main_~#t1062~0.base=|v_ULTIMATE.start_main_~#t1062~0.base_45|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_28|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_372, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_42|, ~z$flush_delayed~0=v_~z$flush_delayed~0_78, ~weak$$choice0~0=v_~weak$$choice0~0_39, #StackHeapBarrier=|v_#StackHeapBarrier_20|, ULTIMATE.start_main_~#t1063~0.base=|v_ULTIMATE.start_main_~#t1063~0.base_45|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_26|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_69, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_271, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_157, ~x~0=v_~x~0_74, ULTIMATE.start_main_~#t1064~0.offset=|v_ULTIMATE.start_main_~#t1064~0.offset_19|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_128, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_9|, ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_22|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_201, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_45, ULTIMATE.start_main_~#t1061~0.base=|v_ULTIMATE.start_main_~#t1061~0.base_46|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_144, ULTIMATE.start_main_~#t1064~0.base=|v_ULTIMATE.start_main_~#t1064~0.base_26|, ~y~0=v_~y~0_82, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_25, ULTIMATE.start_main_~#t1062~0.offset=|v_ULTIMATE.start_main_~#t1062~0.offset_29|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_607, ~z$w_buff0~0=v_~z$w_buff0~0_326, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_242, ULTIMATE.start_main_~#t1061~0.offset=|v_ULTIMATE.start_main_~#t1061~0.offset_30|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_66|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_128|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_23, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_104, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_94|, ~b~0=v_~b~0_46, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_29|, #valid=|v_#valid_95|, #memory_int=|v_#memory_int_25|, ~z~0=v_~z~0_172, ~weak$$choice2~0=v_~weak$$choice2~0_157, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_26} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_~#t1063~0.offset, ~a~0, ~z$r_buff0_thd0~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_~#t1062~0.base, ULTIMATE.start_main_#t~ite39, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_~#t1063~0.base, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t1064~0.offset, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_#t~nondet35, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t1061~0.base, ~z$read_delayed_var~0.offset, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t1064~0.base, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t1062~0.offset, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_~#t1061~0.offset, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ULTIMATE.start_main_#t~ite41, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 17:23:24,120 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L841-1-->L843: Formula: (and (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t1062~0.base_13| 4) |v_#length_17|) (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1062~0.base_13|)) (not (= 0 |v_ULTIMATE.start_main_~#t1062~0.base_13|)) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1062~0.base_13| 1)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1062~0.base_13|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1062~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1062~0.base_13|) |v_ULTIMATE.start_main_~#t1062~0.offset_11| 1)) |v_#memory_int_15|) (= 0 |v_ULTIMATE.start_main_~#t1062~0.offset_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, ULTIMATE.start_main_~#t1062~0.base=|v_ULTIMATE.start_main_~#t1062~0.base_13|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1062~0.offset=|v_ULTIMATE.start_main_~#t1062~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t1062~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1062~0.offset] because there is no mapped edge [2019-12-18 17:23:24,121 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L843-1-->L845: Formula: (and (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1063~0.base_13| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1063~0.base_13|) |v_ULTIMATE.start_main_~#t1063~0.offset_11| 2)) |v_#memory_int_19|) (= 0 (select |v_#valid_51| |v_ULTIMATE.start_main_~#t1063~0.base_13|)) (= 0 |v_ULTIMATE.start_main_~#t1063~0.offset_11|) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1063~0.base_13| 4)) (= |v_#valid_50| (store |v_#valid_51| |v_ULTIMATE.start_main_~#t1063~0.base_13| 1)) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1063~0.base_13|) (not (= |v_ULTIMATE.start_main_~#t1063~0.base_13| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t1063~0.base=|v_ULTIMATE.start_main_~#t1063~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_6|, #valid=|v_#valid_50|, #memory_int=|v_#memory_int_19|, #length=|v_#length_21|, ULTIMATE.start_main_~#t1063~0.offset=|v_ULTIMATE.start_main_~#t1063~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1063~0.base, ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1063~0.offset] because there is no mapped edge [2019-12-18 17:23:24,122 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L845-1-->L847: Formula: (and (= |v_#valid_42| (store |v_#valid_43| |v_ULTIMATE.start_main_~#t1064~0.base_11| 1)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1064~0.base_11|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1064~0.base_11| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1064~0.base_11|) |v_ULTIMATE.start_main_~#t1064~0.offset_10| 3)) |v_#memory_int_17|) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1064~0.base_11| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t1064~0.base_11|)) (= 0 |v_ULTIMATE.start_main_~#t1064~0.offset_10|) (= 0 (select |v_#valid_43| |v_ULTIMATE.start_main_~#t1064~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_5|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t1064~0.base=|v_ULTIMATE.start_main_~#t1064~0.base_11|, #length=|v_#length_19|, ULTIMATE.start_main_~#t1064~0.offset=|v_ULTIMATE.start_main_~#t1064~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, #valid, #memory_int, ULTIMATE.start_main_~#t1064~0.base, #length, ULTIMATE.start_main_~#t1064~0.offset] because there is no mapped edge [2019-12-18 17:23:24,123 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] P3ENTRY-->L4-3: Formula: (and (= |v_P3Thread1of1ForFork1___VERIFIER_assert_#in~expression_10| v_P3Thread1of1ForFork1___VERIFIER_assert_~expression_12) (= v_~z$w_buff0~0_26 v_~z$w_buff1~0_20) (= |v_P3Thread1of1ForFork1___VERIFIER_assert_#in~expression_10| 1) (= 1 v_~z$w_buff0~0_25) (= v_~z$w_buff0_used~0_113 v_~z$w_buff1_used~0_69) (= v_~z$w_buff0_used~0_112 1) (= v_P3Thread1of1ForFork1_~arg.base_10 |v_P3Thread1of1ForFork1_#in~arg.base_10|) (= (mod v_~z$w_buff1_used~0_69 256) 0) (= v_P3Thread1of1ForFork1_~arg.offset_10 |v_P3Thread1of1ForFork1_#in~arg.offset_10|)) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_113, ~z$w_buff0~0=v_~z$w_buff0~0_26, P3Thread1of1ForFork1_#in~arg.offset=|v_P3Thread1of1ForFork1_#in~arg.offset_10|, P3Thread1of1ForFork1_#in~arg.base=|v_P3Thread1of1ForFork1_#in~arg.base_10|} OutVars{P3Thread1of1ForFork1___VERIFIER_assert_~expression=v_P3Thread1of1ForFork1___VERIFIER_assert_~expression_12, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_112, ~z$w_buff0~0=v_~z$w_buff0~0_25, P3Thread1of1ForFork1_#in~arg.offset=|v_P3Thread1of1ForFork1_#in~arg.offset_10|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_69, P3Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P3Thread1of1ForFork1___VERIFIER_assert_#in~expression_10|, ~z$w_buff1~0=v_~z$w_buff1~0_20, P3Thread1of1ForFork1_~arg.offset=v_P3Thread1of1ForFork1_~arg.offset_10, P3Thread1of1ForFork1_#in~arg.base=|v_P3Thread1of1ForFork1_#in~arg.base_10|, P3Thread1of1ForFork1_~arg.base=v_P3Thread1of1ForFork1_~arg.base_10} AuxVars[] AssignedVars[P3Thread1of1ForFork1___VERIFIER_assert_~expression, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, P3Thread1of1ForFork1___VERIFIER_assert_#in~expression, ~z$w_buff1~0, P3Thread1of1ForFork1_~arg.offset, P3Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-18 17:23:24,124 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] P0ENTRY-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#res.offset_5| 0) (= 0 |v_P0Thread1of1ForFork2_#res.base_5|) (= v_~b~0_24 1) (= |v_P0Thread1of1ForFork2_#in~arg.offset_18| v_P0Thread1of1ForFork2_~arg.offset_18) (= v_~x~0_35 1) (= v_~__unbuffered_cnt~0_115 (+ v_~__unbuffered_cnt~0_116 1)) (= v_P0Thread1of1ForFork2_~arg.base_18 |v_P0Thread1of1ForFork2_#in~arg.base_18|)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_18|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_116, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_18|} OutVars{P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_18|, ~b~0=v_~b~0_24, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_18, P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_115, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_18|, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_5|, ~x~0=v_~x~0_35, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_18} AuxVars[] AssignedVars[~b~0, P0Thread1of1ForFork2_~arg.offset, P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base, ~x~0, P0Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-12-18 17:23:24,124 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] P1ENTRY-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork3_#res.base_5|) (= |v_P1Thread1of1ForFork3_#in~arg.base_14| v_P1Thread1of1ForFork3_~arg.base_14) (= 0 |v_P1Thread1of1ForFork3_#res.offset_5|) (= v_~x~0_48 2) (= |v_P1Thread1of1ForFork3_#in~arg.offset_14| v_P1Thread1of1ForFork3_~arg.offset_14) (= v_~__unbuffered_cnt~0_131 (+ v_~__unbuffered_cnt~0_132 1)) (= v_~y~0_47 1)) InVars {P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_14|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_132, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_14|} OutVars{P1Thread1of1ForFork3_#res.base=|v_P1Thread1of1ForFork3_#res.base_5|, P1Thread1of1ForFork3_~arg.offset=v_P1Thread1of1ForFork3_~arg.offset_14, P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_14|, P1Thread1of1ForFork3_~arg.base=v_P1Thread1of1ForFork3_~arg.base_14, P1Thread1of1ForFork3_#res.offset=|v_P1Thread1of1ForFork3_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_131, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_14|, ~y~0=v_~y~0_47, ~x~0=v_~x~0_48} AuxVars[] AssignedVars[P1Thread1of1ForFork3_#res.base, P1Thread1of1ForFork3_~arg.offset, P1Thread1of1ForFork3_~arg.base, P1Thread1of1ForFork3_#res.offset, ~__unbuffered_cnt~0, ~y~0, ~x~0] because there is no mapped edge [2019-12-18 17:23:24,129 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L776-->L776-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-270468560 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite9_Out-270468560| ~z$w_buff0~0_In-270468560) (= |P2Thread1of1ForFork0_#t~ite8_In-270468560| |P2Thread1of1ForFork0_#t~ite8_Out-270468560|)) (and .cse0 (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-270468560 256) 0))) (or (= (mod ~z$w_buff0_used~0_In-270468560 256) 0) (and .cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-270468560 256))) (and .cse1 (= (mod ~z$w_buff1_used~0_In-270468560 256) 0)))) (= ~z$w_buff0~0_In-270468560 |P2Thread1of1ForFork0_#t~ite8_Out-270468560|) (= |P2Thread1of1ForFork0_#t~ite9_Out-270468560| |P2Thread1of1ForFork0_#t~ite8_Out-270468560|)))) InVars {P2Thread1of1ForFork0_#t~ite8=|P2Thread1of1ForFork0_#t~ite8_In-270468560|, ~z$w_buff0~0=~z$w_buff0~0_In-270468560, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-270468560, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-270468560, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-270468560, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-270468560, ~weak$$choice2~0=~weak$$choice2~0_In-270468560} OutVars{P2Thread1of1ForFork0_#t~ite8=|P2Thread1of1ForFork0_#t~ite8_Out-270468560|, ~z$w_buff0~0=~z$w_buff0~0_In-270468560, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-270468560, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-270468560, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-270468560, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-270468560, ~weak$$choice2~0=~weak$$choice2~0_In-270468560, P2Thread1of1ForFork0_#t~ite9=|P2Thread1of1ForFork0_#t~ite9_Out-270468560|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite8, P2Thread1of1ForFork0_#t~ite9] because there is no mapped edge [2019-12-18 17:23:24,131 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L777-->L777-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-505175775 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite12_Out-505175775| ~z$w_buff1~0_In-505175775) (= |P2Thread1of1ForFork0_#t~ite11_In-505175775| |P2Thread1of1ForFork0_#t~ite11_Out-505175775|)) (and (= ~z$w_buff1~0_In-505175775 |P2Thread1of1ForFork0_#t~ite11_Out-505175775|) (= |P2Thread1of1ForFork0_#t~ite12_Out-505175775| |P2Thread1of1ForFork0_#t~ite11_Out-505175775|) (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-505175775 256) 0))) (or (and (= 0 (mod ~z$r_buff1_thd3~0_In-505175775 256)) .cse1) (and (= (mod ~z$w_buff1_used~0_In-505175775 256) 0) .cse1) (= (mod ~z$w_buff0_used~0_In-505175775 256) 0))) .cse0))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-505175775, P2Thread1of1ForFork0_#t~ite11=|P2Thread1of1ForFork0_#t~ite11_In-505175775|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-505175775, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-505175775, ~z$w_buff1~0=~z$w_buff1~0_In-505175775, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-505175775, ~weak$$choice2~0=~weak$$choice2~0_In-505175775} OutVars{P2Thread1of1ForFork0_#t~ite11=|P2Thread1of1ForFork0_#t~ite11_Out-505175775|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-505175775, P2Thread1of1ForFork0_#t~ite12=|P2Thread1of1ForFork0_#t~ite12_Out-505175775|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-505175775, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-505175775, ~z$w_buff1~0=~z$w_buff1~0_In-505175775, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-505175775, ~weak$$choice2~0=~weak$$choice2~0_In-505175775} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite11, P2Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-18 17:23:24,132 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L778-->L778-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1481780790 256) 0))) (or (and .cse0 (= |P2Thread1of1ForFork0_#t~ite15_Out-1481780790| |P2Thread1of1ForFork0_#t~ite14_Out-1481780790|) (= ~z$w_buff0_used~0_In-1481780790 |P2Thread1of1ForFork0_#t~ite14_Out-1481780790|) (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-1481780790 256) 0))) (or (and (= 0 (mod ~z$r_buff1_thd3~0_In-1481780790 256)) .cse1) (= 0 (mod ~z$w_buff0_used~0_In-1481780790 256)) (and (= 0 (mod ~z$w_buff1_used~0_In-1481780790 256)) .cse1)))) (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite15_Out-1481780790| ~z$w_buff0_used~0_In-1481780790) (= |P2Thread1of1ForFork0_#t~ite14_In-1481780790| |P2Thread1of1ForFork0_#t~ite14_Out-1481780790|)))) InVars {P2Thread1of1ForFork0_#t~ite14=|P2Thread1of1ForFork0_#t~ite14_In-1481780790|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1481780790, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1481780790, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1481780790, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1481780790, ~weak$$choice2~0=~weak$$choice2~0_In-1481780790} OutVars{P2Thread1of1ForFork0_#t~ite14=|P2Thread1of1ForFork0_#t~ite14_Out-1481780790|, P2Thread1of1ForFork0_#t~ite15=|P2Thread1of1ForFork0_#t~ite15_Out-1481780790|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1481780790, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1481780790, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1481780790, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1481780790, ~weak$$choice2~0=~weak$$choice2~0_In-1481780790} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14, P2Thread1of1ForFork0_#t~ite15] because there is no mapped edge [2019-12-18 17:23:24,136 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [667] [667] L780-->L781: Formula: (and (not (= (mod v_~weak$$choice2~0_32 256) 0)) (= v_~z$r_buff0_thd3~0_73 v_~z$r_buff0_thd3~0_72)) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_73, ~weak$$choice2~0=v_~weak$$choice2~0_32} OutVars{P2Thread1of1ForFork0_#t~ite21=|v_P2Thread1of1ForFork0_#t~ite21_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_72, P2Thread1of1ForFork0_#t~ite20=|v_P2Thread1of1ForFork0_#t~ite20_11|, ~weak$$choice2~0=v_~weak$$choice2~0_32, P2Thread1of1ForFork0_#t~ite19=|v_P2Thread1of1ForFork0_#t~ite19_8|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite20, P2Thread1of1ForFork0_#t~ite19] because there is no mapped edge [2019-12-18 17:23:24,139 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L819-->L819-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1584682997 256))) (.cse0 (= (mod ~z$r_buff0_thd4~0_In-1584682997 256) 0))) (or (and (= |P3Thread1of1ForFork1_#t~ite28_Out-1584682997| ~z$w_buff0_used~0_In-1584682997) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P3Thread1of1ForFork1_#t~ite28_Out-1584682997| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1584682997, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1584682997} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1584682997, P3Thread1of1ForFork1_#t~ite28=|P3Thread1of1ForFork1_#t~ite28_Out-1584682997|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1584682997} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-18 17:23:24,139 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L783-->L791: Formula: (and (= 0 v_~z$flush_delayed~0_6) (= v_~z~0_16 v_~z$mem_tmp~0_4) (not (= 0 (mod v_~z$flush_delayed~0_7 256))) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_4, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~z$flush_delayed~0=v_~z$flush_delayed~0_7} OutVars{P2Thread1of1ForFork0_#t~ite25=|v_P2Thread1of1ForFork0_#t~ite25_7|, ~z$mem_tmp~0=v_~z$mem_tmp~0_4, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~z$flush_delayed~0=v_~z$flush_delayed~0_6, ~z~0=v_~z~0_16} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite25, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-18 17:23:24,140 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L820-->L820-2: Formula: (let ((.cse2 (= (mod ~z$w_buff0_used~0_In-760205016 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd4~0_In-760205016 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-760205016 256))) (.cse0 (= (mod ~z$r_buff1_thd4~0_In-760205016 256) 0))) (or (and (= |P3Thread1of1ForFork1_#t~ite29_Out-760205016| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P3Thread1of1ForFork1_#t~ite29_Out-760205016| ~z$w_buff1_used~0_In-760205016) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-760205016, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-760205016, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-760205016, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-760205016} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-760205016, P3Thread1of1ForFork1_#t~ite29=|P3Thread1of1ForFork1_#t~ite29_Out-760205016|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-760205016, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-760205016, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-760205016} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-12-18 17:23:24,141 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L821-->L822: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-2117284021 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-2117284021 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd4~0_Out-2117284021 ~z$r_buff0_thd4~0_In-2117284021)) (and (= 0 ~z$r_buff0_thd4~0_Out-2117284021) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2117284021, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-2117284021} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2117284021, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-2117284021, P3Thread1of1ForFork1_#t~ite30=|P3Thread1of1ForFork1_#t~ite30_Out-2117284021|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-18 17:23:24,141 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [694] [694] L822-->L822-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd4~0_In-963925205 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In-963925205 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-963925205 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-963925205 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd4~0_In-963925205 |P3Thread1of1ForFork1_#t~ite31_Out-963925205|)) (and (= 0 |P3Thread1of1ForFork1_#t~ite31_Out-963925205|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-963925205, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-963925205, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-963925205, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-963925205} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-963925205, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-963925205, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-963925205, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-963925205, P3Thread1of1ForFork1_#t~ite31=|P3Thread1of1ForFork1_#t~ite31_Out-963925205|} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-18 17:23:24,141 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L822-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork1_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_107 (+ v_~__unbuffered_cnt~0_108 1)) (= v_~z$r_buff1_thd4~0_56 |v_P3Thread1of1ForFork1_#t~ite31_60|) (= |v_P3Thread1of1ForFork1_#res.base_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_108, P3Thread1of1ForFork1_#t~ite31=|v_P3Thread1of1ForFork1_#t~ite31_60|} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_56, P3Thread1of1ForFork1_#res.base=|v_P3Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107, P3Thread1of1ForFork1_#res.offset=|v_P3Thread1of1ForFork1_#res.offset_5|, P3Thread1of1ForFork1_#t~ite31=|v_P3Thread1of1ForFork1_#t~ite31_59|} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, P3Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork1_#res.offset, P3Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-18 17:23:24,141 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L847-1-->L853: Formula: (and (= v_~main$tmp_guard0~0_9 1) (= 4 v_~__unbuffered_cnt~0_60)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_60} OutVars{ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_60, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet35, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 17:23:24,142 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L853-2-->L853-4: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In-102096705 256))) (.cse0 (= (mod ~z$r_buff1_thd0~0_In-102096705 256) 0))) (or (and (= ~z$w_buff1~0_In-102096705 |ULTIMATE.start_main_#t~ite36_Out-102096705|) (not .cse0) (not .cse1)) (and (= ~z~0_In-102096705 |ULTIMATE.start_main_#t~ite36_Out-102096705|) (or .cse1 .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-102096705, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-102096705, ~z$w_buff1~0=~z$w_buff1~0_In-102096705, ~z~0=~z~0_In-102096705} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-102096705, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-102096705, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-102096705|, ~z$w_buff1~0=~z$w_buff1~0_In-102096705, ~z~0=~z~0_In-102096705} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-18 17:23:24,142 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [650] [650] L853-4-->L854: Formula: (= v_~z~0_38 |v_ULTIMATE.start_main_#t~ite36_16|) InVars {ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_16|} OutVars{ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_15|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_13|, ~z~0=v_~z~0_38} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite37, ~z~0] because there is no mapped edge [2019-12-18 17:23:24,142 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] L854-->L854-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1363277609 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1363277609 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In1363277609 |ULTIMATE.start_main_#t~ite38_Out1363277609|)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite38_Out1363277609|) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1363277609, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1363277609} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1363277609, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1363277609, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out1363277609|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-18 17:23:24,143 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] L855-->L855-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff0_used~0_In1670515168 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In1670515168 256))) (.cse0 (= (mod ~z$r_buff1_thd0~0_In1670515168 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In1670515168 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite39_Out1670515168|)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~z$w_buff1_used~0_In1670515168 |ULTIMATE.start_main_#t~ite39_Out1670515168|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1670515168, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1670515168, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1670515168, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1670515168} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1670515168, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out1670515168|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1670515168, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1670515168, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1670515168} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-18 17:23:24,145 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L856-->L856-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In257542034 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In257542034 256)))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out257542034| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite40_Out257542034| ~z$r_buff0_thd0~0_In257542034) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In257542034, ~z$w_buff0_used~0=~z$w_buff0_used~0_In257542034} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In257542034, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out257542034|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In257542034} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-18 17:23:24,146 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L857-->L857-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In2115237606 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In2115237606 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In2115237606 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In2115237606 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd0~0_In2115237606 |ULTIMATE.start_main_#t~ite41_Out2115237606|)) (and (= |ULTIMATE.start_main_#t~ite41_Out2115237606| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2115237606, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2115237606, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2115237606, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2115237606} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out2115237606|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2115237606, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2115237606, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2115237606, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2115237606} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-18 17:23:24,147 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L857-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 1 v_~__unbuffered_p3_EAX~0_73) (= 0 v_~__unbuffered_p3_EBX~0_72) (= 0 v_~__unbuffered_p2_EAX~0_29) (= v_~z$r_buff1_thd0~0_110 |v_ULTIMATE.start_main_#t~ite41_51|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= v_~x~0_52 2) (= v_~main$tmp_guard1~0_23 0) (= v_~y~0_52 2)) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_51|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_73, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_29, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_72, ~y~0=v_~y~0_52, ~x~0=v_~x~0_52} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_50|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_110, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_73, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_29, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_72, ~y~0=v_~y~0_52, ~x~0=v_~x~0_52, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 17:23:24,292 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 05:23:24 BasicIcfg [2019-12-18 17:23:24,292 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 17:23:24,296 INFO L168 Benchmark]: Toolchain (without parser) took 21094.69 ms. Allocated memory was 144.7 MB in the beginning and 1.1 GB in the end (delta: 939.5 MB). Free memory was 100.2 MB in the beginning and 692.2 MB in the end (delta: -591.9 MB). Peak memory consumption was 347.6 MB. Max. memory is 7.1 GB. [2019-12-18 17:23:24,297 INFO L168 Benchmark]: CDTParser took 0.49 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-18 17:23:24,298 INFO L168 Benchmark]: CACSL2BoogieTranslator took 747.20 ms. Allocated memory was 144.7 MB in the beginning and 202.4 MB in the end (delta: 57.7 MB). Free memory was 100.0 MB in the beginning and 155.9 MB in the end (delta: -55.9 MB). Peak memory consumption was 22.4 MB. Max. memory is 7.1 GB. [2019-12-18 17:23:24,298 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.32 ms. Allocated memory is still 202.4 MB. Free memory was 155.9 MB in the beginning and 153.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 17:23:24,299 INFO L168 Benchmark]: Boogie Preprocessor took 47.65 ms. Allocated memory is still 202.4 MB. Free memory was 153.2 MB in the beginning and 151.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 17:23:24,300 INFO L168 Benchmark]: RCFGBuilder took 807.11 ms. Allocated memory is still 202.4 MB. Free memory was 151.2 MB in the beginning and 105.3 MB in the end (delta: 45.9 MB). Peak memory consumption was 45.9 MB. Max. memory is 7.1 GB. [2019-12-18 17:23:24,301 INFO L168 Benchmark]: TraceAbstraction took 19415.30 ms. Allocated memory was 202.4 MB in the beginning and 1.1 GB in the end (delta: 881.9 MB). Free memory was 104.6 MB in the beginning and 692.2 MB in the end (delta: -587.5 MB). Peak memory consumption was 294.3 MB. Max. memory is 7.1 GB. [2019-12-18 17:23:24,304 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.49 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 747.20 ms. Allocated memory was 144.7 MB in the beginning and 202.4 MB in the end (delta: 57.7 MB). Free memory was 100.0 MB in the beginning and 155.9 MB in the end (delta: -55.9 MB). Peak memory consumption was 22.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 65.32 ms. Allocated memory is still 202.4 MB. Free memory was 155.9 MB in the beginning and 153.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 47.65 ms. Allocated memory is still 202.4 MB. Free memory was 153.2 MB in the beginning and 151.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 807.11 ms. Allocated memory is still 202.4 MB. Free memory was 151.2 MB in the beginning and 105.3 MB in the end (delta: 45.9 MB). Peak memory consumption was 45.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 19415.30 ms. Allocated memory was 202.4 MB in the beginning and 1.1 GB in the end (delta: 881.9 MB). Free memory was 104.6 MB in the beginning and 692.2 MB in the end (delta: -587.5 MB). Peak memory consumption was 294.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.6s, 169 ProgramPointsBefore, 79 ProgramPointsAfterwards, 191 TransitionsBefore, 83 TransitionsAfterwards, 12650 CoEnabledTransitionPairs, 8 FixpointIterations, 37 TrivialSequentialCompositions, 54 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 27 ConcurrentYvCompositions, 23 ChoiceCompositions, 5572 VarBasedMoverChecksPositive, 186 VarBasedMoverChecksNegative, 60 SemBasedMoverChecksPositive, 165 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.3s, 0 MoverChecksTotal, 46301 CheckedPairsTotal, 118 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L841] FCALL, FORK 0 pthread_create(&t1061, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L843] FCALL, FORK 0 pthread_create(&t1062, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L845] FCALL, FORK 0 pthread_create(&t1063, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L847] FCALL, FORK 0 pthread_create(&t1064, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L801] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L802] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L803] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L804] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L805] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L806] 4 z$r_buff0_thd4 = (_Bool)1 [L809] 4 a = 1 [L812] 4 __unbuffered_p3_EAX = a [L815] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L818] 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 [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 3 y = 2 [L771] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L772] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L773] 3 z$flush_delayed = weak$$choice2 [L774] 3 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __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=9, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=1, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __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=9, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=1, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L776] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L777] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L778] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L779] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __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=9, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=2, z=0, z$flush_delayed=1, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L779] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L781] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __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=9, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=2, z=0, z$flush_delayed=1, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L781] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L782] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __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=9, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=1, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L818] 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) [L819] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L820] 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 [L853] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __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=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=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L854] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L855] 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 [L856] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 157 locations, 2 error locations. Result: UNSAFE, OverallTime: 19.0s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1764 SDtfs, 1853 SDslu, 3189 SDs, 0 SdLazy, 1482 SolverSat, 108 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 89 GetRequests, 24 SyntacticMatches, 5 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27254occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 3846 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 533 NumberOfCodeBlocks, 533 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 470 ConstructedInterpolants, 0 QuantifiedInterpolants, 57501 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...