/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix024_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 20:47:43,746 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 20:47:43,749 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 20:47:43,761 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 20:47:43,762 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 20:47:43,763 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 20:47:43,765 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 20:47:43,766 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 20:47:43,768 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 20:47:43,771 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 20:47:43,772 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 20:47:43,776 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 20:47:43,776 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 20:47:43,779 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 20:47:43,780 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 20:47:43,781 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 20:47:43,783 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 20:47:43,787 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 20:47:43,788 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 20:47:43,793 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 20:47:43,795 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 20:47:43,799 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 20:47:43,801 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 20:47:43,801 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 20:47:43,805 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 20:47:43,805 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 20:47:43,805 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 20:47:43,807 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 20:47:43,809 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 20:47:43,810 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 20:47:43,810 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 20:47:43,810 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 20:47:43,815 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 20:47:43,816 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 20:47:43,817 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 20:47:43,817 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 20:47:43,820 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 20:47:43,820 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 20:47:43,821 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 20:47:43,822 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 20:47:43,822 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 20:47:43,826 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 20:47:43,846 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 20:47:43,846 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 20:47:43,848 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 20:47:43,849 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 20:47:43,849 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 20:47:43,849 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 20:47:43,849 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 20:47:43,850 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 20:47:43,850 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 20:47:43,850 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 20:47:43,851 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 20:47:43,851 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 20:47:43,852 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 20:47:43,852 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 20:47:43,852 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 20:47:43,852 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 20:47:43,853 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 20:47:43,853 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 20:47:43,853 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 20:47:43,853 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 20:47:43,854 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 20:47:43,854 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 20:47:43,854 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 20:47:43,854 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 20:47:43,855 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 20:47:43,855 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 20:47:43,855 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 20:47:43,855 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 20:47:43,855 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 20:47:43,856 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 20:47:44,146 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 20:47:44,163 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 20:47:44,166 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 20:47:44,167 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 20:47:44,167 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 20:47:44,168 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix024_rmo.opt.i [2019-12-18 20:47:44,223 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/607a0d8ba/796839b79ffd4e98a051b8b8e5485704/FLAG3a09b1161 [2019-12-18 20:47:44,793 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 20:47:44,794 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix024_rmo.opt.i [2019-12-18 20:47:44,809 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/607a0d8ba/796839b79ffd4e98a051b8b8e5485704/FLAG3a09b1161 [2019-12-18 20:47:45,049 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/607a0d8ba/796839b79ffd4e98a051b8b8e5485704 [2019-12-18 20:47:45,059 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 20:47:45,061 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 20:47:45,062 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 20:47:45,062 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 20:47:45,066 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 20:47:45,067 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 08:47:45" (1/1) ... [2019-12-18 20:47:45,070 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@160dde8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:47:45, skipping insertion in model container [2019-12-18 20:47:45,070 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 08:47:45" (1/1) ... [2019-12-18 20:47:45,078 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 20:47:45,136 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 20:47:45,681 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 20:47:45,698 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 20:47:45,759 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 20:47:45,838 INFO L208 MainTranslator]: Completed translation [2019-12-18 20:47:45,839 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:47:45 WrapperNode [2019-12-18 20:47:45,839 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 20:47:45,840 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 20:47:45,840 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 20:47:45,840 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 20:47:45,849 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:47:45" (1/1) ... [2019-12-18 20:47:45,871 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:47:45" (1/1) ... [2019-12-18 20:47:45,901 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 20:47:45,902 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 20:47:45,902 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 20:47:45,902 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 20:47:45,912 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:47:45" (1/1) ... [2019-12-18 20:47:45,913 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:47:45" (1/1) ... [2019-12-18 20:47:45,924 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:47:45" (1/1) ... [2019-12-18 20:47:45,925 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:47:45" (1/1) ... [2019-12-18 20:47:45,953 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:47:45" (1/1) ... [2019-12-18 20:47:45,958 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:47:45" (1/1) ... [2019-12-18 20:47:45,961 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:47:45" (1/1) ... [2019-12-18 20:47:45,966 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 20:47:45,967 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 20:47:45,967 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 20:47:45,967 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 20:47:45,969 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:47:45" (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 20:47:46,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 20:47:46,028 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 20:47:46,028 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 20:47:46,029 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 20:47:46,029 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 20:47:46,029 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 20:47:46,029 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 20:47:46,029 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 20:47:46,029 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 20:47:46,030 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 20:47:46,030 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 20:47:46,030 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 20:47:46,030 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 20:47:46,032 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 20:47:46,844 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 20:47:46,845 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 20:47:46,846 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 08:47:46 BoogieIcfgContainer [2019-12-18 20:47:46,846 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 20:47:46,848 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 20:47:46,848 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 20:47:46,851 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 20:47:46,852 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 08:47:45" (1/3) ... [2019-12-18 20:47:46,853 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cc7465a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 08:47:46, skipping insertion in model container [2019-12-18 20:47:46,853 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:47:45" (2/3) ... [2019-12-18 20:47:46,854 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cc7465a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 08:47:46, skipping insertion in model container [2019-12-18 20:47:46,854 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 08:47:46" (3/3) ... [2019-12-18 20:47:46,856 INFO L109 eAbstractionObserver]: Analyzing ICFG mix024_rmo.opt.i [2019-12-18 20:47:46,866 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 20:47:46,867 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 20:47:46,875 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 20:47:46,876 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 20:47:46,921 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,921 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,921 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,922 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,922 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,922 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,922 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,923 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,924 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,925 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,925 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,925 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,925 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,926 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,926 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,926 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,927 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,927 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,927 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,927 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,927 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,928 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,928 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,928 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,929 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,929 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,929 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,929 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,930 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,930 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,930 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,930 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,931 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,931 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,931 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,931 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,932 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,932 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,932 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,932 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,938 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,938 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,938 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,938 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,947 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,947 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,947 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,948 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,948 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,955 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,955 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,955 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,956 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,975 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,977 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,977 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,977 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,978 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,978 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,978 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,978 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,978 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,979 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,979 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,979 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,979 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,979 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,980 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,980 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,980 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,983 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,984 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,984 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,984 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,984 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,985 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,985 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,985 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,985 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,985 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,985 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,986 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,986 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,986 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,986 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,986 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,987 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,987 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,987 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,987 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,987 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,988 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,988 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,988 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,988 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,988 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,989 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,991 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,992 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,993 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,997 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,997 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:46,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:47:47,013 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 20:47:47,030 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 20:47:47,030 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 20:47:47,030 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 20:47:47,030 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 20:47:47,030 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 20:47:47,030 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 20:47:47,031 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 20:47:47,031 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 20:47:47,049 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 166 places, 197 transitions [2019-12-18 20:47:47,052 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 166 places, 197 transitions [2019-12-18 20:47:47,134 INFO L126 PetriNetUnfolder]: 41/194 cut-off events. [2019-12-18 20:47:47,134 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 20:47:47,155 INFO L76 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 194 events. 41/194 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 446 event pairs. 9/160 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 20:47:47,187 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 166 places, 197 transitions [2019-12-18 20:47:47,231 INFO L126 PetriNetUnfolder]: 41/194 cut-off events. [2019-12-18 20:47:47,232 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 20:47:47,241 INFO L76 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 194 events. 41/194 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 446 event pairs. 9/160 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 20:47:47,265 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-18 20:47:47,266 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 20:47:50,913 WARN L192 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-18 20:47:51,070 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-18 20:47:51,096 INFO L206 etLargeBlockEncoding]: Checked pairs total: 75401 [2019-12-18 20:47:51,097 INFO L214 etLargeBlockEncoding]: Total number of compositions: 111 [2019-12-18 20:47:51,101 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 90 transitions [2019-12-18 20:48:01,107 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 82802 states. [2019-12-18 20:48:01,108 INFO L276 IsEmpty]: Start isEmpty. Operand 82802 states. [2019-12-18 20:48:01,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 20:48:01,114 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:48:01,115 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 20:48:01,116 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:48:01,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:48:01,122 INFO L82 PathProgramCache]: Analyzing trace with hash 802091485, now seen corresponding path program 1 times [2019-12-18 20:48:01,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:48:01,129 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458138519] [2019-12-18 20:48:01,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:48:01,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:48:01,426 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 20:48:01,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458138519] [2019-12-18 20:48:01,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:48:01,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 20:48:01,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724305111] [2019-12-18 20:48:01,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:48:01,435 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:48:01,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:48:01,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:48:01,458 INFO L87 Difference]: Start difference. First operand 82802 states. Second operand 3 states. [2019-12-18 20:48:04,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:48:04,289 INFO L93 Difference]: Finished difference Result 81762 states and 350164 transitions. [2019-12-18 20:48:04,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:48:04,291 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 20:48:04,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:48:04,840 INFO L225 Difference]: With dead ends: 81762 [2019-12-18 20:48:04,840 INFO L226 Difference]: Without dead ends: 77082 [2019-12-18 20:48:04,841 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 20:48:09,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77082 states. [2019-12-18 20:48:11,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77082 to 77082. [2019-12-18 20:48:11,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77082 states. [2019-12-18 20:48:11,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77082 states to 77082 states and 329650 transitions. [2019-12-18 20:48:11,990 INFO L78 Accepts]: Start accepts. Automaton has 77082 states and 329650 transitions. Word has length 5 [2019-12-18 20:48:11,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:48:11,990 INFO L462 AbstractCegarLoop]: Abstraction has 77082 states and 329650 transitions. [2019-12-18 20:48:11,990 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:48:11,990 INFO L276 IsEmpty]: Start isEmpty. Operand 77082 states and 329650 transitions. [2019-12-18 20:48:12,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 20:48:12,001 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:48:12,001 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:48:12,001 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:48:12,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:48:12,002 INFO L82 PathProgramCache]: Analyzing trace with hash 786856193, now seen corresponding path program 1 times [2019-12-18 20:48:12,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:48:12,002 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458334582] [2019-12-18 20:48:12,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:48:12,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:48:12,115 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 20:48:12,116 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458334582] [2019-12-18 20:48:12,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:48:12,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:48:12,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594843933] [2019-12-18 20:48:12,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:48:12,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:48:12,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:48:12,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:48:12,119 INFO L87 Difference]: Start difference. First operand 77082 states and 329650 transitions. Second operand 3 states. [2019-12-18 20:48:12,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:48:12,275 INFO L93 Difference]: Finished difference Result 20478 states and 70372 transitions. [2019-12-18 20:48:12,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:48:12,275 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 20:48:12,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:48:12,344 INFO L225 Difference]: With dead ends: 20478 [2019-12-18 20:48:12,344 INFO L226 Difference]: Without dead ends: 20478 [2019-12-18 20:48:12,345 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 20:48:12,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20478 states. [2019-12-18 20:48:15,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20478 to 20478. [2019-12-18 20:48:15,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20478 states. [2019-12-18 20:48:15,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20478 states to 20478 states and 70372 transitions. [2019-12-18 20:48:15,687 INFO L78 Accepts]: Start accepts. Automaton has 20478 states and 70372 transitions. Word has length 13 [2019-12-18 20:48:15,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:48:15,688 INFO L462 AbstractCegarLoop]: Abstraction has 20478 states and 70372 transitions. [2019-12-18 20:48:15,688 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:48:15,688 INFO L276 IsEmpty]: Start isEmpty. Operand 20478 states and 70372 transitions. [2019-12-18 20:48:15,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 20:48:15,690 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:48:15,690 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:48:15,690 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:48:15,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:48:15,691 INFO L82 PathProgramCache]: Analyzing trace with hash 721716162, now seen corresponding path program 1 times [2019-12-18 20:48:15,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:48:15,691 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117931457] [2019-12-18 20:48:15,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:48:15,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:48:15,802 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 20:48:15,802 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117931457] [2019-12-18 20:48:15,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:48:15,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:48:15,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527984602] [2019-12-18 20:48:15,804 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:48:15,804 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:48:15,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:48:15,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:48:15,805 INFO L87 Difference]: Start difference. First operand 20478 states and 70372 transitions. Second operand 4 states. [2019-12-18 20:48:16,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:48:16,202 INFO L93 Difference]: Finished difference Result 30802 states and 102312 transitions. [2019-12-18 20:48:16,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:48:16,202 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 20:48:16,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:48:16,323 INFO L225 Difference]: With dead ends: 30802 [2019-12-18 20:48:16,323 INFO L226 Difference]: Without dead ends: 30788 [2019-12-18 20:48:16,324 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 20:48:16,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30788 states. [2019-12-18 20:48:17,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30788 to 27348. [2019-12-18 20:48:17,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27348 states. [2019-12-18 20:48:17,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27348 states to 27348 states and 91824 transitions. [2019-12-18 20:48:17,143 INFO L78 Accepts]: Start accepts. Automaton has 27348 states and 91824 transitions. Word has length 13 [2019-12-18 20:48:17,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:48:17,143 INFO L462 AbstractCegarLoop]: Abstraction has 27348 states and 91824 transitions. [2019-12-18 20:48:17,143 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:48:17,143 INFO L276 IsEmpty]: Start isEmpty. Operand 27348 states and 91824 transitions. [2019-12-18 20:48:17,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 20:48:17,146 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:48:17,146 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:48:17,147 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:48:17,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:48:17,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1406835797, now seen corresponding path program 1 times [2019-12-18 20:48:17,147 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:48:17,149 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802992018] [2019-12-18 20:48:17,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:48:17,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:48:17,259 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 20:48:17,260 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802992018] [2019-12-18 20:48:17,260 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:48:17,260 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:48:17,260 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063946967] [2019-12-18 20:48:17,261 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:48:17,261 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:48:17,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:48:17,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:48:17,262 INFO L87 Difference]: Start difference. First operand 27348 states and 91824 transitions. Second operand 4 states. [2019-12-18 20:48:17,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:48:17,877 INFO L93 Difference]: Finished difference Result 35523 states and 117963 transitions. [2019-12-18 20:48:17,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:48:17,877 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 20:48:17,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:48:17,949 INFO L225 Difference]: With dead ends: 35523 [2019-12-18 20:48:17,949 INFO L226 Difference]: Without dead ends: 35512 [2019-12-18 20:48:17,949 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 20:48:18,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35512 states. [2019-12-18 20:48:18,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35512 to 30900. [2019-12-18 20:48:18,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30900 states. [2019-12-18 20:48:18,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30900 states to 30900 states and 103384 transitions. [2019-12-18 20:48:18,893 INFO L78 Accepts]: Start accepts. Automaton has 30900 states and 103384 transitions. Word has length 14 [2019-12-18 20:48:18,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:48:18,894 INFO L462 AbstractCegarLoop]: Abstraction has 30900 states and 103384 transitions. [2019-12-18 20:48:18,894 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:48:18,894 INFO L276 IsEmpty]: Start isEmpty. Operand 30900 states and 103384 transitions. [2019-12-18 20:48:18,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 20:48:18,896 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:48:18,896 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:48:18,896 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:48:18,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:48:18,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1406985682, now seen corresponding path program 1 times [2019-12-18 20:48:18,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:48:18,897 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167161797] [2019-12-18 20:48:18,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:48:18,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:48:18,946 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 20:48:18,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167161797] [2019-12-18 20:48:18,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:48:18,947 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:48:18,947 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611484679] [2019-12-18 20:48:18,947 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:48:18,948 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:48:18,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:48:18,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:48:18,948 INFO L87 Difference]: Start difference. First operand 30900 states and 103384 transitions. Second operand 4 states. [2019-12-18 20:48:19,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:48:19,321 INFO L93 Difference]: Finished difference Result 38443 states and 127475 transitions. [2019-12-18 20:48:19,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:48:19,322 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 20:48:19,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:48:19,411 INFO L225 Difference]: With dead ends: 38443 [2019-12-18 20:48:19,412 INFO L226 Difference]: Without dead ends: 38432 [2019-12-18 20:48:19,412 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 20:48:19,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38432 states. [2019-12-18 20:48:20,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38432 to 30923. [2019-12-18 20:48:20,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30923 states. [2019-12-18 20:48:20,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30923 states to 30923 states and 103333 transitions. [2019-12-18 20:48:20,399 INFO L78 Accepts]: Start accepts. Automaton has 30923 states and 103333 transitions. Word has length 14 [2019-12-18 20:48:20,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:48:20,399 INFO L462 AbstractCegarLoop]: Abstraction has 30923 states and 103333 transitions. [2019-12-18 20:48:20,399 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:48:20,399 INFO L276 IsEmpty]: Start isEmpty. Operand 30923 states and 103333 transitions. [2019-12-18 20:48:20,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 20:48:20,409 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:48:20,409 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] [2019-12-18 20:48:20,410 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:48:20,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:48:20,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1124752400, now seen corresponding path program 1 times [2019-12-18 20:48:20,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:48:20,411 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245201687] [2019-12-18 20:48:20,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:48:20,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:48:20,495 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 20:48:20,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245201687] [2019-12-18 20:48:20,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:48:20,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:48:20,497 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097786319] [2019-12-18 20:48:20,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:48:20,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:48:20,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:48:20,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:48:20,499 INFO L87 Difference]: Start difference. First operand 30923 states and 103333 transitions. Second operand 5 states. [2019-12-18 20:48:21,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:48:21,053 INFO L93 Difference]: Finished difference Result 45281 states and 149378 transitions. [2019-12-18 20:48:21,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 20:48:21,053 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 20:48:21,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:48:21,128 INFO L225 Difference]: With dead ends: 45281 [2019-12-18 20:48:21,128 INFO L226 Difference]: Without dead ends: 45258 [2019-12-18 20:48:21,129 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 20:48:21,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45258 states. [2019-12-18 20:48:21,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45258 to 32469. [2019-12-18 20:48:21,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32469 states. [2019-12-18 20:48:22,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32469 states to 32469 states and 108463 transitions. [2019-12-18 20:48:22,372 INFO L78 Accepts]: Start accepts. Automaton has 32469 states and 108463 transitions. Word has length 22 [2019-12-18 20:48:22,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:48:22,373 INFO L462 AbstractCegarLoop]: Abstraction has 32469 states and 108463 transitions. [2019-12-18 20:48:22,373 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:48:22,373 INFO L276 IsEmpty]: Start isEmpty. Operand 32469 states and 108463 transitions. [2019-12-18 20:48:22,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 20:48:22,382 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:48:22,382 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] [2019-12-18 20:48:22,383 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:48:22,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:48:22,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1124902285, now seen corresponding path program 1 times [2019-12-18 20:48:22,385 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:48:22,385 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008841840] [2019-12-18 20:48:22,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:48:22,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:48:22,516 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 20:48:22,516 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008841840] [2019-12-18 20:48:22,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:48:22,517 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:48:22,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130655260] [2019-12-18 20:48:22,517 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:48:22,518 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:48:22,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:48:22,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:48:22,518 INFO L87 Difference]: Start difference. First operand 32469 states and 108463 transitions. Second operand 5 states. [2019-12-18 20:48:23,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:48:23,085 INFO L93 Difference]: Finished difference Result 46044 states and 151821 transitions. [2019-12-18 20:48:23,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 20:48:23,086 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 20:48:23,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:48:23,168 INFO L225 Difference]: With dead ends: 46044 [2019-12-18 20:48:23,168 INFO L226 Difference]: Without dead ends: 46021 [2019-12-18 20:48:23,168 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 20:48:23,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46021 states. [2019-12-18 20:48:23,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46021 to 30490. [2019-12-18 20:48:23,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30490 states. [2019-12-18 20:48:23,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30490 states to 30490 states and 101754 transitions. [2019-12-18 20:48:23,792 INFO L78 Accepts]: Start accepts. Automaton has 30490 states and 101754 transitions. Word has length 22 [2019-12-18 20:48:23,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:48:23,792 INFO L462 AbstractCegarLoop]: Abstraction has 30490 states and 101754 transitions. [2019-12-18 20:48:23,792 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:48:23,793 INFO L276 IsEmpty]: Start isEmpty. Operand 30490 states and 101754 transitions. [2019-12-18 20:48:23,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 20:48:23,804 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:48:23,804 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:48:23,804 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:48:23,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:48:23,805 INFO L82 PathProgramCache]: Analyzing trace with hash 1835763287, now seen corresponding path program 1 times [2019-12-18 20:48:23,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:48:23,805 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112971635] [2019-12-18 20:48:23,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:48:23,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:48:23,847 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 20:48:23,847 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112971635] [2019-12-18 20:48:23,847 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:48:23,847 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:48:23,848 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911119252] [2019-12-18 20:48:23,849 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:48:23,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:48:23,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:48:23,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:48:23,849 INFO L87 Difference]: Start difference. First operand 30490 states and 101754 transitions. Second operand 4 states. [2019-12-18 20:48:23,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:48:23,908 INFO L93 Difference]: Finished difference Result 11657 states and 35881 transitions. [2019-12-18 20:48:23,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 20:48:23,908 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 20:48:23,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:48:23,924 INFO L225 Difference]: With dead ends: 11657 [2019-12-18 20:48:23,924 INFO L226 Difference]: Without dead ends: 11657 [2019-12-18 20:48:23,924 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 20:48:23,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11657 states. [2019-12-18 20:48:24,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11657 to 11489. [2019-12-18 20:48:24,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11489 states. [2019-12-18 20:48:24,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11489 states to 11489 states and 35393 transitions. [2019-12-18 20:48:24,084 INFO L78 Accepts]: Start accepts. Automaton has 11489 states and 35393 transitions. Word has length 25 [2019-12-18 20:48:24,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:48:24,084 INFO L462 AbstractCegarLoop]: Abstraction has 11489 states and 35393 transitions. [2019-12-18 20:48:24,084 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:48:24,084 INFO L276 IsEmpty]: Start isEmpty. Operand 11489 states and 35393 transitions. [2019-12-18 20:48:24,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 20:48:24,099 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:48:24,099 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] [2019-12-18 20:48:24,099 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:48:24,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:48:24,099 INFO L82 PathProgramCache]: Analyzing trace with hash -786800782, now seen corresponding path program 1 times [2019-12-18 20:48:24,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:48:24,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480765725] [2019-12-18 20:48:24,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:48:24,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:48:24,168 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 20:48:24,169 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480765725] [2019-12-18 20:48:24,169 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:48:24,169 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 20:48:24,169 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032530637] [2019-12-18 20:48:24,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:48:24,170 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:48:24,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:48:24,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:48:24,170 INFO L87 Difference]: Start difference. First operand 11489 states and 35393 transitions. Second operand 3 states. [2019-12-18 20:48:24,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:48:24,216 INFO L93 Difference]: Finished difference Result 11488 states and 35391 transitions. [2019-12-18 20:48:24,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:48:24,217 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 20:48:24,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:48:24,237 INFO L225 Difference]: With dead ends: 11488 [2019-12-18 20:48:24,238 INFO L226 Difference]: Without dead ends: 11488 [2019-12-18 20:48:24,238 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 20:48:24,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11488 states. [2019-12-18 20:48:24,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11488 to 11488. [2019-12-18 20:48:24,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11488 states. [2019-12-18 20:48:24,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11488 states to 11488 states and 35391 transitions. [2019-12-18 20:48:24,667 INFO L78 Accepts]: Start accepts. Automaton has 11488 states and 35391 transitions. Word has length 39 [2019-12-18 20:48:24,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:48:24,669 INFO L462 AbstractCegarLoop]: Abstraction has 11488 states and 35391 transitions. [2019-12-18 20:48:24,670 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:48:24,670 INFO L276 IsEmpty]: Start isEmpty. Operand 11488 states and 35391 transitions. [2019-12-18 20:48:24,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 20:48:24,698 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:48:24,698 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:48:24,699 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:48:24,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:48:24,699 INFO L82 PathProgramCache]: Analyzing trace with hash -153890988, now seen corresponding path program 1 times [2019-12-18 20:48:24,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:48:24,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928760544] [2019-12-18 20:48:24,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:48:24,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:48:24,784 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 20:48:24,784 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928760544] [2019-12-18 20:48:24,784 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:48:24,784 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 20:48:24,785 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888822922] [2019-12-18 20:48:24,785 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:48:24,785 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:48:24,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:48:24,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:48:24,786 INFO L87 Difference]: Start difference. First operand 11488 states and 35391 transitions. Second operand 5 states. [2019-12-18 20:48:24,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:48:24,860 INFO L93 Difference]: Finished difference Result 10239 states and 32168 transitions. [2019-12-18 20:48:24,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:48:24,861 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 20:48:24,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:48:24,882 INFO L225 Difference]: With dead ends: 10239 [2019-12-18 20:48:24,882 INFO L226 Difference]: Without dead ends: 10239 [2019-12-18 20:48:24,883 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 20:48:24,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10239 states. [2019-12-18 20:48:25,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10239 to 9735. [2019-12-18 20:48:25,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9735 states. [2019-12-18 20:48:25,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9735 states to 9735 states and 30758 transitions. [2019-12-18 20:48:25,069 INFO L78 Accepts]: Start accepts. Automaton has 9735 states and 30758 transitions. Word has length 40 [2019-12-18 20:48:25,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:48:25,070 INFO L462 AbstractCegarLoop]: Abstraction has 9735 states and 30758 transitions. [2019-12-18 20:48:25,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:48:25,070 INFO L276 IsEmpty]: Start isEmpty. Operand 9735 states and 30758 transitions. [2019-12-18 20:48:25,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 20:48:25,084 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:48:25,084 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:48:25,084 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:48:25,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:48:25,085 INFO L82 PathProgramCache]: Analyzing trace with hash 766293347, now seen corresponding path program 1 times [2019-12-18 20:48:25,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:48:25,085 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930790736] [2019-12-18 20:48:25,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:48:25,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:48:25,142 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 20:48:25,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930790736] [2019-12-18 20:48:25,143 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:48:25,143 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:48:25,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761900111] [2019-12-18 20:48:25,144 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:48:25,144 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:48:25,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:48:25,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:48:25,145 INFO L87 Difference]: Start difference. First operand 9735 states and 30758 transitions. Second operand 3 states. [2019-12-18 20:48:25,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:48:25,224 INFO L93 Difference]: Finished difference Result 12683 states and 39352 transitions. [2019-12-18 20:48:25,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:48:25,225 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-18 20:48:25,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:48:25,252 INFO L225 Difference]: With dead ends: 12683 [2019-12-18 20:48:25,252 INFO L226 Difference]: Without dead ends: 12683 [2019-12-18 20:48:25,253 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 20:48:25,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12683 states. [2019-12-18 20:48:25,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12683 to 10393. [2019-12-18 20:48:25,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10393 states. [2019-12-18 20:48:25,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10393 states to 10393 states and 32688 transitions. [2019-12-18 20:48:25,545 INFO L78 Accepts]: Start accepts. Automaton has 10393 states and 32688 transitions. Word has length 54 [2019-12-18 20:48:25,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:48:25,546 INFO L462 AbstractCegarLoop]: Abstraction has 10393 states and 32688 transitions. [2019-12-18 20:48:25,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:48:25,546 INFO L276 IsEmpty]: Start isEmpty. Operand 10393 states and 32688 transitions. [2019-12-18 20:48:25,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 20:48:25,570 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:48:25,570 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:48:25,570 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:48:25,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:48:25,571 INFO L82 PathProgramCache]: Analyzing trace with hash 2104708736, now seen corresponding path program 1 times [2019-12-18 20:48:25,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:48:25,571 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421909804] [2019-12-18 20:48:25,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:48:25,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:48:25,713 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 20:48:25,714 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421909804] [2019-12-18 20:48:25,714 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:48:25,714 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 20:48:25,714 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398848434] [2019-12-18 20:48:25,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 20:48:25,715 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:48:25,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 20:48:25,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 20:48:25,716 INFO L87 Difference]: Start difference. First operand 10393 states and 32688 transitions. Second operand 7 states. [2019-12-18 20:48:26,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:48:26,131 INFO L93 Difference]: Finished difference Result 26623 states and 83594 transitions. [2019-12-18 20:48:26,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 20:48:26,132 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-18 20:48:26,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:48:26,180 INFO L225 Difference]: With dead ends: 26623 [2019-12-18 20:48:26,181 INFO L226 Difference]: Without dead ends: 20927 [2019-12-18 20:48:26,181 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 20:48:26,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20927 states. [2019-12-18 20:48:26,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20927 to 13189. [2019-12-18 20:48:26,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13189 states. [2019-12-18 20:48:26,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13189 states to 13189 states and 41908 transitions. [2019-12-18 20:48:26,609 INFO L78 Accepts]: Start accepts. Automaton has 13189 states and 41908 transitions. Word has length 54 [2019-12-18 20:48:26,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:48:26,610 INFO L462 AbstractCegarLoop]: Abstraction has 13189 states and 41908 transitions. [2019-12-18 20:48:26,610 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 20:48:26,610 INFO L276 IsEmpty]: Start isEmpty. Operand 13189 states and 41908 transitions. [2019-12-18 20:48:26,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 20:48:26,636 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:48:26,636 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:48:26,637 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:48:26,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:48:26,637 INFO L82 PathProgramCache]: Analyzing trace with hash -1580720394, now seen corresponding path program 2 times [2019-12-18 20:48:26,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:48:26,638 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883208797] [2019-12-18 20:48:26,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:48:26,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:48:26,722 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 20:48:26,723 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883208797] [2019-12-18 20:48:26,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:48:26,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 20:48:26,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638036505] [2019-12-18 20:48:26,723 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 20:48:26,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:48:26,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 20:48:26,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 20:48:26,724 INFO L87 Difference]: Start difference. First operand 13189 states and 41908 transitions. Second operand 7 states. [2019-12-18 20:48:27,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:48:27,258 INFO L93 Difference]: Finished difference Result 34316 states and 106692 transitions. [2019-12-18 20:48:27,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 20:48:27,258 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-18 20:48:27,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:48:27,307 INFO L225 Difference]: With dead ends: 34316 [2019-12-18 20:48:27,307 INFO L226 Difference]: Without dead ends: 25449 [2019-12-18 20:48:27,310 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 20:48:27,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25449 states. [2019-12-18 20:48:27,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25449 to 17200. [2019-12-18 20:48:27,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17200 states. [2019-12-18 20:48:27,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17200 states to 17200 states and 54622 transitions. [2019-12-18 20:48:27,639 INFO L78 Accepts]: Start accepts. Automaton has 17200 states and 54622 transitions. Word has length 54 [2019-12-18 20:48:27,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:48:27,639 INFO L462 AbstractCegarLoop]: Abstraction has 17200 states and 54622 transitions. [2019-12-18 20:48:27,639 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 20:48:27,639 INFO L276 IsEmpty]: Start isEmpty. Operand 17200 states and 54622 transitions. [2019-12-18 20:48:27,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 20:48:27,659 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:48:27,660 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:48:27,660 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:48:27,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:48:27,660 INFO L82 PathProgramCache]: Analyzing trace with hash 714355520, now seen corresponding path program 3 times [2019-12-18 20:48:27,660 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:48:27,660 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423950983] [2019-12-18 20:48:27,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:48:27,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:48:27,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:48:27,798 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423950983] [2019-12-18 20:48:27,798 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:48:27,798 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 20:48:27,798 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721114260] [2019-12-18 20:48:27,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 20:48:27,799 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:48:27,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 20:48:27,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 20:48:27,799 INFO L87 Difference]: Start difference. First operand 17200 states and 54622 transitions. Second operand 9 states. [2019-12-18 20:48:29,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:48:29,493 INFO L93 Difference]: Finished difference Result 89167 states and 277833 transitions. [2019-12-18 20:48:29,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-18 20:48:29,494 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-12-18 20:48:29,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:48:29,626 INFO L225 Difference]: With dead ends: 89167 [2019-12-18 20:48:29,626 INFO L226 Difference]: Without dead ends: 76971 [2019-12-18 20:48:29,627 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 424 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=339, Invalid=1143, Unknown=0, NotChecked=0, Total=1482 [2019-12-18 20:48:29,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76971 states. [2019-12-18 20:48:30,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76971 to 23213. [2019-12-18 20:48:30,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23213 states. [2019-12-18 20:48:30,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23213 states to 23213 states and 74466 transitions. [2019-12-18 20:48:30,712 INFO L78 Accepts]: Start accepts. Automaton has 23213 states and 74466 transitions. Word has length 54 [2019-12-18 20:48:30,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:48:30,712 INFO L462 AbstractCegarLoop]: Abstraction has 23213 states and 74466 transitions. [2019-12-18 20:48:30,712 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 20:48:30,713 INFO L276 IsEmpty]: Start isEmpty. Operand 23213 states and 74466 transitions. [2019-12-18 20:48:30,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 20:48:30,747 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:48:30,748 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:48:30,748 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:48:30,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:48:30,748 INFO L82 PathProgramCache]: Analyzing trace with hash 265762130, now seen corresponding path program 4 times [2019-12-18 20:48:30,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:48:30,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416992421] [2019-12-18 20:48:30,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:48:30,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:48:30,858 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 20:48:30,858 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416992421] [2019-12-18 20:48:30,858 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:48:30,858 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 20:48:30,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127849534] [2019-12-18 20:48:30,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 20:48:30,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:48:30,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 20:48:30,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 20:48:30,860 INFO L87 Difference]: Start difference. First operand 23213 states and 74466 transitions. Second operand 9 states. [2019-12-18 20:48:32,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:48:32,354 INFO L93 Difference]: Finished difference Result 69362 states and 216514 transitions. [2019-12-18 20:48:32,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-18 20:48:32,354 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-12-18 20:48:32,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:48:32,463 INFO L225 Difference]: With dead ends: 69362 [2019-12-18 20:48:32,463 INFO L226 Difference]: Without dead ends: 66294 [2019-12-18 20:48:32,464 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=236, Invalid=820, Unknown=0, NotChecked=0, Total=1056 [2019-12-18 20:48:32,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66294 states. [2019-12-18 20:48:33,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66294 to 22741. [2019-12-18 20:48:33,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22741 states. [2019-12-18 20:48:33,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22741 states to 22741 states and 73038 transitions. [2019-12-18 20:48:33,595 INFO L78 Accepts]: Start accepts. Automaton has 22741 states and 73038 transitions. Word has length 54 [2019-12-18 20:48:33,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:48:33,595 INFO L462 AbstractCegarLoop]: Abstraction has 22741 states and 73038 transitions. [2019-12-18 20:48:33,595 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 20:48:33,595 INFO L276 IsEmpty]: Start isEmpty. Operand 22741 states and 73038 transitions. [2019-12-18 20:48:33,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 20:48:33,630 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:48:33,630 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:48:33,630 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:48:33,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:48:33,630 INFO L82 PathProgramCache]: Analyzing trace with hash -2030886808, now seen corresponding path program 5 times [2019-12-18 20:48:33,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:48:33,631 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618563019] [2019-12-18 20:48:33,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:48:33,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:48:33,808 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 20:48:33,809 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618563019] [2019-12-18 20:48:33,809 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:48:33,809 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 20:48:33,810 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838795265] [2019-12-18 20:48:33,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 20:48:33,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:48:33,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 20:48:33,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-18 20:48:33,811 INFO L87 Difference]: Start difference. First operand 22741 states and 73038 transitions. Second operand 9 states. [2019-12-18 20:48:35,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:48:35,052 INFO L93 Difference]: Finished difference Result 31385 states and 96132 transitions. [2019-12-18 20:48:35,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 20:48:35,053 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-12-18 20:48:35,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:48:35,098 INFO L225 Difference]: With dead ends: 31385 [2019-12-18 20:48:35,098 INFO L226 Difference]: Without dead ends: 31177 [2019-12-18 20:48:35,099 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-12-18 20:48:35,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31177 states. [2019-12-18 20:48:35,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31177 to 25977. [2019-12-18 20:48:35,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25977 states. [2019-12-18 20:48:35,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25977 states to 25977 states and 81151 transitions. [2019-12-18 20:48:35,538 INFO L78 Accepts]: Start accepts. Automaton has 25977 states and 81151 transitions. Word has length 54 [2019-12-18 20:48:35,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:48:35,538 INFO L462 AbstractCegarLoop]: Abstraction has 25977 states and 81151 transitions. [2019-12-18 20:48:35,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 20:48:35,538 INFO L276 IsEmpty]: Start isEmpty. Operand 25977 states and 81151 transitions. [2019-12-18 20:48:35,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 20:48:35,567 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:48:35,567 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:48:35,567 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:48:35,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:48:35,567 INFO L82 PathProgramCache]: Analyzing trace with hash -623567340, now seen corresponding path program 6 times [2019-12-18 20:48:35,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:48:35,568 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003280748] [2019-12-18 20:48:35,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:48:35,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:48:35,720 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 20:48:35,720 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003280748] [2019-12-18 20:48:35,720 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:48:35,721 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 20:48:35,721 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260173391] [2019-12-18 20:48:35,721 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 20:48:35,721 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:48:35,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 20:48:35,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-18 20:48:35,722 INFO L87 Difference]: Start difference. First operand 25977 states and 81151 transitions. Second operand 8 states. [2019-12-18 20:48:36,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:48:36,731 INFO L93 Difference]: Finished difference Result 34673 states and 105778 transitions. [2019-12-18 20:48:36,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 20:48:36,731 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2019-12-18 20:48:36,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:48:36,784 INFO L225 Difference]: With dead ends: 34673 [2019-12-18 20:48:36,784 INFO L226 Difference]: Without dead ends: 34563 [2019-12-18 20:48:36,785 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-12-18 20:48:36,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34563 states. [2019-12-18 20:48:37,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34563 to 27841. [2019-12-18 20:48:37,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27841 states. [2019-12-18 20:48:37,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27841 states to 27841 states and 86503 transitions. [2019-12-18 20:48:37,461 INFO L78 Accepts]: Start accepts. Automaton has 27841 states and 86503 transitions. Word has length 54 [2019-12-18 20:48:37,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:48:37,461 INFO L462 AbstractCegarLoop]: Abstraction has 27841 states and 86503 transitions. [2019-12-18 20:48:37,462 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 20:48:37,462 INFO L276 IsEmpty]: Start isEmpty. Operand 27841 states and 86503 transitions. [2019-12-18 20:48:37,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 20:48:37,493 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:48:37,493 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:48:37,494 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:48:37,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:48:37,494 INFO L82 PathProgramCache]: Analyzing trace with hash -365012868, now seen corresponding path program 7 times [2019-12-18 20:48:37,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:48:37,494 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420006655] [2019-12-18 20:48:37,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:48:37,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:48:37,551 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 20:48:37,551 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420006655] [2019-12-18 20:48:37,551 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:48:37,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:48:37,552 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363508871] [2019-12-18 20:48:37,552 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:48:37,552 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:48:37,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:48:37,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:48:37,553 INFO L87 Difference]: Start difference. First operand 27841 states and 86503 transitions. Second operand 3 states. [2019-12-18 20:48:37,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:48:37,690 INFO L93 Difference]: Finished difference Result 27839 states and 86498 transitions. [2019-12-18 20:48:37,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:48:37,690 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-18 20:48:37,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:48:37,745 INFO L225 Difference]: With dead ends: 27839 [2019-12-18 20:48:37,745 INFO L226 Difference]: Without dead ends: 27839 [2019-12-18 20:48:37,746 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 20:48:37,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27839 states. [2019-12-18 20:48:38,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27839 to 24991. [2019-12-18 20:48:38,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24991 states. [2019-12-18 20:48:38,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24991 states to 24991 states and 78667 transitions. [2019-12-18 20:48:38,271 INFO L78 Accepts]: Start accepts. Automaton has 24991 states and 78667 transitions. Word has length 54 [2019-12-18 20:48:38,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:48:38,271 INFO L462 AbstractCegarLoop]: Abstraction has 24991 states and 78667 transitions. [2019-12-18 20:48:38,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:48:38,271 INFO L276 IsEmpty]: Start isEmpty. Operand 24991 states and 78667 transitions. [2019-12-18 20:48:38,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 20:48:38,297 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:48:38,297 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:48:38,297 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:48:38,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:48:38,297 INFO L82 PathProgramCache]: Analyzing trace with hash -1896131244, now seen corresponding path program 1 times [2019-12-18 20:48:38,298 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:48:38,298 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673238063] [2019-12-18 20:48:38,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:48:38,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:48:38,368 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 20:48:38,368 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673238063] [2019-12-18 20:48:38,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:48:38,369 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:48:38,369 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090745374] [2019-12-18 20:48:38,369 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:48:38,369 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:48:38,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:48:38,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:48:38,371 INFO L87 Difference]: Start difference. First operand 24991 states and 78667 transitions. Second operand 3 states. [2019-12-18 20:48:38,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:48:38,466 INFO L93 Difference]: Finished difference Result 21850 states and 68144 transitions. [2019-12-18 20:48:38,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:48:38,466 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-18 20:48:38,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:48:38,511 INFO L225 Difference]: With dead ends: 21850 [2019-12-18 20:48:38,511 INFO L226 Difference]: Without dead ends: 21850 [2019-12-18 20:48:38,511 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 20:48:38,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21850 states. [2019-12-18 20:48:38,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21850 to 19078. [2019-12-18 20:48:38,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19078 states. [2019-12-18 20:48:38,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19078 states to 19078 states and 59424 transitions. [2019-12-18 20:48:38,815 INFO L78 Accepts]: Start accepts. Automaton has 19078 states and 59424 transitions. Word has length 55 [2019-12-18 20:48:38,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:48:38,815 INFO L462 AbstractCegarLoop]: Abstraction has 19078 states and 59424 transitions. [2019-12-18 20:48:38,815 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:48:38,815 INFO L276 IsEmpty]: Start isEmpty. Operand 19078 states and 59424 transitions. [2019-12-18 20:48:38,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 20:48:38,835 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:48:38,835 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:48:38,835 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:48:38,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:48:38,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1578077188, now seen corresponding path program 1 times [2019-12-18 20:48:38,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:48:38,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854629467] [2019-12-18 20:48:38,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:48:38,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:48:38,934 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 20:48:38,935 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854629467] [2019-12-18 20:48:38,935 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:48:38,935 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 20:48:38,935 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620415988] [2019-12-18 20:48:38,937 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 20:48:38,937 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:48:38,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 20:48:38,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-18 20:48:38,937 INFO L87 Difference]: Start difference. First operand 19078 states and 59424 transitions. Second operand 9 states. [2019-12-18 20:48:40,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:48:40,128 INFO L93 Difference]: Finished difference Result 31379 states and 96904 transitions. [2019-12-18 20:48:40,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 20:48:40,129 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 56 [2019-12-18 20:48:40,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:48:40,167 INFO L225 Difference]: With dead ends: 31379 [2019-12-18 20:48:40,167 INFO L226 Difference]: Without dead ends: 25317 [2019-12-18 20:48:40,167 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2019-12-18 20:48:40,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25317 states. [2019-12-18 20:48:40,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25317 to 19640. [2019-12-18 20:48:40,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19640 states. [2019-12-18 20:48:40,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19640 states to 19640 states and 60827 transitions. [2019-12-18 20:48:40,625 INFO L78 Accepts]: Start accepts. Automaton has 19640 states and 60827 transitions. Word has length 56 [2019-12-18 20:48:40,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:48:40,625 INFO L462 AbstractCegarLoop]: Abstraction has 19640 states and 60827 transitions. [2019-12-18 20:48:40,626 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 20:48:40,626 INFO L276 IsEmpty]: Start isEmpty. Operand 19640 states and 60827 transitions. [2019-12-18 20:48:40,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 20:48:40,645 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:48:40,645 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:48:40,645 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:48:40,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:48:40,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1760958284, now seen corresponding path program 2 times [2019-12-18 20:48:40,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:48:40,646 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787416135] [2019-12-18 20:48:40,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:48:40,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:48:40,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:48:40,798 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787416135] [2019-12-18 20:48:40,798 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:48:40,799 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 20:48:40,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713466388] [2019-12-18 20:48:40,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 20:48:40,799 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:48:40,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 20:48:40,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 20:48:40,800 INFO L87 Difference]: Start difference. First operand 19640 states and 60827 transitions. Second operand 11 states. [2019-12-18 20:48:42,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:48:42,061 INFO L93 Difference]: Finished difference Result 33700 states and 103698 transitions. [2019-12-18 20:48:42,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-18 20:48:42,062 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-12-18 20:48:42,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:48:42,099 INFO L225 Difference]: With dead ends: 33700 [2019-12-18 20:48:42,099 INFO L226 Difference]: Without dead ends: 27441 [2019-12-18 20:48:42,100 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=210, Invalid=912, Unknown=0, NotChecked=0, Total=1122 [2019-12-18 20:48:42,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27441 states. [2019-12-18 20:48:42,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27441 to 18195. [2019-12-18 20:48:42,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18195 states. [2019-12-18 20:48:42,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18195 states to 18195 states and 56038 transitions. [2019-12-18 20:48:42,417 INFO L78 Accepts]: Start accepts. Automaton has 18195 states and 56038 transitions. Word has length 56 [2019-12-18 20:48:42,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:48:42,417 INFO L462 AbstractCegarLoop]: Abstraction has 18195 states and 56038 transitions. [2019-12-18 20:48:42,417 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 20:48:42,417 INFO L276 IsEmpty]: Start isEmpty. Operand 18195 states and 56038 transitions. [2019-12-18 20:48:42,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 20:48:42,435 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:48:42,435 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:48:42,435 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:48:42,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:48:42,436 INFO L82 PathProgramCache]: Analyzing trace with hash -826863496, now seen corresponding path program 3 times [2019-12-18 20:48:42,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:48:42,436 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688217295] [2019-12-18 20:48:42,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:48:42,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 20:48:42,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 20:48:42,534 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 20:48:42,534 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 20:48:42,538 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [815] [815] ULTIMATE.startENTRY-->L831: Formula: (let ((.cse0 (store |v_#valid_59| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= 0 v_~y$r_buff1_thd1~0_41) (= v_~y$r_buff0_thd3~0_18 0) (= 0 v_~weak$$choice0~0_8) (= 0 v_~y$r_buff1_thd3~0_17) (= |v_ULTIMATE.start_main_~#t648~0.offset_13| 0) (= v_~main$tmp_guard1~0_16 0) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t648~0.base_16| 4)) (= 0 v_~y$r_buff1_thd0~0_20) (= v_~y~0_25 0) (= 0 v_~__unbuffered_p0_EAX~0_15) (= v_~y$r_buff0_thd2~0_24 0) (= |v_#NULL.offset_3| 0) (= v_~y$r_buff0_thd1~0_68 0) (= 0 v_~y$w_buff1~0_25) (= 0 v_~y$w_buff0~0_28) (= v_~y$w_buff0_used~0_108 0) (= 0 v_~y$flush_delayed~0_14) (= 0 v_~x~0_9) (= 0 v_~weak$$choice2~0_34) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t648~0.base_16|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t648~0.base_16| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t648~0.base_16|) |v_ULTIMATE.start_main_~#t648~0.offset_13| 0)) |v_#memory_int_17|) (= v_~y$read_delayed~0_6 0) (= v_~z~0_15 0) (= v_~y$mem_tmp~0_11 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~y$r_buff0_thd0~0_20 0) (= v_~a~0_10 0) (= 0 v_~__unbuffered_p2_EAX~0_15) (= v_~__unbuffered_p2_EBX~0_15 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t648~0.base_16|)) (= |v_#valid_57| (store .cse0 |v_ULTIMATE.start_main_~#t648~0.base_16| 1)) (= 0 v_~y$r_buff1_thd2~0_17) (= 0 |v_#NULL.base_3|) (= 0 v_~__unbuffered_cnt~0_22) (= v_~y$w_buff1_used~0_69 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~main$tmp_guard0~0_11 0) (= v_~__unbuffered_p0_EBX~0_14 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t648~0.offset=|v_ULTIMATE.start_main_~#t648~0.offset_13|, ULTIMATE.start_main_~#t650~0.base=|v_ULTIMATE.start_main_~#t650~0.base_19|, #NULL.offset=|v_#NULL.offset_3|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_9|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_9|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~a~0=v_~a~0_10, ~y$mem_tmp~0=v_~y$mem_tmp~0_11, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_15, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_17, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_68, ~y$flush_delayed~0=v_~y$flush_delayed~0_14, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_15, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_15, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_14, ULTIMATE.start_main_~#t650~0.offset=|v_ULTIMATE.start_main_~#t650~0.offset_15|, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ~y$w_buff1~0=v_~y$w_buff1~0_25, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_24, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_20, ~x~0=v_~x~0_9, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_108, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_19|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_11|, ULTIMATE.start_main_~#t648~0.base=|v_ULTIMATE.start_main_~#t648~0.base_16|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_9|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_41, ~y$w_buff0~0=v_~y$w_buff0~0_28, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_18, ULTIMATE.start_main_~#t649~0.offset=|v_ULTIMATE.start_main_~#t649~0.offset_15|, ~y~0=v_~y~0_25, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_7|, ULTIMATE.start_main_~#t649~0.base=|v_ULTIMATE.start_main_~#t649~0.base_19|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11, #NULL.base=|v_#NULL.base_3|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_17, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_11|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_20, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_15, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_69} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t648~0.offset, ULTIMATE.start_main_~#t650~0.base, #NULL.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~a~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_~#t650~0.offset, ~weak$$choice0~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_~#t648~0.base, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ULTIMATE.start_main_~#t649~0.offset, ~y~0, ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t649~0.base, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 20:48:42,539 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L831-1-->L833: Formula: (and (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t649~0.base_11| 1)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t649~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t649~0.base_11|) |v_ULTIMATE.start_main_~#t649~0.offset_10| 1)) |v_#memory_int_13|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t649~0.base_11|) (not (= |v_ULTIMATE.start_main_~#t649~0.base_11| 0)) (= 0 |v_ULTIMATE.start_main_~#t649~0.offset_10|) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t649~0.base_11|)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t649~0.base_11| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t649~0.base=|v_ULTIMATE.start_main_~#t649~0.base_11|, ULTIMATE.start_main_~#t649~0.offset=|v_ULTIMATE.start_main_~#t649~0.offset_10|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t649~0.base, ULTIMATE.start_main_~#t649~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-18 20:48:42,541 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] P1ENTRY-->L5-3: Formula: (and (= (mod ~y$w_buff1_used~0_Out-2124118963 256) 0) (= P1Thread1of1ForFork1___VERIFIER_assert_~expression_Out-2124118963 |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_Out-2124118963|) (= 1 ~y$w_buff0_used~0_Out-2124118963) (= ~y$w_buff1~0_Out-2124118963 ~y$w_buff0~0_In-2124118963) (= P1Thread1of1ForFork1_~arg.base_Out-2124118963 |P1Thread1of1ForFork1_#in~arg.base_In-2124118963|) (= 1 |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_Out-2124118963|) (= P1Thread1of1ForFork1_~arg.offset_Out-2124118963 |P1Thread1of1ForFork1_#in~arg.offset_In-2124118963|) (= ~y$w_buff0~0_Out-2124118963 1) (= ~y$w_buff0_used~0_In-2124118963 ~y$w_buff1_used~0_Out-2124118963)) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2124118963, ~y$w_buff0~0=~y$w_buff0~0_In-2124118963, P1Thread1of1ForFork1_#in~arg.base=|P1Thread1of1ForFork1_#in~arg.base_In-2124118963|, P1Thread1of1ForFork1_#in~arg.offset=|P1Thread1of1ForFork1_#in~arg.offset_In-2124118963|} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_Out-2124118963, P1Thread1of1ForFork1_~arg.offset=P1Thread1of1ForFork1_~arg.offset_Out-2124118963, ~y$w_buff0_used~0=~y$w_buff0_used~0_Out-2124118963, ~y$w_buff1~0=~y$w_buff1~0_Out-2124118963, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_Out-2124118963|, P1Thread1of1ForFork1_~arg.base=P1Thread1of1ForFork1_~arg.base_Out-2124118963, ~y$w_buff0~0=~y$w_buff0~0_Out-2124118963, P1Thread1of1ForFork1_#in~arg.base=|P1Thread1of1ForFork1_#in~arg.base_In-2124118963|, P1Thread1of1ForFork1_#in~arg.offset=|P1Thread1of1ForFork1_#in~arg.offset_In-2124118963|, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out-2124118963} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, P1Thread1of1ForFork1_~arg.offset, ~y$w_buff0_used~0, ~y$w_buff1~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~y$w_buff0~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 20:48:42,544 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L833-1-->L835: Formula: (and (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t650~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t650~0.base_11|) |v_ULTIMATE.start_main_~#t650~0.offset_10| 2)) |v_#memory_int_11|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t650~0.base_11| 4)) (= |v_ULTIMATE.start_main_~#t650~0.offset_10| 0) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t650~0.base_11|)) (not (= |v_ULTIMATE.start_main_~#t650~0.base_11| 0)) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t650~0.base_11| 1)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t650~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t650~0.base=|v_ULTIMATE.start_main_~#t650~0.base_11|, ULTIMATE.start_main_~#t650~0.offset=|v_ULTIMATE.start_main_~#t650~0.offset_10|, #length=|v_#length_15|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_6|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t650~0.base, ULTIMATE.start_main_~#t650~0.offset, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-18 20:48:42,549 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L808-2-->L808-5: Formula: (let ((.cse0 (= |P2Thread1of1ForFork2_#t~ite33_Out-1010236873| |P2Thread1of1ForFork2_#t~ite32_Out-1010236873|)) (.cse1 (= (mod ~y$r_buff1_thd3~0_In-1010236873 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1010236873 256)))) (or (and .cse0 (or .cse1 .cse2) (= |P2Thread1of1ForFork2_#t~ite32_Out-1010236873| ~y~0_In-1010236873)) (and .cse0 (not .cse1) (not .cse2) (= ~y$w_buff1~0_In-1010236873 |P2Thread1of1ForFork2_#t~ite32_Out-1010236873|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1010236873, ~y$w_buff1~0=~y$w_buff1~0_In-1010236873, ~y~0=~y~0_In-1010236873, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1010236873} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1010236873, ~y$w_buff1~0=~y$w_buff1~0_In-1010236873, P2Thread1of1ForFork2_#t~ite33=|P2Thread1of1ForFork2_#t~ite33_Out-1010236873|, P2Thread1of1ForFork2_#t~ite32=|P2Thread1of1ForFork2_#t~ite32_Out-1010236873|, ~y~0=~y~0_In-1010236873, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1010236873} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite33, P2Thread1of1ForFork2_#t~ite32] because there is no mapped edge [2019-12-18 20:48:42,551 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L786-->L786-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1371717220 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1371717220 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite28_Out-1371717220| 0) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite28_Out-1371717220| ~y$w_buff0_used~0_In-1371717220)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1371717220, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1371717220} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1371717220, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1371717220, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out-1371717220|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-18 20:48:42,553 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L809-->L809-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1708641676 256))) (.cse0 (= (mod ~y$r_buff0_thd3~0_In1708641676 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite34_Out1708641676| 0)) (and (= |P2Thread1of1ForFork2_#t~ite34_Out1708641676| ~y$w_buff0_used~0_In1708641676) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1708641676, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1708641676} OutVars{P2Thread1of1ForFork2_#t~ite34=|P2Thread1of1ForFork2_#t~ite34_Out1708641676|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1708641676, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1708641676} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite34] because there is no mapped edge [2019-12-18 20:48:42,555 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L810-->L810-2: Formula: (let ((.cse2 (= (mod ~y$w_buff1_used~0_In4530614 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd3~0_In4530614 256))) (.cse1 (= (mod ~y$r_buff0_thd3~0_In4530614 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In4530614 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite35_Out4530614| 0)) (and (or .cse2 .cse3) (= ~y$w_buff1_used~0_In4530614 |P2Thread1of1ForFork2_#t~ite35_Out4530614|) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In4530614, ~y$w_buff0_used~0=~y$w_buff0_used~0_In4530614, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In4530614, ~y$w_buff1_used~0=~y$w_buff1_used~0_In4530614} OutVars{P2Thread1of1ForFork2_#t~ite35=|P2Thread1of1ForFork2_#t~ite35_Out4530614|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In4530614, ~y$w_buff0_used~0=~y$w_buff0_used~0_In4530614, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In4530614, ~y$w_buff1_used~0=~y$w_buff1_used~0_In4530614} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite35] because there is no mapped edge [2019-12-18 20:48:42,557 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L811-->L811-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1882194470 256))) (.cse1 (= (mod ~y$r_buff0_thd3~0_In-1882194470 256) 0))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite36_Out-1882194470|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd3~0_In-1882194470 |P2Thread1of1ForFork2_#t~ite36_Out-1882194470|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1882194470, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1882194470} OutVars{P2Thread1of1ForFork2_#t~ite36=|P2Thread1of1ForFork2_#t~ite36_Out-1882194470|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1882194470, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1882194470} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite36] because there is no mapped edge [2019-12-18 20:48:42,559 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L812-->L812-2: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd3~0_In-2029995857 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-2029995857 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd3~0_In-2029995857 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In-2029995857 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd3~0_In-2029995857 |P2Thread1of1ForFork2_#t~ite37_Out-2029995857|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P2Thread1of1ForFork2_#t~ite37_Out-2029995857|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-2029995857, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2029995857, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2029995857, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2029995857} OutVars{P2Thread1of1ForFork2_#t~ite37=|P2Thread1of1ForFork2_#t~ite37_Out-2029995857|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-2029995857, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2029995857, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2029995857, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2029995857} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37] because there is no mapped edge [2019-12-18 20:48:42,559 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [793] [793] L812-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= |v_P2Thread1of1ForFork2_#t~ite37_8| v_~y$r_buff1_thd3~0_14)) InVars {P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} OutVars{P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_7|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_14, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37, ~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-18 20:48:42,561 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L787-->L787-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In-2114000447 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-2114000447 256))) (.cse1 (= (mod ~y$r_buff1_thd2~0_In-2114000447 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In-2114000447 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite29_Out-2114000447| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P1Thread1of1ForFork1_#t~ite29_Out-2114000447| ~y$w_buff1_used~0_In-2114000447) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2114000447, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2114000447, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2114000447, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2114000447} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2114000447, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-2114000447|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2114000447, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2114000447, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2114000447} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-12-18 20:48:42,564 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L788-->L789: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1095055395 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-1095055395 256) 0))) (or (and (not .cse0) (= ~y$r_buff0_thd2~0_Out-1095055395 0) (not .cse1)) (and (= ~y$r_buff0_thd2~0_Out-1095055395 ~y$r_buff0_thd2~0_In-1095055395) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1095055395, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1095055395} OutVars{P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-1095055395|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1095055395, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out-1095055395} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite30, ~y$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 20:48:42,564 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L789-->L789-2: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-511221929 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-511221929 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-511221929 256))) (.cse2 (= (mod ~y$r_buff0_thd2~0_In-511221929 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite31_Out-511221929| ~y$r_buff1_thd2~0_In-511221929)) (and (= |P1Thread1of1ForFork1_#t~ite31_Out-511221929| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-511221929, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-511221929, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-511221929, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-511221929} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-511221929, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-511221929, P1Thread1of1ForFork1_#t~ite31=|P1Thread1of1ForFork1_#t~ite31_Out-511221929|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-511221929, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-511221929} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-18 20:48:42,565 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L789-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~y$r_buff1_thd2~0_12 |v_P1Thread1of1ForFork1_#t~ite31_8|) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_12, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_#t~ite31, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 20:48:42,568 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [796] [796] L750-->L750-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-661754948 256) 0))) (or (and (let ((.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In-661754948 256)))) (or (and (= 0 (mod ~y$r_buff1_thd1~0_In-661754948 256)) .cse0) (= (mod ~y$w_buff0_used~0_In-661754948 256) 0) (and (= 0 (mod ~y$w_buff1_used~0_In-661754948 256)) .cse0))) (= ~y$w_buff0~0_In-661754948 |P0Thread1of1ForFork0_#t~ite8_Out-661754948|) (= |P0Thread1of1ForFork0_#t~ite9_Out-661754948| |P0Thread1of1ForFork0_#t~ite8_Out-661754948|) .cse1) (and (not .cse1) (= |P0Thread1of1ForFork0_#t~ite9_Out-661754948| ~y$w_buff0~0_In-661754948) (= |P0Thread1of1ForFork0_#t~ite8_In-661754948| |P0Thread1of1ForFork0_#t~ite8_Out-661754948|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-661754948, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-661754948, ~y$w_buff0~0=~y$w_buff0~0_In-661754948, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-661754948, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_In-661754948|, ~weak$$choice2~0=~weak$$choice2~0_In-661754948, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-661754948} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-661754948, P0Thread1of1ForFork0_#t~ite9=|P0Thread1of1ForFork0_#t~ite9_Out-661754948|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-661754948, ~y$w_buff0~0=~y$w_buff0~0_In-661754948, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-661754948|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-661754948, ~weak$$choice2~0=~weak$$choice2~0_In-661754948, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-661754948} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite9, P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 20:48:42,569 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L751-->L751-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-282260468 256) 0))) (or (and (not .cse0) (= ~y$w_buff1~0_In-282260468 |P0Thread1of1ForFork0_#t~ite12_Out-282260468|) (= |P0Thread1of1ForFork0_#t~ite11_In-282260468| |P0Thread1of1ForFork0_#t~ite11_Out-282260468|)) (and (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In-282260468 256) 0))) (or (= 0 (mod ~y$w_buff0_used~0_In-282260468 256)) (and .cse1 (= (mod ~y$r_buff1_thd1~0_In-282260468 256) 0)) (and (= (mod ~y$w_buff1_used~0_In-282260468 256) 0) .cse1))) (= ~y$w_buff1~0_In-282260468 |P0Thread1of1ForFork0_#t~ite11_Out-282260468|) .cse0 (= |P0Thread1of1ForFork0_#t~ite11_Out-282260468| |P0Thread1of1ForFork0_#t~ite12_Out-282260468|)))) InVars {P0Thread1of1ForFork0_#t~ite11=|P0Thread1of1ForFork0_#t~ite11_In-282260468|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-282260468, ~y$w_buff1~0=~y$w_buff1~0_In-282260468, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-282260468, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-282260468, ~weak$$choice2~0=~weak$$choice2~0_In-282260468, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-282260468} OutVars{P0Thread1of1ForFork0_#t~ite11=|P0Thread1of1ForFork0_#t~ite11_Out-282260468|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-282260468, ~y$w_buff1~0=~y$w_buff1~0_In-282260468, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-282260468, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-282260468, ~weak$$choice2~0=~weak$$choice2~0_In-282260468, P0Thread1of1ForFork0_#t~ite12=|P0Thread1of1ForFork0_#t~ite12_Out-282260468|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-282260468} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite11, P0Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-18 20:48:42,575 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [729] [729] L754-->L755: Formula: (and (= v_~y$r_buff0_thd1~0_49 v_~y$r_buff0_thd1~0_50) (not (= 0 (mod v_~weak$$choice2~0_20 256)))) InVars {~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_50, ~weak$$choice2~0=v_~weak$$choice2~0_20} OutVars{P0Thread1of1ForFork0_#t~ite21=|v_P0Thread1of1ForFork0_#t~ite21_8|, P0Thread1of1ForFork0_#t~ite20=|v_P0Thread1of1ForFork0_#t~ite20_10|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_49, P0Thread1of1ForFork0_#t~ite19=|v_P0Thread1of1ForFork0_#t~ite19_9|, ~weak$$choice2~0=v_~weak$$choice2~0_20} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite21, P0Thread1of1ForFork0_#t~ite20, ~y$r_buff0_thd1~0, P0Thread1of1ForFork0_#t~ite19] because there is no mapped edge [2019-12-18 20:48:42,575 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [807] [807] L755-->L755-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1862518413 256) 0)) (.cse1 (= |P0Thread1of1ForFork0_#t~ite23_Out-1862518413| |P0Thread1of1ForFork0_#t~ite24_Out-1862518413|)) (.cse5 (= 0 (mod ~y$w_buff0_used~0_In-1862518413 256))) (.cse4 (= (mod ~y$w_buff1_used~0_In-1862518413 256) 0)) (.cse6 (= 0 (mod ~y$r_buff0_thd1~0_In-1862518413 256))) (.cse2 (= (mod ~y$r_buff1_thd1~0_In-1862518413 256) 0))) (or (let ((.cse3 (not .cse6))) (and .cse0 .cse1 (or (not .cse2) .cse3) (or .cse3 (not .cse4)) (= |P0Thread1of1ForFork0_#t~ite23_Out-1862518413| |P0Thread1of1ForFork0_#t~ite22_Out-1862518413|) (= |P0Thread1of1ForFork0_#t~ite22_Out-1862518413| 0) (not .cse5))) (and (or (and (= ~y$r_buff1_thd1~0_In-1862518413 |P0Thread1of1ForFork0_#t~ite24_Out-1862518413|) (not .cse0) (= |P0Thread1of1ForFork0_#t~ite23_Out-1862518413| |P0Thread1of1ForFork0_#t~ite23_In-1862518413|)) (and .cse0 .cse1 (= |P0Thread1of1ForFork0_#t~ite23_Out-1862518413| ~y$r_buff1_thd1~0_In-1862518413) (or .cse5 (and .cse6 .cse4) (and .cse6 .cse2)))) (= |P0Thread1of1ForFork0_#t~ite22_In-1862518413| |P0Thread1of1ForFork0_#t~ite22_Out-1862518413|)))) InVars {P0Thread1of1ForFork0_#t~ite22=|P0Thread1of1ForFork0_#t~ite22_In-1862518413|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1862518413, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1862518413, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1862518413, ~weak$$choice2~0=~weak$$choice2~0_In-1862518413, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1862518413, P0Thread1of1ForFork0_#t~ite23=|P0Thread1of1ForFork0_#t~ite23_In-1862518413|} OutVars{P0Thread1of1ForFork0_#t~ite22=|P0Thread1of1ForFork0_#t~ite22_Out-1862518413|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1862518413, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1862518413, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1862518413, ~weak$$choice2~0=~weak$$choice2~0_In-1862518413, P0Thread1of1ForFork0_#t~ite24=|P0Thread1of1ForFork0_#t~ite24_Out-1862518413|, P0Thread1of1ForFork0_#t~ite23=|P0Thread1of1ForFork0_#t~ite23_Out-1862518413|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1862518413} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite22, P0Thread1of1ForFork0_#t~ite24, P0Thread1of1ForFork0_#t~ite23] because there is no mapped edge [2019-12-18 20:48:42,577 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L757-->L765: Formula: (and (= 0 v_~y$flush_delayed~0_6) (not (= 0 (mod v_~y$flush_delayed~0_7 256))) (= v_~__unbuffered_cnt~0_9 (+ v_~__unbuffered_cnt~0_10 1)) (= v_~y~0_17 v_~y$mem_tmp~0_5)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_7|, ~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ~y~0=v_~y~0_17} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0] because there is no mapped edge [2019-12-18 20:48:42,577 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L835-1-->L841: Formula: (and (= 3 v_~__unbuffered_cnt~0_12) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 20:48:42,579 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L841-2-->L841-4: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In1995629660 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In1995629660 256)))) (or (and (or .cse0 .cse1) (= ~y~0_In1995629660 |ULTIMATE.start_main_#t~ite41_Out1995629660|)) (and (= ~y$w_buff1~0_In1995629660 |ULTIMATE.start_main_#t~ite41_Out1995629660|) (not .cse0) (not .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1995629660, ~y~0=~y~0_In1995629660, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1995629660, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1995629660} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out1995629660|, ~y$w_buff1~0=~y$w_buff1~0_In1995629660, ~y~0=~y~0_In1995629660, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1995629660, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1995629660} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-18 20:48:42,579 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L841-4-->L842: Formula: (= v_~y~0_14 |v_ULTIMATE.start_main_#t~ite41_7|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ~y~0=v_~y~0_14, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ~y~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 20:48:42,579 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L842-->L842-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1822799119 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-1822799119 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite43_Out-1822799119|) (not .cse1)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In-1822799119 |ULTIMATE.start_main_#t~ite43_Out-1822799119|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1822799119, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1822799119} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1822799119, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1822799119, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1822799119|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-18 20:48:42,581 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L843-->L843-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1831462676 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1831462676 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-1831462676 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In-1831462676 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite44_Out-1831462676|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~y$w_buff1_used~0_In-1831462676 |ULTIMATE.start_main_#t~ite44_Out-1831462676|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1831462676, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1831462676, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1831462676, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1831462676} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1831462676, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1831462676, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1831462676, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1831462676|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1831462676} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 20:48:42,584 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L844-->L844-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-2128896609 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-2128896609 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite45_Out-2128896609|)) (and (= ~y$r_buff0_thd0~0_In-2128896609 |ULTIMATE.start_main_#t~ite45_Out-2128896609|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2128896609, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2128896609} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2128896609, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2128896609, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-2128896609|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 20:48:42,586 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L845-->L845-2: Formula: (let ((.cse3 (= (mod ~y$w_buff0_used~0_In712088209 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In712088209 256))) (.cse0 (= (mod ~y$r_buff1_thd0~0_In712088209 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In712088209 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite46_Out712088209|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$r_buff1_thd0~0_In712088209 |ULTIMATE.start_main_#t~ite46_Out712088209|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In712088209, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In712088209, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In712088209, ~y$w_buff1_used~0=~y$w_buff1_used~0_In712088209} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In712088209, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In712088209, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out712088209|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In712088209, ~y$w_buff1_used~0=~y$w_buff1_used~0_In712088209} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-18 20:48:42,586 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L845-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_9 0) (= v_~z~0_10 2) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_~__unbuffered_p0_EBX~0_7 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= |v_ULTIMATE.start_main_#t~ite46_13| v_~y$r_buff1_thd0~0_14) (= v_~__unbuffered_p2_EBX~0_8 0) (= v_~__unbuffered_p2_EAX~0_8 2) (= v_~__unbuffered_p0_EAX~0_8 1)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_7, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_8, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_13|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~z~0=v_~z~0_10} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_7, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_8, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_12|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~z~0=v_~z~0_10, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_14, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 20:48:42,696 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 08:48:42 BasicIcfg [2019-12-18 20:48:42,696 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 20:48:42,702 INFO L168 Benchmark]: Toolchain (without parser) took 57637.98 ms. Allocated memory was 136.3 MB in the beginning and 2.4 GB in the end (delta: 2.3 GB). Free memory was 98.2 MB in the beginning and 957.3 MB in the end (delta: -859.1 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-12-18 20:48:42,703 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 136.3 MB. Free memory was 118.2 MB in the beginning and 118.0 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-18 20:48:42,703 INFO L168 Benchmark]: CACSL2BoogieTranslator took 777.60 ms. Allocated memory was 136.3 MB in the beginning and 199.2 MB in the end (delta: 62.9 MB). Free memory was 97.8 MB in the beginning and 151.6 MB in the end (delta: -53.8 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. [2019-12-18 20:48:42,706 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.22 ms. Allocated memory is still 199.2 MB. Free memory was 151.6 MB in the beginning and 148.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-18 20:48:42,707 INFO L168 Benchmark]: Boogie Preprocessor took 64.75 ms. Allocated memory is still 199.2 MB. Free memory was 148.8 MB in the beginning and 146.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-18 20:48:42,707 INFO L168 Benchmark]: RCFGBuilder took 879.99 ms. Allocated memory is still 199.2 MB. Free memory was 146.7 MB in the beginning and 99.4 MB in the end (delta: 47.3 MB). Peak memory consumption was 47.3 MB. Max. memory is 7.1 GB. [2019-12-18 20:48:42,708 INFO L168 Benchmark]: TraceAbstraction took 55848.93 ms. Allocated memory was 199.2 MB in the beginning and 2.4 GB in the end (delta: 2.2 GB). Free memory was 99.4 MB in the beginning and 957.3 MB in the end (delta: -857.9 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-12-18 20:48:42,716 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.15 ms. Allocated memory is still 136.3 MB. Free memory was 118.2 MB in the beginning and 118.0 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 777.60 ms. Allocated memory was 136.3 MB in the beginning and 199.2 MB in the end (delta: 62.9 MB). Free memory was 97.8 MB in the beginning and 151.6 MB in the end (delta: -53.8 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 61.22 ms. Allocated memory is still 199.2 MB. Free memory was 151.6 MB in the beginning and 148.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 64.75 ms. Allocated memory is still 199.2 MB. Free memory was 148.8 MB in the beginning and 146.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 879.99 ms. Allocated memory is still 199.2 MB. Free memory was 146.7 MB in the beginning and 99.4 MB in the end (delta: 47.3 MB). Peak memory consumption was 47.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 55848.93 ms. Allocated memory was 199.2 MB in the beginning and 2.4 GB in the end (delta: 2.2 GB). Free memory was 99.4 MB in the beginning and 957.3 MB in the end (delta: -857.9 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.0s, 166 ProgramPointsBefore, 83 ProgramPointsAfterwards, 197 TransitionsBefore, 90 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 8 FixpointIterations, 35 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 29 ConcurrentYvCompositions, 28 ChoiceCompositions, 6412 VarBasedMoverChecksPositive, 200 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 75401 CheckedPairsTotal, 111 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L831] FCALL, FORK 0 pthread_create(&t648, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L833] FCALL, FORK 0 pthread_create(&t649, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L775] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L776] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L777] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L778] 2 y$r_buff1_thd3 = y$r_buff0_thd3 [L779] 2 y$r_buff0_thd2 = (_Bool)1 [L782] 2 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L785] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L835] FCALL, FORK 0 pthread_create(&t650, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] 3 z = 2 [L802] 3 __unbuffered_p2_EAX = z [L805] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L808] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L785] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L808] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L809] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L810] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L811] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L786] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L787] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L736] 1 a = 1 [L739] 1 x = 1 [L742] 1 __unbuffered_p0_EAX = x [L745] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L746] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L747] 1 y$flush_delayed = weak$$choice2 [L748] 1 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L749] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L749] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L750] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L751] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L752] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L752] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L753] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L753] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L755] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L756] 1 __unbuffered_p0_EBX = y VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L841] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L842] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L843] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L844] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 157 locations, 2 error locations. Result: UNSAFE, OverallTime: 55.5s, OverallIterations: 22, TraceHistogramMax: 1, AutomataDifference: 16.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4215 SDtfs, 5994 SDslu, 13518 SDs, 0 SdLazy, 6701 SolverSat, 285 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 247 GetRequests, 34 SyntacticMatches, 13 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1099 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=82802occurred 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: 21.8s AutomataMinimizationTime, 21 MinimizatonAttempts, 192606 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 862 NumberOfCodeBlocks, 862 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 785 ConstructedInterpolants, 0 QuantifiedInterpolants, 137868 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 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...