/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix011_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 21:29:42,947 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 21:29:42,949 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 21:29:42,967 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 21:29:42,967 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 21:29:42,969 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 21:29:42,971 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 21:29:42,980 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 21:29:42,984 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 21:29:42,987 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 21:29:42,989 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 21:29:42,991 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 21:29:42,991 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 21:29:42,993 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 21:29:42,995 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 21:29:42,997 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 21:29:42,998 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 21:29:42,999 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 21:29:43,000 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 21:29:43,005 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 21:29:43,008 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 21:29:43,015 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 21:29:43,016 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 21:29:43,016 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 21:29:43,018 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 21:29:43,018 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 21:29:43,019 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 21:29:43,019 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 21:29:43,020 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 21:29:43,021 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 21:29:43,022 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 21:29:43,023 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 21:29:43,024 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 21:29:43,025 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 21:29:43,026 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 21:29:43,026 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 21:29:43,027 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 21:29:43,027 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 21:29:43,027 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 21:29:43,028 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 21:29:43,029 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 21:29:43,030 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-26 21:29:43,050 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 21:29:43,051 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 21:29:43,052 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 21:29:43,055 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 21:29:43,056 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 21:29:43,056 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 21:29:43,056 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 21:29:43,056 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 21:29:43,056 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 21:29:43,057 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 21:29:43,057 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 21:29:43,057 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 21:29:43,057 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 21:29:43,057 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 21:29:43,058 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 21:29:43,058 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 21:29:43,058 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 21:29:43,058 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 21:29:43,058 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 21:29:43,059 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 21:29:43,061 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 21:29:43,061 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 21:29:43,061 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 21:29:43,062 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 21:29:43,062 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 21:29:43,062 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 21:29:43,062 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 21:29:43,062 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 21:29:43,062 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 21:29:43,063 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 21:29:43,315 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 21:29:43,328 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 21:29:43,331 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 21:29:43,333 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 21:29:43,333 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 21:29:43,334 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix011_pso.oepc.i [2019-12-26 21:29:43,390 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f068bcc9/9dad71a320d74b7ca5733b9784868643/FLAG6fb56b0bd [2019-12-26 21:29:43,938 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 21:29:43,938 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix011_pso.oepc.i [2019-12-26 21:29:43,960 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f068bcc9/9dad71a320d74b7ca5733b9784868643/FLAG6fb56b0bd [2019-12-26 21:29:44,218 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f068bcc9/9dad71a320d74b7ca5733b9784868643 [2019-12-26 21:29:44,227 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 21:29:44,228 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 21:29:44,229 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 21:29:44,229 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 21:29:44,233 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 21:29:44,234 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 09:29:44" (1/1) ... [2019-12-26 21:29:44,236 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ce4072b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:29:44, skipping insertion in model container [2019-12-26 21:29:44,237 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 09:29:44" (1/1) ... [2019-12-26 21:29:44,244 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 21:29:44,310 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 21:29:44,775 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 21:29:44,787 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 21:29:44,887 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 21:29:44,958 INFO L208 MainTranslator]: Completed translation [2019-12-26 21:29:44,959 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:29:44 WrapperNode [2019-12-26 21:29:44,959 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 21:29:44,960 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 21:29:44,960 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 21:29:44,960 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 21:29:44,969 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:29:44" (1/1) ... [2019-12-26 21:29:44,989 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:29:44" (1/1) ... [2019-12-26 21:29:45,019 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 21:29:45,020 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 21:29:45,020 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 21:29:45,020 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 21:29:45,028 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:29:44" (1/1) ... [2019-12-26 21:29:45,029 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:29:44" (1/1) ... [2019-12-26 21:29:45,036 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:29:44" (1/1) ... [2019-12-26 21:29:45,037 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:29:44" (1/1) ... [2019-12-26 21:29:45,048 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:29:44" (1/1) ... [2019-12-26 21:29:45,052 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:29:44" (1/1) ... [2019-12-26 21:29:45,056 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:29:44" (1/1) ... [2019-12-26 21:29:45,061 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 21:29:45,061 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 21:29:45,061 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 21:29:45,062 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 21:29:45,062 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:29:44" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 21:29:45,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 21:29:45,127 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 21:29:45,127 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 21:29:45,127 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 21:29:45,127 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 21:29:45,128 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 21:29:45,128 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 21:29:45,128 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 21:29:45,128 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-26 21:29:45,128 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-26 21:29:45,128 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 21:29:45,129 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 21:29:45,129 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 21:29:45,131 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 21:29:45,894 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 21:29:45,894 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 21:29:45,896 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 09:29:45 BoogieIcfgContainer [2019-12-26 21:29:45,896 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 21:29:45,897 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 21:29:45,898 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 21:29:45,902 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 21:29:45,902 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 09:29:44" (1/3) ... [2019-12-26 21:29:45,904 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4acf56ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 09:29:45, skipping insertion in model container [2019-12-26 21:29:45,905 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:29:44" (2/3) ... [2019-12-26 21:29:45,905 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4acf56ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 09:29:45, skipping insertion in model container [2019-12-26 21:29:45,906 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 09:29:45" (3/3) ... [2019-12-26 21:29:45,909 INFO L109 eAbstractionObserver]: Analyzing ICFG mix011_pso.oepc.i [2019-12-26 21:29:45,920 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 21:29:45,921 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 21:29:45,932 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 21:29:45,934 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 21:29:45,982 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,983 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,983 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,983 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,984 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,984 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,984 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,985 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,985 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,985 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,986 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,986 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,986 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,986 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,987 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,987 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,987 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,988 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,988 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,988 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,988 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,989 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,989 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,006 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,007 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,007 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,008 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,008 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,008 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,008 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,009 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,009 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,009 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,009 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,010 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,010 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,018 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,018 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,028 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,028 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,028 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,028 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,028 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,029 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,029 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,029 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,029 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,029 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,030 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,030 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,030 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,030 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,030 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,031 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,031 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,031 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,031 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,031 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,032 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,032 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,032 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,032 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,032 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,032 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,033 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,033 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,033 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,033 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,033 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,034 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,034 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,034 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,034 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,034 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,035 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,035 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,035 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,035 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,035 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,036 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,036 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,036 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,036 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,036 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,036 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,037 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,037 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,037 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,037 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,037 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,038 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,038 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,038 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,038 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,038 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,039 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,039 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,039 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,039 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,040 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,040 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,040 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,040 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,040 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,044 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,045 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,045 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,045 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,045 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,045 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,045 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,046 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,046 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,046 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,046 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,046 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,047 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,047 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,047 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,047 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,047 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,048 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,048 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,048 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,048 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,048 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,048 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,049 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,049 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,049 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,049 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,049 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,050 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,050 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,050 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,050 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,050 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,053 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,054 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,054 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,054 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,054 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,054 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,054 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,055 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,055 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,055 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,055 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,055 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,061 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,061 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,061 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,061 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,062 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,062 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,062 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,062 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,062 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,063 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:46,079 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-26 21:29:46,100 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 21:29:46,100 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 21:29:46,100 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 21:29:46,100 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 21:29:46,100 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 21:29:46,101 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 21:29:46,101 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 21:29:46,101 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 21:29:46,118 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 215 transitions [2019-12-26 21:29:46,120 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-26 21:29:46,242 INFO L132 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-26 21:29:46,243 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 21:29:46,262 INFO L76 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 212 events. 47/212 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 426 event pairs. 0/163 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-26 21:29:46,286 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-26 21:29:46,385 INFO L132 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-26 21:29:46,385 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 21:29:46,394 INFO L76 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 212 events. 47/212 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 426 event pairs. 0/163 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-26 21:29:46,416 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-26 21:29:46,417 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 21:29:51,919 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-26 21:29:52,034 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-26 21:29:52,367 WARN L192 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-26 21:29:52,499 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-26 21:29:52,530 INFO L206 etLargeBlockEncoding]: Checked pairs total: 90866 [2019-12-26 21:29:52,531 INFO L214 etLargeBlockEncoding]: Total number of compositions: 114 [2019-12-26 21:29:52,534 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 94 places, 103 transitions [2019-12-26 21:30:15,304 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 123302 states. [2019-12-26 21:30:15,306 INFO L276 IsEmpty]: Start isEmpty. Operand 123302 states. [2019-12-26 21:30:15,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-26 21:30:15,311 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:30:15,312 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-26 21:30:15,312 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:30:15,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:30:15,317 INFO L82 PathProgramCache]: Analyzing trace with hash 918873, now seen corresponding path program 1 times [2019-12-26 21:30:15,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:30:15,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614051875] [2019-12-26 21:30:15,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:30:15,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:30:15,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:30:15,506 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614051875] [2019-12-26 21:30:15,507 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:30:15,507 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 21:30:15,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979498543] [2019-12-26 21:30:15,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:30:15,514 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:30:15,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:30:15,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:30:15,531 INFO L87 Difference]: Start difference. First operand 123302 states. Second operand 3 states. [2019-12-26 21:30:17,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:30:17,054 INFO L93 Difference]: Finished difference Result 122174 states and 518852 transitions. [2019-12-26 21:30:17,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:30:17,056 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-26 21:30:17,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:30:17,688 INFO L225 Difference]: With dead ends: 122174 [2019-12-26 21:30:17,688 INFO L226 Difference]: Without dead ends: 115076 [2019-12-26 21:30:17,689 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:30:27,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115076 states. [2019-12-26 21:30:29,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115076 to 115076. [2019-12-26 21:30:29,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115076 states. [2019-12-26 21:30:30,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115076 states to 115076 states and 488094 transitions. [2019-12-26 21:30:30,251 INFO L78 Accepts]: Start accepts. Automaton has 115076 states and 488094 transitions. Word has length 3 [2019-12-26 21:30:30,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:30:30,252 INFO L462 AbstractCegarLoop]: Abstraction has 115076 states and 488094 transitions. [2019-12-26 21:30:30,252 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:30:30,252 INFO L276 IsEmpty]: Start isEmpty. Operand 115076 states and 488094 transitions. [2019-12-26 21:30:30,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-26 21:30:30,255 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:30:30,255 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:30:30,255 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:30:30,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:30:30,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1360334080, now seen corresponding path program 1 times [2019-12-26 21:30:30,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:30:30,256 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873910939] [2019-12-26 21:30:30,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:30:30,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:30:30,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:30:30,358 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873910939] [2019-12-26 21:30:30,358 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:30:30,358 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:30:30,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960066102] [2019-12-26 21:30:30,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:30:30,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:30:30,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:30:30,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:30:30,362 INFO L87 Difference]: Start difference. First operand 115076 states and 488094 transitions. Second operand 4 states. [2019-12-26 21:30:35,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:30:35,477 INFO L93 Difference]: Finished difference Result 178684 states and 728513 transitions. [2019-12-26 21:30:35,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 21:30:35,477 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-26 21:30:35,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:30:36,132 INFO L225 Difference]: With dead ends: 178684 [2019-12-26 21:30:36,132 INFO L226 Difference]: Without dead ends: 178635 [2019-12-26 21:30:36,133 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:30:43,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178635 states. [2019-12-26 21:30:46,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178635 to 162755. [2019-12-26 21:30:46,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162755 states. [2019-12-26 21:30:54,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162755 states to 162755 states and 672033 transitions. [2019-12-26 21:30:54,740 INFO L78 Accepts]: Start accepts. Automaton has 162755 states and 672033 transitions. Word has length 11 [2019-12-26 21:30:54,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:30:54,740 INFO L462 AbstractCegarLoop]: Abstraction has 162755 states and 672033 transitions. [2019-12-26 21:30:54,740 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:30:54,740 INFO L276 IsEmpty]: Start isEmpty. Operand 162755 states and 672033 transitions. [2019-12-26 21:30:54,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 21:30:54,747 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:30:54,747 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:30:54,748 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:30:54,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:30:54,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1888852276, now seen corresponding path program 1 times [2019-12-26 21:30:54,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:30:54,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799598203] [2019-12-26 21:30:54,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:30:54,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:30:54,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:30:54,832 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799598203] [2019-12-26 21:30:54,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:30:54,832 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:30:54,832 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913352323] [2019-12-26 21:30:54,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:30:54,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:30:54,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:30:54,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:30:54,835 INFO L87 Difference]: Start difference. First operand 162755 states and 672033 transitions. Second operand 3 states. [2019-12-26 21:30:54,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:30:54,979 INFO L93 Difference]: Finished difference Result 34587 states and 111811 transitions. [2019-12-26 21:30:54,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:30:54,984 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-26 21:30:54,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:30:55,040 INFO L225 Difference]: With dead ends: 34587 [2019-12-26 21:30:55,040 INFO L226 Difference]: Without dead ends: 34587 [2019-12-26 21:30:55,041 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:30:55,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34587 states. [2019-12-26 21:30:55,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34587 to 34587. [2019-12-26 21:30:55,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34587 states. [2019-12-26 21:30:55,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34587 states to 34587 states and 111811 transitions. [2019-12-26 21:30:55,733 INFO L78 Accepts]: Start accepts. Automaton has 34587 states and 111811 transitions. Word has length 13 [2019-12-26 21:30:55,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:30:55,734 INFO L462 AbstractCegarLoop]: Abstraction has 34587 states and 111811 transitions. [2019-12-26 21:30:55,734 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:30:55,734 INFO L276 IsEmpty]: Start isEmpty. Operand 34587 states and 111811 transitions. [2019-12-26 21:30:55,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-26 21:30:55,737 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:30:55,737 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:30:55,737 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:30:55,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:30:55,738 INFO L82 PathProgramCache]: Analyzing trace with hash -1220224201, now seen corresponding path program 1 times [2019-12-26 21:30:55,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:30:55,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791142933] [2019-12-26 21:30:55,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:30:55,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:30:55,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:30:55,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791142933] [2019-12-26 21:30:55,883 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:30:55,883 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:30:55,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015212757] [2019-12-26 21:30:55,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 21:30:55,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:30:55,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 21:30:55,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:30:55,886 INFO L87 Difference]: Start difference. First operand 34587 states and 111811 transitions. Second operand 5 states. [2019-12-26 21:30:59,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:30:59,171 INFO L93 Difference]: Finished difference Result 47506 states and 151809 transitions. [2019-12-26 21:30:59,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 21:30:59,171 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-26 21:30:59,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:30:59,260 INFO L225 Difference]: With dead ends: 47506 [2019-12-26 21:30:59,260 INFO L226 Difference]: Without dead ends: 47506 [2019-12-26 21:30:59,261 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:30:59,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47506 states. [2019-12-26 21:30:59,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47506 to 39981. [2019-12-26 21:30:59,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39981 states. [2019-12-26 21:30:59,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39981 states to 39981 states and 128832 transitions. [2019-12-26 21:30:59,980 INFO L78 Accepts]: Start accepts. Automaton has 39981 states and 128832 transitions. Word has length 16 [2019-12-26 21:30:59,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:30:59,982 INFO L462 AbstractCegarLoop]: Abstraction has 39981 states and 128832 transitions. [2019-12-26 21:30:59,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 21:30:59,982 INFO L276 IsEmpty]: Start isEmpty. Operand 39981 states and 128832 transitions. [2019-12-26 21:30:59,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-26 21:30:59,991 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:30:59,992 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-26 21:30:59,992 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:30:59,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:30:59,992 INFO L82 PathProgramCache]: Analyzing trace with hash -1720601530, now seen corresponding path program 1 times [2019-12-26 21:30:59,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:30:59,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430089477] [2019-12-26 21:30:59,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:31:00,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:31:00,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:31:00,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430089477] [2019-12-26 21:31:00,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:31:00,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 21:31:00,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270429456] [2019-12-26 21:31:00,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 21:31:00,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:31:00,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 21:31:00,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 21:31:00,083 INFO L87 Difference]: Start difference. First operand 39981 states and 128832 transitions. Second operand 6 states. [2019-12-26 21:31:00,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:31:00,991 INFO L93 Difference]: Finished difference Result 59624 states and 187628 transitions. [2019-12-26 21:31:00,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-26 21:31:00,991 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-26 21:31:00,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:31:01,083 INFO L225 Difference]: With dead ends: 59624 [2019-12-26 21:31:01,083 INFO L226 Difference]: Without dead ends: 59617 [2019-12-26 21:31:01,084 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-26 21:31:01,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59617 states. [2019-12-26 21:31:02,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59617 to 40463. [2019-12-26 21:31:02,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40463 states. [2019-12-26 21:31:02,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40463 states to 40463 states and 129749 transitions. [2019-12-26 21:31:02,241 INFO L78 Accepts]: Start accepts. Automaton has 40463 states and 129749 transitions. Word has length 22 [2019-12-26 21:31:02,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:31:02,241 INFO L462 AbstractCegarLoop]: Abstraction has 40463 states and 129749 transitions. [2019-12-26 21:31:02,241 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 21:31:02,241 INFO L276 IsEmpty]: Start isEmpty. Operand 40463 states and 129749 transitions. [2019-12-26 21:31:02,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-26 21:31:02,256 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:31:02,256 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-26 21:31:02,256 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:31:02,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:31:02,257 INFO L82 PathProgramCache]: Analyzing trace with hash -74763598, now seen corresponding path program 1 times [2019-12-26 21:31:02,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:31:02,257 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767170463] [2019-12-26 21:31:02,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:31:02,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:31:02,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:31:02,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767170463] [2019-12-26 21:31:02,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:31:02,316 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:31:02,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240875322] [2019-12-26 21:31:02,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:31:02,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:31:02,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:31:02,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:31:02,317 INFO L87 Difference]: Start difference. First operand 40463 states and 129749 transitions. Second operand 4 states. [2019-12-26 21:31:02,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:31:02,382 INFO L93 Difference]: Finished difference Result 16096 states and 48753 transitions. [2019-12-26 21:31:02,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 21:31:02,382 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-26 21:31:02,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:31:02,404 INFO L225 Difference]: With dead ends: 16096 [2019-12-26 21:31:02,404 INFO L226 Difference]: Without dead ends: 16096 [2019-12-26 21:31:02,405 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:31:02,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16096 states. [2019-12-26 21:31:02,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16096 to 15803. [2019-12-26 21:31:02,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15803 states. [2019-12-26 21:31:02,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15803 states to 15803 states and 47917 transitions. [2019-12-26 21:31:02,638 INFO L78 Accepts]: Start accepts. Automaton has 15803 states and 47917 transitions. Word has length 25 [2019-12-26 21:31:02,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:31:02,639 INFO L462 AbstractCegarLoop]: Abstraction has 15803 states and 47917 transitions. [2019-12-26 21:31:02,639 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:31:02,639 INFO L276 IsEmpty]: Start isEmpty. Operand 15803 states and 47917 transitions. [2019-12-26 21:31:02,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-26 21:31:02,651 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:31:02,652 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] [2019-12-26 21:31:02,652 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:31:02,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:31:02,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1856606199, now seen corresponding path program 1 times [2019-12-26 21:31:02,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:31:02,653 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594834606] [2019-12-26 21:31:02,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:31:02,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:31:02,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:31:02,747 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594834606] [2019-12-26 21:31:02,747 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:31:02,747 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 21:31:02,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573896319] [2019-12-26 21:31:02,748 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 21:31:02,748 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:31:02,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 21:31:02,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 21:31:02,749 INFO L87 Difference]: Start difference. First operand 15803 states and 47917 transitions. Second operand 6 states. [2019-12-26 21:31:03,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:31:03,316 INFO L93 Difference]: Finished difference Result 22779 states and 67340 transitions. [2019-12-26 21:31:03,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-26 21:31:03,316 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-26 21:31:03,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:31:03,350 INFO L225 Difference]: With dead ends: 22779 [2019-12-26 21:31:03,350 INFO L226 Difference]: Without dead ends: 22779 [2019-12-26 21:31:03,350 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-26 21:31:03,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22779 states. [2019-12-26 21:31:03,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22779 to 18120. [2019-12-26 21:31:03,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18120 states. [2019-12-26 21:31:03,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18120 states to 18120 states and 54739 transitions. [2019-12-26 21:31:03,796 INFO L78 Accepts]: Start accepts. Automaton has 18120 states and 54739 transitions. Word has length 27 [2019-12-26 21:31:03,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:31:03,797 INFO L462 AbstractCegarLoop]: Abstraction has 18120 states and 54739 transitions. [2019-12-26 21:31:03,797 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 21:31:03,797 INFO L276 IsEmpty]: Start isEmpty. Operand 18120 states and 54739 transitions. [2019-12-26 21:31:03,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-26 21:31:03,816 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:31:03,816 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] [2019-12-26 21:31:03,816 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:31:03,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:31:03,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1731527828, now seen corresponding path program 1 times [2019-12-26 21:31:03,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:31:03,817 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770637983] [2019-12-26 21:31:03,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:31:03,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:31:03,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:31:03,914 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770637983] [2019-12-26 21:31:03,915 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:31:03,915 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 21:31:03,915 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602639808] [2019-12-26 21:31:03,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 21:31:03,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:31:03,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 21:31:03,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:31:03,916 INFO L87 Difference]: Start difference. First operand 18120 states and 54739 transitions. Second operand 7 states. [2019-12-26 21:31:04,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:31:04,940 INFO L93 Difference]: Finished difference Result 24798 states and 73024 transitions. [2019-12-26 21:31:04,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-26 21:31:04,941 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-26 21:31:04,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:31:04,974 INFO L225 Difference]: With dead ends: 24798 [2019-12-26 21:31:04,974 INFO L226 Difference]: Without dead ends: 24798 [2019-12-26 21:31:04,975 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-26 21:31:05,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24798 states. [2019-12-26 21:31:05,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24798 to 16706. [2019-12-26 21:31:05,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16706 states. [2019-12-26 21:31:05,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16706 states to 16706 states and 50524 transitions. [2019-12-26 21:31:05,269 INFO L78 Accepts]: Start accepts. Automaton has 16706 states and 50524 transitions. Word has length 33 [2019-12-26 21:31:05,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:31:05,270 INFO L462 AbstractCegarLoop]: Abstraction has 16706 states and 50524 transitions. [2019-12-26 21:31:05,270 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 21:31:05,270 INFO L276 IsEmpty]: Start isEmpty. Operand 16706 states and 50524 transitions. [2019-12-26 21:31:05,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-26 21:31:05,292 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:31:05,292 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-26 21:31:05,292 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:31:05,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:31:05,293 INFO L82 PathProgramCache]: Analyzing trace with hash -1723865273, now seen corresponding path program 1 times [2019-12-26 21:31:05,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:31:05,293 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116672023] [2019-12-26 21:31:05,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:31:05,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:31:05,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:31:05,359 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116672023] [2019-12-26 21:31:05,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:31:05,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:31:05,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976830201] [2019-12-26 21:31:05,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:31:05,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:31:05,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:31:05,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:31:05,361 INFO L87 Difference]: Start difference. First operand 16706 states and 50524 transitions. Second operand 3 states. [2019-12-26 21:31:05,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:31:05,477 INFO L93 Difference]: Finished difference Result 28297 states and 85903 transitions. [2019-12-26 21:31:05,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:31:05,478 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-26 21:31:05,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:31:05,512 INFO L225 Difference]: With dead ends: 28297 [2019-12-26 21:31:05,513 INFO L226 Difference]: Without dead ends: 14210 [2019-12-26 21:31:05,513 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:31:05,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14210 states. [2019-12-26 21:31:05,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14210 to 14150. [2019-12-26 21:31:05,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14150 states. [2019-12-26 21:31:05,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14150 states to 14150 states and 42128 transitions. [2019-12-26 21:31:05,841 INFO L78 Accepts]: Start accepts. Automaton has 14150 states and 42128 transitions. Word has length 39 [2019-12-26 21:31:05,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:31:05,841 INFO L462 AbstractCegarLoop]: Abstraction has 14150 states and 42128 transitions. [2019-12-26 21:31:05,841 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:31:05,841 INFO L276 IsEmpty]: Start isEmpty. Operand 14150 states and 42128 transitions. [2019-12-26 21:31:05,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-26 21:31:05,857 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:31:05,857 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:31:05,858 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:31:05,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:31:05,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1940280365, now seen corresponding path program 2 times [2019-12-26 21:31:05,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:31:05,858 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550985992] [2019-12-26 21:31:05,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:31:05,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:31:05,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:31:05,918 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550985992] [2019-12-26 21:31:05,918 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:31:05,918 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 21:31:05,918 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513096173] [2019-12-26 21:31:05,919 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:31:05,919 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:31:05,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:31:05,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:31:05,919 INFO L87 Difference]: Start difference. First operand 14150 states and 42128 transitions. Second operand 3 states. [2019-12-26 21:31:05,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:31:05,982 INFO L93 Difference]: Finished difference Result 14149 states and 42126 transitions. [2019-12-26 21:31:05,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:31:05,983 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-26 21:31:05,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:31:06,009 INFO L225 Difference]: With dead ends: 14149 [2019-12-26 21:31:06,009 INFO L226 Difference]: Without dead ends: 14149 [2019-12-26 21:31:06,010 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:31:06,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14149 states. [2019-12-26 21:31:06,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14149 to 14149. [2019-12-26 21:31:06,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14149 states. [2019-12-26 21:31:06,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14149 states to 14149 states and 42126 transitions. [2019-12-26 21:31:06,343 INFO L78 Accepts]: Start accepts. Automaton has 14149 states and 42126 transitions. Word has length 39 [2019-12-26 21:31:06,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:31:06,343 INFO L462 AbstractCegarLoop]: Abstraction has 14149 states and 42126 transitions. [2019-12-26 21:31:06,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:31:06,343 INFO L276 IsEmpty]: Start isEmpty. Operand 14149 states and 42126 transitions. [2019-12-26 21:31:06,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-26 21:31:06,360 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:31:06,360 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-26 21:31:06,361 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:31:06,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:31:06,361 INFO L82 PathProgramCache]: Analyzing trace with hash 140069502, now seen corresponding path program 1 times [2019-12-26 21:31:06,361 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:31:06,361 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690497326] [2019-12-26 21:31:06,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:31:06,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:31:06,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:31:06,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690497326] [2019-12-26 21:31:06,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:31:06,416 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 21:31:06,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546932501] [2019-12-26 21:31:06,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 21:31:06,418 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:31:06,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 21:31:06,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:31:06,418 INFO L87 Difference]: Start difference. First operand 14149 states and 42126 transitions. Second operand 5 states. [2019-12-26 21:31:06,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:31:06,494 INFO L93 Difference]: Finished difference Result 13093 states and 39713 transitions. [2019-12-26 21:31:06,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 21:31:06,494 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-26 21:31:06,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:31:06,518 INFO L225 Difference]: With dead ends: 13093 [2019-12-26 21:31:06,518 INFO L226 Difference]: Without dead ends: 11563 [2019-12-26 21:31:06,518 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:31:06,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11563 states. [2019-12-26 21:31:06,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11563 to 11150. [2019-12-26 21:31:06,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11150 states. [2019-12-26 21:31:06,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11150 states to 11150 states and 34836 transitions. [2019-12-26 21:31:06,738 INFO L78 Accepts]: Start accepts. Automaton has 11150 states and 34836 transitions. Word has length 40 [2019-12-26 21:31:06,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:31:06,738 INFO L462 AbstractCegarLoop]: Abstraction has 11150 states and 34836 transitions. [2019-12-26 21:31:06,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 21:31:06,738 INFO L276 IsEmpty]: Start isEmpty. Operand 11150 states and 34836 transitions. [2019-12-26 21:31:06,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 21:31:06,750 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:31:06,750 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:31:06,750 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:31:06,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:31:06,750 INFO L82 PathProgramCache]: Analyzing trace with hash 1749898488, now seen corresponding path program 1 times [2019-12-26 21:31:06,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:31:06,751 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935528541] [2019-12-26 21:31:06,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:31:06,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:31:06,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:31:06,793 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935528541] [2019-12-26 21:31:06,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:31:06,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:31:06,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461711800] [2019-12-26 21:31:06,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:31:06,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:31:06,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:31:06,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:31:06,795 INFO L87 Difference]: Start difference. First operand 11150 states and 34836 transitions. Second operand 3 states. [2019-12-26 21:31:06,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:31:06,886 INFO L93 Difference]: Finished difference Result 17888 states and 54761 transitions. [2019-12-26 21:31:06,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:31:06,887 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-26 21:31:06,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:31:06,917 INFO L225 Difference]: With dead ends: 17888 [2019-12-26 21:31:06,918 INFO L226 Difference]: Without dead ends: 17888 [2019-12-26 21:31:06,918 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:31:07,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17888 states. [2019-12-26 21:31:07,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17888 to 12900. [2019-12-26 21:31:07,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12900 states. [2019-12-26 21:31:07,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12900 states to 12900 states and 39991 transitions. [2019-12-26 21:31:07,288 INFO L78 Accepts]: Start accepts. Automaton has 12900 states and 39991 transitions. Word has length 64 [2019-12-26 21:31:07,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:31:07,289 INFO L462 AbstractCegarLoop]: Abstraction has 12900 states and 39991 transitions. [2019-12-26 21:31:07,289 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:31:07,289 INFO L276 IsEmpty]: Start isEmpty. Operand 12900 states and 39991 transitions. [2019-12-26 21:31:07,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 21:31:07,315 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:31:07,315 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:31:07,316 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:31:07,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:31:07,316 INFO L82 PathProgramCache]: Analyzing trace with hash 1943324054, now seen corresponding path program 1 times [2019-12-26 21:31:07,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:31:07,316 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562703211] [2019-12-26 21:31:07,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:31:07,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:31:07,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:31:07,483 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562703211] [2019-12-26 21:31:07,483 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:31:07,483 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 21:31:07,484 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018589897] [2019-12-26 21:31:07,485 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 21:31:07,485 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:31:07,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 21:31:07,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:31:07,489 INFO L87 Difference]: Start difference. First operand 12900 states and 39991 transitions. Second operand 7 states. [2019-12-26 21:31:07,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:31:07,977 INFO L93 Difference]: Finished difference Result 37114 states and 114341 transitions. [2019-12-26 21:31:07,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-26 21:31:07,977 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-26 21:31:07,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:31:08,027 INFO L225 Difference]: With dead ends: 37114 [2019-12-26 21:31:08,027 INFO L226 Difference]: Without dead ends: 27250 [2019-12-26 21:31:08,028 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-26 21:31:08,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27250 states. [2019-12-26 21:31:08,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27250 to 15594. [2019-12-26 21:31:08,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15594 states. [2019-12-26 21:31:08,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15594 states to 15594 states and 48552 transitions. [2019-12-26 21:31:08,541 INFO L78 Accepts]: Start accepts. Automaton has 15594 states and 48552 transitions. Word has length 64 [2019-12-26 21:31:08,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:31:08,541 INFO L462 AbstractCegarLoop]: Abstraction has 15594 states and 48552 transitions. [2019-12-26 21:31:08,541 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 21:31:08,541 INFO L276 IsEmpty]: Start isEmpty. Operand 15594 states and 48552 transitions. [2019-12-26 21:31:08,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 21:31:08,561 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:31:08,561 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:31:08,561 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:31:08,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:31:08,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1388273988, now seen corresponding path program 2 times [2019-12-26 21:31:08,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:31:08,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941290244] [2019-12-26 21:31:08,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:31:08,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:31:08,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:31:08,662 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941290244] [2019-12-26 21:31:08,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:31:08,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 21:31:08,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017535667] [2019-12-26 21:31:08,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 21:31:08,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:31:08,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 21:31:08,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:31:08,664 INFO L87 Difference]: Start difference. First operand 15594 states and 48552 transitions. Second operand 7 states. [2019-12-26 21:31:09,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:31:09,108 INFO L93 Difference]: Finished difference Result 41160 states and 125962 transitions. [2019-12-26 21:31:09,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-26 21:31:09,109 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-26 21:31:09,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:31:09,163 INFO L225 Difference]: With dead ends: 41160 [2019-12-26 21:31:09,163 INFO L226 Difference]: Without dead ends: 29917 [2019-12-26 21:31:09,164 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 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-26 21:31:09,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29917 states. [2019-12-26 21:31:09,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29917 to 18174. [2019-12-26 21:31:09,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18174 states. [2019-12-26 21:31:09,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18174 states to 18174 states and 56555 transitions. [2019-12-26 21:31:09,702 INFO L78 Accepts]: Start accepts. Automaton has 18174 states and 56555 transitions. Word has length 64 [2019-12-26 21:31:09,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:31:09,702 INFO L462 AbstractCegarLoop]: Abstraction has 18174 states and 56555 transitions. [2019-12-26 21:31:09,703 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 21:31:09,703 INFO L276 IsEmpty]: Start isEmpty. Operand 18174 states and 56555 transitions. [2019-12-26 21:31:09,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 21:31:09,730 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:31:09,730 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:31:09,731 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:31:09,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:31:09,731 INFO L82 PathProgramCache]: Analyzing trace with hash -1006987750, now seen corresponding path program 3 times [2019-12-26 21:31:09,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:31:09,731 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050005161] [2019-12-26 21:31:09,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:31:09,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:31:09,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:31:09,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050005161] [2019-12-26 21:31:09,852 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:31:09,852 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 21:31:09,852 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619106058] [2019-12-26 21:31:09,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 21:31:09,852 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:31:09,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 21:31:09,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-26 21:31:09,853 INFO L87 Difference]: Start difference. First operand 18174 states and 56555 transitions. Second operand 9 states. [2019-12-26 21:31:11,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:31:11,388 INFO L93 Difference]: Finished difference Result 69591 states and 211239 transitions. [2019-12-26 21:31:11,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-26 21:31:11,389 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-26 21:31:11,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:31:11,496 INFO L225 Difference]: With dead ends: 69591 [2019-12-26 21:31:11,496 INFO L226 Difference]: Without dead ends: 65149 [2019-12-26 21:31:11,497 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=229, Invalid=701, Unknown=0, NotChecked=0, Total=930 [2019-12-26 21:31:11,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65149 states. [2019-12-26 21:31:12,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65149 to 18319. [2019-12-26 21:31:12,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18319 states. [2019-12-26 21:31:12,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18319 states to 18319 states and 57144 transitions. [2019-12-26 21:31:12,327 INFO L78 Accepts]: Start accepts. Automaton has 18319 states and 57144 transitions. Word has length 64 [2019-12-26 21:31:12,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:31:12,327 INFO L462 AbstractCegarLoop]: Abstraction has 18319 states and 57144 transitions. [2019-12-26 21:31:12,328 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 21:31:12,328 INFO L276 IsEmpty]: Start isEmpty. Operand 18319 states and 57144 transitions. [2019-12-26 21:31:12,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 21:31:12,349 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:31:12,349 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:31:12,349 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:31:12,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:31:12,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1302254906, now seen corresponding path program 1 times [2019-12-26 21:31:12,349 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:31:12,350 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901814376] [2019-12-26 21:31:12,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:31:12,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:31:12,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:31:12,402 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901814376] [2019-12-26 21:31:12,403 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:31:12,403 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:31:12,403 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400259932] [2019-12-26 21:31:12,403 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:31:12,404 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:31:12,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:31:12,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:31:12,404 INFO L87 Difference]: Start difference. First operand 18319 states and 57144 transitions. Second operand 3 states. [2019-12-26 21:31:12,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:31:12,545 INFO L93 Difference]: Finished difference Result 23765 states and 72382 transitions. [2019-12-26 21:31:12,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:31:12,546 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-26 21:31:12,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:31:12,591 INFO L225 Difference]: With dead ends: 23765 [2019-12-26 21:31:12,591 INFO L226 Difference]: Without dead ends: 23765 [2019-12-26 21:31:12,592 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:31:12,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23765 states. [2019-12-26 21:31:13,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23765 to 18819. [2019-12-26 21:31:13,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18819 states. [2019-12-26 21:31:13,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18819 states to 18819 states and 57725 transitions. [2019-12-26 21:31:13,098 INFO L78 Accepts]: Start accepts. Automaton has 18819 states and 57725 transitions. Word has length 64 [2019-12-26 21:31:13,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:31:13,099 INFO L462 AbstractCegarLoop]: Abstraction has 18819 states and 57725 transitions. [2019-12-26 21:31:13,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:31:13,099 INFO L276 IsEmpty]: Start isEmpty. Operand 18819 states and 57725 transitions. [2019-12-26 21:31:13,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 21:31:13,130 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:31:13,131 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:31:13,131 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:31:13,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:31:13,131 INFO L82 PathProgramCache]: Analyzing trace with hash 479548822, now seen corresponding path program 4 times [2019-12-26 21:31:13,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:31:13,132 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184000275] [2019-12-26 21:31:13,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:31:13,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:31:13,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:31:13,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184000275] [2019-12-26 21:31:13,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:31:13,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 21:31:13,255 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915352375] [2019-12-26 21:31:13,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 21:31:13,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:31:13,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 21:31:13,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-26 21:31:13,257 INFO L87 Difference]: Start difference. First operand 18819 states and 57725 transitions. Second operand 9 states. [2019-12-26 21:31:14,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:31:14,543 INFO L93 Difference]: Finished difference Result 63866 states and 192746 transitions. [2019-12-26 21:31:14,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-26 21:31:14,543 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-26 21:31:14,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:31:14,811 INFO L225 Difference]: With dead ends: 63866 [2019-12-26 21:31:14,812 INFO L226 Difference]: Without dead ends: 61442 [2019-12-26 21:31:14,812 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2019-12-26 21:31:14,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61442 states. [2019-12-26 21:31:15,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61442 to 18847. [2019-12-26 21:31:15,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18847 states. [2019-12-26 21:31:15,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18847 states to 18847 states and 57879 transitions. [2019-12-26 21:31:15,351 INFO L78 Accepts]: Start accepts. Automaton has 18847 states and 57879 transitions. Word has length 64 [2019-12-26 21:31:15,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:31:15,351 INFO L462 AbstractCegarLoop]: Abstraction has 18847 states and 57879 transitions. [2019-12-26 21:31:15,351 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 21:31:15,351 INFO L276 IsEmpty]: Start isEmpty. Operand 18847 states and 57879 transitions. [2019-12-26 21:31:15,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 21:31:15,370 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:31:15,370 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:31:15,370 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:31:15,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:31:15,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1651786320, now seen corresponding path program 5 times [2019-12-26 21:31:15,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:31:15,371 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371434871] [2019-12-26 21:31:15,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:31:15,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:31:15,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:31:15,430 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371434871] [2019-12-26 21:31:15,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:31:15,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:31:15,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044372334] [2019-12-26 21:31:15,431 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:31:15,431 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:31:15,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:31:15,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:31:15,432 INFO L87 Difference]: Start difference. First operand 18847 states and 57879 transitions. Second operand 3 states. [2019-12-26 21:31:15,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:31:15,557 INFO L93 Difference]: Finished difference Result 22647 states and 69341 transitions. [2019-12-26 21:31:15,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:31:15,558 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-26 21:31:15,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:31:15,586 INFO L225 Difference]: With dead ends: 22647 [2019-12-26 21:31:15,586 INFO L226 Difference]: Without dead ends: 22647 [2019-12-26 21:31:15,587 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:31:15,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22647 states. [2019-12-26 21:31:15,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22647 to 19666. [2019-12-26 21:31:15,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19666 states. [2019-12-26 21:31:15,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19666 states to 19666 states and 60576 transitions. [2019-12-26 21:31:15,897 INFO L78 Accepts]: Start accepts. Automaton has 19666 states and 60576 transitions. Word has length 64 [2019-12-26 21:31:15,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:31:15,898 INFO L462 AbstractCegarLoop]: Abstraction has 19666 states and 60576 transitions. [2019-12-26 21:31:15,898 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:31:15,898 INFO L276 IsEmpty]: Start isEmpty. Operand 19666 states and 60576 transitions. [2019-12-26 21:31:15,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 21:31:15,918 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:31:15,919 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:31:15,919 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:31:15,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:31:15,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1362059626, now seen corresponding path program 1 times [2019-12-26 21:31:15,919 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:31:15,919 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259238737] [2019-12-26 21:31:15,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:31:15,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:31:16,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:31:16,029 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259238737] [2019-12-26 21:31:16,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:31:16,029 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 21:31:16,029 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126797405] [2019-12-26 21:31:16,029 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 21:31:16,030 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:31:16,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 21:31:16,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-26 21:31:16,030 INFO L87 Difference]: Start difference. First operand 19666 states and 60576 transitions. Second operand 9 states. [2019-12-26 21:31:17,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:31:17,366 INFO L93 Difference]: Finished difference Result 55818 states and 167465 transitions. [2019-12-26 21:31:17,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-26 21:31:17,366 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-26 21:31:17,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:31:17,433 INFO L225 Difference]: With dead ends: 55818 [2019-12-26 21:31:17,434 INFO L226 Difference]: Without dead ends: 52885 [2019-12-26 21:31:17,434 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2019-12-26 21:31:17,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52885 states. [2019-12-26 21:31:17,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52885 to 19731. [2019-12-26 21:31:17,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19731 states. [2019-12-26 21:31:17,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19731 states to 19731 states and 60809 transitions. [2019-12-26 21:31:17,970 INFO L78 Accepts]: Start accepts. Automaton has 19731 states and 60809 transitions. Word has length 65 [2019-12-26 21:31:17,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:31:17,971 INFO L462 AbstractCegarLoop]: Abstraction has 19731 states and 60809 transitions. [2019-12-26 21:31:17,971 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 21:31:17,971 INFO L276 IsEmpty]: Start isEmpty. Operand 19731 states and 60809 transitions. [2019-12-26 21:31:17,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 21:31:17,991 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:31:17,991 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:31:17,991 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:31:17,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:31:17,992 INFO L82 PathProgramCache]: Analyzing trace with hash 938389066, now seen corresponding path program 2 times [2019-12-26 21:31:17,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:31:17,992 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397767010] [2019-12-26 21:31:17,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:31:18,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:31:18,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:31:18,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397767010] [2019-12-26 21:31:18,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:31:18,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 21:31:18,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899963992] [2019-12-26 21:31:18,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 21:31:18,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:31:18,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 21:31:18,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-26 21:31:18,108 INFO L87 Difference]: Start difference. First operand 19731 states and 60809 transitions. Second operand 9 states. [2019-12-26 21:31:19,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:31:19,452 INFO L93 Difference]: Finished difference Result 60486 states and 181076 transitions. [2019-12-26 21:31:19,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-26 21:31:19,453 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-26 21:31:19,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:31:19,525 INFO L225 Difference]: With dead ends: 60486 [2019-12-26 21:31:19,526 INFO L226 Difference]: Without dead ends: 57568 [2019-12-26 21:31:19,526 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=159, Invalid=491, Unknown=0, NotChecked=0, Total=650 [2019-12-26 21:31:19,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57568 states. [2019-12-26 21:31:20,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57568 to 19623. [2019-12-26 21:31:20,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19623 states. [2019-12-26 21:31:20,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19623 states to 19623 states and 60279 transitions. [2019-12-26 21:31:20,299 INFO L78 Accepts]: Start accepts. Automaton has 19623 states and 60279 transitions. Word has length 65 [2019-12-26 21:31:20,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:31:20,300 INFO L462 AbstractCegarLoop]: Abstraction has 19623 states and 60279 transitions. [2019-12-26 21:31:20,300 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 21:31:20,300 INFO L276 IsEmpty]: Start isEmpty. Operand 19623 states and 60279 transitions. [2019-12-26 21:31:20,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 21:31:20,321 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:31:20,321 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:31:20,321 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:31:20,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:31:20,321 INFO L82 PathProgramCache]: Analyzing trace with hash -848247963, now seen corresponding path program 1 times [2019-12-26 21:31:20,321 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:31:20,323 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2406918] [2019-12-26 21:31:20,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:31:20,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:31:20,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:31:20,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2406918] [2019-12-26 21:31:20,532 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:31:20,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 21:31:20,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782546843] [2019-12-26 21:31:20,533 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 21:31:20,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:31:20,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 21:31:20,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-26 21:31:20,533 INFO L87 Difference]: Start difference. First operand 19623 states and 60279 transitions. Second operand 9 states. [2019-12-26 21:31:23,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:31:23,131 INFO L93 Difference]: Finished difference Result 35899 states and 106198 transitions. [2019-12-26 21:31:23,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-26 21:31:23,132 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-26 21:31:23,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:31:23,179 INFO L225 Difference]: With dead ends: 35899 [2019-12-26 21:31:23,179 INFO L226 Difference]: Without dead ends: 35659 [2019-12-26 21:31:23,179 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 6 SyntacticMatches, 4 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=208, Invalid=982, Unknown=0, NotChecked=0, Total=1190 [2019-12-26 21:31:23,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35659 states. [2019-12-26 21:31:23,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35659 to 24757. [2019-12-26 21:31:23,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24757 states. [2019-12-26 21:31:23,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24757 states to 24757 states and 75081 transitions. [2019-12-26 21:31:23,614 INFO L78 Accepts]: Start accepts. Automaton has 24757 states and 75081 transitions. Word has length 65 [2019-12-26 21:31:23,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:31:23,615 INFO L462 AbstractCegarLoop]: Abstraction has 24757 states and 75081 transitions. [2019-12-26 21:31:23,615 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 21:31:23,615 INFO L276 IsEmpty]: Start isEmpty. Operand 24757 states and 75081 transitions. [2019-12-26 21:31:23,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 21:31:23,639 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:31:23,639 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:31:23,639 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:31:23,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:31:23,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1625168593, now seen corresponding path program 2 times [2019-12-26 21:31:23,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:31:23,640 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911649313] [2019-12-26 21:31:23,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:31:23,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:31:23,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:31:23,708 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911649313] [2019-12-26 21:31:23,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:31:23,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:31:23,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071986013] [2019-12-26 21:31:23,709 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:31:23,709 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:31:23,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:31:23,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:31:23,710 INFO L87 Difference]: Start difference. First operand 24757 states and 75081 transitions. Second operand 3 states. [2019-12-26 21:31:23,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:31:23,814 INFO L93 Difference]: Finished difference Result 24756 states and 75079 transitions. [2019-12-26 21:31:23,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:31:23,815 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-26 21:31:23,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:31:23,866 INFO L225 Difference]: With dead ends: 24756 [2019-12-26 21:31:23,866 INFO L226 Difference]: Without dead ends: 24756 [2019-12-26 21:31:23,867 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:31:24,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24756 states. [2019-12-26 21:31:24,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24756 to 19983. [2019-12-26 21:31:24,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19983 states. [2019-12-26 21:31:24,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19983 states to 19983 states and 61703 transitions. [2019-12-26 21:31:24,583 INFO L78 Accepts]: Start accepts. Automaton has 19983 states and 61703 transitions. Word has length 65 [2019-12-26 21:31:24,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:31:24,584 INFO L462 AbstractCegarLoop]: Abstraction has 19983 states and 61703 transitions. [2019-12-26 21:31:24,584 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:31:24,584 INFO L276 IsEmpty]: Start isEmpty. Operand 19983 states and 61703 transitions. [2019-12-26 21:31:24,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 21:31:24,606 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:31:24,606 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:31:24,606 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:31:24,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:31:24,606 INFO L82 PathProgramCache]: Analyzing trace with hash -458333570, now seen corresponding path program 1 times [2019-12-26 21:31:24,606 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:31:24,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412133461] [2019-12-26 21:31:24,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:31:24,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:31:24,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:31:24,686 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412133461] [2019-12-26 21:31:24,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:31:24,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:31:24,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60651823] [2019-12-26 21:31:24,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:31:24,687 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:31:24,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:31:24,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:31:24,687 INFO L87 Difference]: Start difference. First operand 19983 states and 61703 transitions. Second operand 3 states. [2019-12-26 21:31:24,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:31:24,761 INFO L93 Difference]: Finished difference Result 16658 states and 50377 transitions. [2019-12-26 21:31:24,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:31:24,761 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-26 21:31:24,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:31:24,791 INFO L225 Difference]: With dead ends: 16658 [2019-12-26 21:31:24,791 INFO L226 Difference]: Without dead ends: 16658 [2019-12-26 21:31:24,792 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:31:24,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16658 states. [2019-12-26 21:31:25,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16658 to 14885. [2019-12-26 21:31:25,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14885 states. [2019-12-26 21:31:25,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14885 states to 14885 states and 44998 transitions. [2019-12-26 21:31:25,203 INFO L78 Accepts]: Start accepts. Automaton has 14885 states and 44998 transitions. Word has length 66 [2019-12-26 21:31:25,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:31:25,203 INFO L462 AbstractCegarLoop]: Abstraction has 14885 states and 44998 transitions. [2019-12-26 21:31:25,203 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:31:25,204 INFO L276 IsEmpty]: Start isEmpty. Operand 14885 states and 44998 transitions. [2019-12-26 21:31:25,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 21:31:25,230 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:31:25,230 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:31:25,230 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:31:25,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:31:25,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1169670237, now seen corresponding path program 1 times [2019-12-26 21:31:25,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:31:25,231 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475053559] [2019-12-26 21:31:25,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:31:25,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:31:25,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:31:25,420 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475053559] [2019-12-26 21:31:25,420 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:31:25,420 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 21:31:25,420 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69761846] [2019-12-26 21:31:25,422 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-26 21:31:25,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:31:25,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-26 21:31:25,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-26 21:31:25,423 INFO L87 Difference]: Start difference. First operand 14885 states and 44998 transitions. Second operand 10 states. [2019-12-26 21:31:27,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:31:27,320 INFO L93 Difference]: Finished difference Result 29142 states and 87718 transitions. [2019-12-26 21:31:27,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-26 21:31:27,320 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-26 21:31:27,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:31:27,351 INFO L225 Difference]: With dead ends: 29142 [2019-12-26 21:31:27,352 INFO L226 Difference]: Without dead ends: 22175 [2019-12-26 21:31:27,352 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=368, Unknown=0, NotChecked=0, Total=462 [2019-12-26 21:31:27,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22175 states. [2019-12-26 21:31:27,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22175 to 15452. [2019-12-26 21:31:27,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15452 states. [2019-12-26 21:31:27,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15452 states to 15452 states and 46479 transitions. [2019-12-26 21:31:27,639 INFO L78 Accepts]: Start accepts. Automaton has 15452 states and 46479 transitions. Word has length 67 [2019-12-26 21:31:27,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:31:27,640 INFO L462 AbstractCegarLoop]: Abstraction has 15452 states and 46479 transitions. [2019-12-26 21:31:27,640 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-26 21:31:27,640 INFO L276 IsEmpty]: Start isEmpty. Operand 15452 states and 46479 transitions. [2019-12-26 21:31:27,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 21:31:27,656 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:31:27,656 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:31:27,657 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:31:27,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:31:27,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1087519045, now seen corresponding path program 2 times [2019-12-26 21:31:27,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:31:27,657 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864674172] [2019-12-26 21:31:27,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:31:27,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:31:27,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:31:27,822 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864674172] [2019-12-26 21:31:27,822 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:31:27,823 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 21:31:27,823 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931089932] [2019-12-26 21:31:27,823 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 21:31:27,823 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:31:27,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 21:31:27,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-26 21:31:27,824 INFO L87 Difference]: Start difference. First operand 15452 states and 46479 transitions. Second operand 11 states. [2019-12-26 21:31:29,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:31:29,730 INFO L93 Difference]: Finished difference Result 27054 states and 80709 transitions. [2019-12-26 21:31:29,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-26 21:31:29,731 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-26 21:31:29,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:31:29,763 INFO L225 Difference]: With dead ends: 27054 [2019-12-26 21:31:29,763 INFO L226 Difference]: Without dead ends: 22627 [2019-12-26 21:31:29,764 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2019-12-26 21:31:29,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22627 states. [2019-12-26 21:31:30,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22627 to 15472. [2019-12-26 21:31:30,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15472 states. [2019-12-26 21:31:30,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15472 states to 15472 states and 46334 transitions. [2019-12-26 21:31:30,059 INFO L78 Accepts]: Start accepts. Automaton has 15472 states and 46334 transitions. Word has length 67 [2019-12-26 21:31:30,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:31:30,060 INFO L462 AbstractCegarLoop]: Abstraction has 15472 states and 46334 transitions. [2019-12-26 21:31:30,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 21:31:30,060 INFO L276 IsEmpty]: Start isEmpty. Operand 15472 states and 46334 transitions. [2019-12-26 21:31:30,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 21:31:30,075 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:31:30,075 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:31:30,076 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:31:30,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:31:30,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1951872541, now seen corresponding path program 3 times [2019-12-26 21:31:30,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:31:30,076 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745008065] [2019-12-26 21:31:30,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:31:30,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:31:30,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:31:30,263 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745008065] [2019-12-26 21:31:30,263 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:31:30,263 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 21:31:30,263 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656130169] [2019-12-26 21:31:30,264 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 21:31:30,264 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:31:30,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 21:31:30,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-26 21:31:30,264 INFO L87 Difference]: Start difference. First operand 15472 states and 46334 transitions. Second operand 11 states. [2019-12-26 21:31:31,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:31:31,351 INFO L93 Difference]: Finished difference Result 34544 states and 103297 transitions. [2019-12-26 21:31:31,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-26 21:31:31,352 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-26 21:31:31,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:31:31,393 INFO L225 Difference]: With dead ends: 34544 [2019-12-26 21:31:31,393 INFO L226 Difference]: Without dead ends: 31968 [2019-12-26 21:31:31,393 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=802, Unknown=0, NotChecked=0, Total=992 [2019-12-26 21:31:31,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31968 states. [2019-12-26 21:31:31,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31968 to 17824. [2019-12-26 21:31:31,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17824 states. [2019-12-26 21:31:31,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17824 states to 17824 states and 52962 transitions. [2019-12-26 21:31:31,753 INFO L78 Accepts]: Start accepts. Automaton has 17824 states and 52962 transitions. Word has length 67 [2019-12-26 21:31:31,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:31:31,753 INFO L462 AbstractCegarLoop]: Abstraction has 17824 states and 52962 transitions. [2019-12-26 21:31:31,753 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 21:31:31,753 INFO L276 IsEmpty]: Start isEmpty. Operand 17824 states and 52962 transitions. [2019-12-26 21:31:31,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 21:31:31,771 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:31:31,771 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:31:31,771 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:31:31,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:31:31,771 INFO L82 PathProgramCache]: Analyzing trace with hash 1574036275, now seen corresponding path program 4 times [2019-12-26 21:31:31,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:31:31,772 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224216151] [2019-12-26 21:31:31,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:31:31,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:31:31,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:31:31,959 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224216151] [2019-12-26 21:31:31,960 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:31:31,960 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 21:31:31,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590995020] [2019-12-26 21:31:31,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 21:31:31,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:31:31,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 21:31:31,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-26 21:31:31,961 INFO L87 Difference]: Start difference. First operand 17824 states and 52962 transitions. Second operand 11 states. [2019-12-26 21:31:32,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:31:32,939 INFO L93 Difference]: Finished difference Result 32531 states and 96351 transitions. [2019-12-26 21:31:32,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-26 21:31:32,939 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-26 21:31:32,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:31:32,975 INFO L225 Difference]: With dead ends: 32531 [2019-12-26 21:31:32,975 INFO L226 Difference]: Without dead ends: 26565 [2019-12-26 21:31:32,976 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2019-12-26 21:31:33,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26565 states. [2019-12-26 21:31:33,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26565 to 14447. [2019-12-26 21:31:33,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14447 states. [2019-12-26 21:31:33,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14447 states to 14447 states and 43240 transitions. [2019-12-26 21:31:33,271 INFO L78 Accepts]: Start accepts. Automaton has 14447 states and 43240 transitions. Word has length 67 [2019-12-26 21:31:33,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:31:33,271 INFO L462 AbstractCegarLoop]: Abstraction has 14447 states and 43240 transitions. [2019-12-26 21:31:33,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 21:31:33,271 INFO L276 IsEmpty]: Start isEmpty. Operand 14447 states and 43240 transitions. [2019-12-26 21:31:33,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 21:31:33,285 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:31:33,286 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:31:33,286 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:31:33,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:31:33,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1709159453, now seen corresponding path program 5 times [2019-12-26 21:31:33,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:31:33,286 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644622437] [2019-12-26 21:31:33,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:31:33,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:31:33,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:31:33,474 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644622437] [2019-12-26 21:31:33,474 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:31:33,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-26 21:31:33,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100914669] [2019-12-26 21:31:33,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-26 21:31:33,475 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:31:33,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-26 21:31:33,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-26 21:31:33,475 INFO L87 Difference]: Start difference. First operand 14447 states and 43240 transitions. Second operand 12 states. [2019-12-26 21:31:34,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:31:34,443 INFO L93 Difference]: Finished difference Result 26524 states and 79422 transitions. [2019-12-26 21:31:34,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-26 21:31:34,444 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-26 21:31:34,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:31:34,478 INFO L225 Difference]: With dead ends: 26524 [2019-12-26 21:31:34,478 INFO L226 Difference]: Without dead ends: 26097 [2019-12-26 21:31:34,478 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-26 21:31:34,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26097 states. [2019-12-26 21:31:34,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26097 to 14187. [2019-12-26 21:31:34,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14187 states. [2019-12-26 21:31:34,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14187 states to 14187 states and 42578 transitions. [2019-12-26 21:31:34,766 INFO L78 Accepts]: Start accepts. Automaton has 14187 states and 42578 transitions. Word has length 67 [2019-12-26 21:31:34,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:31:34,766 INFO L462 AbstractCegarLoop]: Abstraction has 14187 states and 42578 transitions. [2019-12-26 21:31:34,767 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-26 21:31:34,767 INFO L276 IsEmpty]: Start isEmpty. Operand 14187 states and 42578 transitions. [2019-12-26 21:31:34,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 21:31:34,781 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:31:34,781 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:31:34,781 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:31:34,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:31:34,781 INFO L82 PathProgramCache]: Analyzing trace with hash 656134515, now seen corresponding path program 6 times [2019-12-26 21:31:34,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:31:34,782 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228541206] [2019-12-26 21:31:34,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:31:34,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 21:31:34,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 21:31:34,888 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 21:31:34,888 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 21:31:34,892 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [900] [900] ULTIMATE.startENTRY-->L835: Formula: (let ((.cse0 (store |v_#valid_72| 0 0))) (and (= v_~a$r_buff1_thd0~0_203 0) (= 0 v_~a$r_buff1_thd1~0_191) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t287~0.base_37| 4)) (= v_~z~0_36 0) (= v_~a$r_buff0_thd0~0_228 0) (= 0 v_~a$r_buff0_thd1~0_317) (= 0 v_~a$read_delayed_var~0.base_8) (= (select .cse0 |v_ULTIMATE.start_main_~#t287~0.base_37|) 0) (= 0 v_~a$r_buff0_thd2~0_205) (= v_~main$tmp_guard1~0_42 0) (= v_~a$r_buff0_thd3~0_430 0) (= v_~main$tmp_guard0~0_25 0) (= 0 v_~__unbuffered_p2_EAX~0_47) (= v_~__unbuffered_cnt~0_111 0) (< 0 |v_#StackHeapBarrier_15|) (= 0 v_~x~0_176) (= v_~__unbuffered_p1_EBX~0_55 0) (= 0 v_~__unbuffered_p1_EAX~0_54) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t287~0.base_37| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t287~0.base_37|) |v_ULTIMATE.start_main_~#t287~0.offset_26| 0)) |v_#memory_int_23|) (= 0 |v_#NULL.base_4|) (= v_~a$mem_tmp~0_16 0) (= 0 v_~a$w_buff0_used~0_889) (= v_~a$w_buff0~0_416 0) (= v_~a$r_buff1_thd3~0_333 0) (= 0 v_~a$w_buff1_used~0_596) (= |v_#NULL.offset_4| 0) (= 0 v_~a$w_buff1~0_333) (= 0 v_~a$r_buff1_thd2~0_185) (= v_~a~0_191 0) (= |v_#valid_70| (store .cse0 |v_ULTIMATE.start_main_~#t287~0.base_37| 1)) (= v_~a$read_delayed_var~0.offset_8 0) (= v_~__unbuffered_p2_EBX~0_48 0) (= 0 v_~weak$$choice0~0_13) (= v_~weak$$choice2~0_131 0) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t287~0.base_37|) (= v_~y~0_31 0) (= 0 v_~a$read_delayed~0_8) (= |v_ULTIMATE.start_main_~#t287~0.offset_26| 0) (= v_~a$flush_delayed~0_26 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_~#t288~0.base=|v_ULTIMATE.start_main_~#t288~0.base_38|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_185, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_51|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_59|, ULTIMATE.start_main_~#t288~0.offset=|v_ULTIMATE.start_main_~#t288~0.offset_26|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_228, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_127|, ~a~0=v_~a~0_191, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_83|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_54, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_47, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_48, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_333, ULTIMATE.start_main_~#t289~0.base=|v_ULTIMATE.start_main_~#t289~0.base_30|, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_889, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_317, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_8, ~a$w_buff0~0=v_~a$w_buff0~0_416, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_203, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_111, ~x~0=v_~x~0_176, ~a$read_delayed~0=v_~a$read_delayed~0_8, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_205, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_42, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_67|, ~a$mem_tmp~0=v_~a$mem_tmp~0_16, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_43|, ~a$w_buff1~0=v_~a$w_buff1~0_333, ULTIMATE.start_main_~#t287~0.offset=|v_ULTIMATE.start_main_~#t287~0.offset_26|, ~y~0=v_~y~0_31, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_55, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_23|, ULTIMATE.start_main_~#t289~0.offset=|v_ULTIMATE.start_main_~#t289~0.offset_18|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_191, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_430, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_25, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_~#t287~0.base=|v_ULTIMATE.start_main_~#t287~0.base_37|, ~a$flush_delayed~0=v_~a$flush_delayed~0_26, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_25|, #valid=|v_#valid_70|, #memory_int=|v_#memory_int_23|, ~z~0=v_~z~0_36, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_596, ~weak$$choice2~0=v_~weak$$choice2~0_131, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t288~0.base, ~a$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_~#t288~0.offset, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite50, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~a$r_buff1_thd3~0, ULTIMATE.start_main_~#t289~0.base, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~weak$$choice0~0, ~a$read_delayed_var~0.offset, ~a$w_buff0~0, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ~x~0, ~a$read_delayed~0, ~a$r_buff0_thd2~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~a$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~a$w_buff1~0, ULTIMATE.start_main_~#t287~0.offset, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_~#t289~0.offset, ULTIMATE.start_main_#t~nondet44, ~a$r_buff1_thd1~0, ~a$r_buff0_thd3~0, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_~#t287~0.base, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~a$read_delayed_var~0.base] because there is no mapped edge [2019-12-26 21:31:34,893 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L835-1-->L837: Formula: (and (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t288~0.base_13|) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t288~0.base_13| 4) |v_#length_17|) (= |v_ULTIMATE.start_main_~#t288~0.offset_11| 0) (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t288~0.base_13|)) (= (store |v_#valid_41| |v_ULTIMATE.start_main_~#t288~0.base_13| 1) |v_#valid_40|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t288~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t288~0.base_13|) |v_ULTIMATE.start_main_~#t288~0.offset_11| 1)) |v_#memory_int_15|) (not (= |v_ULTIMATE.start_main_~#t288~0.base_13| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t288~0.base=|v_ULTIMATE.start_main_~#t288~0.base_13|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|, ULTIMATE.start_main_~#t288~0.offset=|v_ULTIMATE.start_main_~#t288~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t288~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t288~0.offset] because there is no mapped edge [2019-12-26 21:31:34,895 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L4-->L750: Formula: (and (= v_~a$r_buff0_thd1~0_28 v_~a$r_buff1_thd1~0_23) (= v_~a$r_buff0_thd2~0_20 v_~a$r_buff1_thd2~0_16) (= v_~a$r_buff0_thd0~0_18 v_~a$r_buff1_thd0~0_17) (not (= v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_10 0)) (= v_~a$r_buff0_thd1~0_27 1) (= 1 v_~x~0_7) (= v_~a$r_buff0_thd3~0_73 v_~a$r_buff1_thd3~0_40)) InVars {~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_20, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_73, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_10, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_28, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_18} OutVars{~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_23, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_40, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_16, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_20, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_17, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_73, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_10, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_27, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_18, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~a$r_buff1_thd1~0, ~a$r_buff1_thd3~0, ~a$r_buff1_thd2~0, ~a$r_buff1_thd0~0, ~a$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-26 21:31:34,897 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L776-2-->L776-4: Formula: (let ((.cse0 (= (mod ~a$r_buff1_thd2~0_In196435051 256) 0)) (.cse1 (= (mod ~a$w_buff1_used~0_In196435051 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite9_Out196435051| ~a$w_buff1~0_In196435051)) (and (= |P1Thread1of1ForFork2_#t~ite9_Out196435051| ~a~0_In196435051) (or .cse0 .cse1)))) InVars {~a~0=~a~0_In196435051, ~a$w_buff1~0=~a$w_buff1~0_In196435051, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In196435051, ~a$w_buff1_used~0=~a$w_buff1_used~0_In196435051} OutVars{~a~0=~a~0_In196435051, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out196435051|, ~a$w_buff1~0=~a$w_buff1~0_In196435051, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In196435051, ~a$w_buff1_used~0=~a$w_buff1_used~0_In196435051} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-26 21:31:34,898 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L776-4-->L777: Formula: (= |v_P1Thread1of1ForFork2_#t~ite9_16| v_~a~0_47) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_16|} OutVars{~a~0=v_~a~0_47, P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_15|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_25|} AuxVars[] AssignedVars[~a~0, P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-26 21:31:34,898 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L751-->L751-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In-1733175254 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1733175254 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork1_#t~ite5_Out-1733175254| ~a$w_buff0_used~0_In-1733175254)) (and (not .cse0) (= |P0Thread1of1ForFork1_#t~ite5_Out-1733175254| 0) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1733175254, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1733175254} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-1733175254|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1733175254, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1733175254} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-26 21:31:34,899 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L752-->L752-2: Formula: (let ((.cse3 (= (mod ~a$r_buff1_thd1~0_In-512266728 256) 0)) (.cse2 (= (mod ~a$w_buff1_used~0_In-512266728 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-512266728 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In-512266728 256)))) (or (and (= |P0Thread1of1ForFork1_#t~ite6_Out-512266728| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P0Thread1of1ForFork1_#t~ite6_Out-512266728| ~a$w_buff1_used~0_In-512266728) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-512266728, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-512266728, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-512266728, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-512266728} OutVars{P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-512266728|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-512266728, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-512266728, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-512266728, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-512266728} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-26 21:31:34,900 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L753-->L754: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In800831541 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In800831541 256)))) (or (and (not .cse0) (= 0 ~a$r_buff0_thd1~0_Out800831541) (not .cse1)) (and (or .cse1 .cse0) (= ~a$r_buff0_thd1~0_In800831541 ~a$r_buff0_thd1~0_Out800831541)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In800831541, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In800831541} OutVars{P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out800831541|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In800831541, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out800831541} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-26 21:31:34,900 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L754-->L754-2: Formula: (let ((.cse3 (= 0 (mod ~a$w_buff1_used~0_In1908922775 256))) (.cse2 (= 0 (mod ~a$r_buff1_thd1~0_In1908922775 256))) (.cse1 (= (mod ~a$r_buff0_thd1~0_In1908922775 256) 0)) (.cse0 (= (mod ~a$w_buff0_used~0_In1908922775 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork1_#t~ite8_Out1908922775|)) (and (= ~a$r_buff1_thd1~0_In1908922775 |P0Thread1of1ForFork1_#t~ite8_Out1908922775|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1908922775, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1908922775, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1908922775, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1908922775} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out1908922775|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1908922775, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1908922775, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1908922775, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1908922775} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-26 21:31:34,900 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L754-2-->P0EXIT: Formula: (and (= v_~a$r_buff1_thd1~0_148 |v_P0Thread1of1ForFork1_#t~ite8_52|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_77 (+ v_~__unbuffered_cnt~0_78 1))) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_52|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_51|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_148, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~a$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-26 21:31:34,900 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [861] [861] L837-1-->L839: Formula: (and (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t289~0.base_12| 1)) (= |v_ULTIMATE.start_main_~#t289~0.offset_10| 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t289~0.base_12| 4)) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t289~0.base_12|)) (not (= 0 |v_ULTIMATE.start_main_~#t289~0.base_12|)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t289~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t289~0.base_12|) |v_ULTIMATE.start_main_~#t289~0.offset_10| 2)) |v_#memory_int_13|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t289~0.base_12|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t289~0.offset=|v_ULTIMATE.start_main_~#t289~0.offset_10|, #valid=|v_#valid_36|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_6|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t289~0.base=|v_ULTIMATE.start_main_~#t289~0.base_12|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t289~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t289~0.base, #length] because there is no mapped edge [2019-12-26 21:31:34,904 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [876] [876] L801-->L801-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1838480668 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite21_Out1838480668| ~a$w_buff0~0_In1838480668) (= |P2Thread1of1ForFork0_#t~ite20_In1838480668| |P2Thread1of1ForFork0_#t~ite20_Out1838480668|)) (and (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In1838480668 256)))) (or (and .cse1 (= (mod ~a$w_buff1_used~0_In1838480668 256) 0)) (and .cse1 (= (mod ~a$r_buff1_thd3~0_In1838480668 256) 0)) (= 0 (mod ~a$w_buff0_used~0_In1838480668 256)))) .cse0 (= ~a$w_buff0~0_In1838480668 |P2Thread1of1ForFork0_#t~ite20_Out1838480668|) (= |P2Thread1of1ForFork0_#t~ite21_Out1838480668| |P2Thread1of1ForFork0_#t~ite20_Out1838480668|)))) InVars {~a$w_buff0~0=~a$w_buff0~0_In1838480668, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1838480668, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1838480668, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1838480668, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1838480668, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In1838480668|, ~weak$$choice2~0=~weak$$choice2~0_In1838480668} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out1838480668|, ~a$w_buff0~0=~a$w_buff0~0_In1838480668, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1838480668, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1838480668, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1838480668, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out1838480668|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1838480668, ~weak$$choice2~0=~weak$$choice2~0_In1838480668} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-26 21:31:34,907 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L803-->L803-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1510058388 256)))) (or (and (= ~a$w_buff0_used~0_In1510058388 |P2Thread1of1ForFork0_#t~ite27_Out1510058388|) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite26_In1510058388| |P2Thread1of1ForFork0_#t~ite26_Out1510058388|)) (and .cse0 (= |P2Thread1of1ForFork0_#t~ite26_Out1510058388| |P2Thread1of1ForFork0_#t~ite27_Out1510058388|) (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In1510058388 256) 0))) (or (and .cse1 (= 0 (mod ~a$w_buff1_used~0_In1510058388 256))) (= 0 (mod ~a$w_buff0_used~0_In1510058388 256)) (and .cse1 (= 0 (mod ~a$r_buff1_thd3~0_In1510058388 256))))) (= ~a$w_buff0_used~0_In1510058388 |P2Thread1of1ForFork0_#t~ite26_Out1510058388|)))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In1510058388|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1510058388, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1510058388, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1510058388, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1510058388, ~weak$$choice2~0=~weak$$choice2~0_In1510058388} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out1510058388|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out1510058388|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1510058388, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1510058388, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1510058388, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1510058388, ~weak$$choice2~0=~weak$$choice2~0_In1510058388} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-26 21:31:34,908 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L804-->L804-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-84606778 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite30_Out-84606778| ~a$w_buff1_used~0_In-84606778) (= |P2Thread1of1ForFork0_#t~ite29_In-84606778| |P2Thread1of1ForFork0_#t~ite29_Out-84606778|) (not .cse0)) (and (= |P2Thread1of1ForFork0_#t~ite29_Out-84606778| ~a$w_buff1_used~0_In-84606778) .cse0 (= |P2Thread1of1ForFork0_#t~ite30_Out-84606778| |P2Thread1of1ForFork0_#t~ite29_Out-84606778|) (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In-84606778 256) 0))) (or (and .cse1 (= (mod ~a$r_buff1_thd3~0_In-84606778 256) 0)) (and .cse1 (= 0 (mod ~a$w_buff1_used~0_In-84606778 256))) (= (mod ~a$w_buff0_used~0_In-84606778 256) 0)))))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-84606778, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-84606778, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-84606778, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-84606778, ~weak$$choice2~0=~weak$$choice2~0_In-84606778, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_In-84606778|} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-84606778, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-84606778, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-84606778, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out-84606778|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-84606778, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out-84606778|, ~weak$$choice2~0=~weak$$choice2~0_In-84606778} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-26 21:31:34,909 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [813] [813] L805-->L806: Formula: (and (not (= (mod v_~weak$$choice2~0_32 256) 0)) (= v_~a$r_buff0_thd3~0_136 v_~a$r_buff0_thd3~0_135)) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_136, ~weak$$choice2~0=v_~weak$$choice2~0_32} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_9|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_11|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_135, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_12|, ~weak$$choice2~0=v_~weak$$choice2~0_32} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-26 21:31:34,910 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [796] [796] L808-->L812: Formula: (and (= v_~a$flush_delayed~0_12 0) (= v_~a~0_57 v_~a$mem_tmp~0_6) (not (= (mod v_~a$flush_delayed~0_13 256) 0))) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_6, ~a$flush_delayed~0=v_~a$flush_delayed~0_13} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_13|, ~a~0=v_~a~0_57, ~a$mem_tmp~0=v_~a$mem_tmp~0_6, ~a$flush_delayed~0=v_~a$flush_delayed~0_12} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~a~0, ~a$flush_delayed~0] because there is no mapped edge [2019-12-26 21:31:34,911 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [822] [822] L812-2-->L812-4: Formula: (let ((.cse1 (= (mod ~a$r_buff1_thd3~0_In-942477542 256) 0)) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In-942477542 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite38_Out-942477542| ~a$w_buff1~0_In-942477542)) (and (= |P2Thread1of1ForFork0_#t~ite38_Out-942477542| ~a~0_In-942477542) (or .cse1 .cse0)))) InVars {~a~0=~a~0_In-942477542, ~a$w_buff1~0=~a$w_buff1~0_In-942477542, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-942477542, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-942477542} OutVars{~a~0=~a~0_In-942477542, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out-942477542|, ~a$w_buff1~0=~a$w_buff1~0_In-942477542, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-942477542, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-942477542} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-26 21:31:34,912 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L812-4-->L813: Formula: (= v_~a~0_20 |v_P2Thread1of1ForFork0_#t~ite38_10|) InVars {P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_10|} OutVars{~a~0=v_~a~0_20, P2Thread1of1ForFork0_#t~ite39=|v_P2Thread1of1ForFork0_#t~ite39_13|, P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_9|} AuxVars[] AssignedVars[~a~0, P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-26 21:31:34,912 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L813-->L813-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In1141933146 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In1141933146 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite40_Out1141933146| 0) (not .cse1)) (and (or .cse1 .cse0) (= ~a$w_buff0_used~0_In1141933146 |P2Thread1of1ForFork0_#t~ite40_Out1141933146|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1141933146, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1141933146} OutVars{P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out1141933146|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1141933146, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1141933146} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-26 21:31:34,913 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L814-->L814-2: Formula: (let ((.cse3 (= 0 (mod ~a$w_buff1_used~0_In-515522677 256))) (.cse2 (= (mod ~a$r_buff1_thd3~0_In-515522677 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-515522677 256))) (.cse1 (= (mod ~a$r_buff0_thd3~0_In-515522677 256) 0))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite41_Out-515522677|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~a$w_buff1_used~0_In-515522677 |P2Thread1of1ForFork0_#t~ite41_Out-515522677|) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-515522677, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-515522677, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-515522677, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-515522677} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-515522677, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-515522677, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-515522677, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-515522677, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-515522677|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-26 21:31:34,914 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L815-->L815-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In1844593704 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In1844593704 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite42_Out1844593704| ~a$r_buff0_thd3~0_In1844593704)) (and (= 0 |P2Thread1of1ForFork0_#t~ite42_Out1844593704|) (not .cse1) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1844593704, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1844593704} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In1844593704, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1844593704, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out1844593704|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-26 21:31:34,915 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L816-->L816-2: Formula: (let ((.cse1 (= (mod ~a$r_buff1_thd3~0_In-1544631920 256) 0)) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In-1544631920 256))) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In-1544631920 256))) (.cse3 (= 0 (mod ~a$r_buff0_thd3~0_In-1544631920 256)))) (or (and (= ~a$r_buff1_thd3~0_In-1544631920 |P2Thread1of1ForFork0_#t~ite43_Out-1544631920|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite43_Out-1544631920| 0)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1544631920, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1544631920, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1544631920, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1544631920} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-1544631920|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1544631920, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1544631920, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1544631920, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1544631920} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-26 21:31:34,915 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L816-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= (+ v_~__unbuffered_cnt~0_48 1) v_~__unbuffered_cnt~0_47) (= v_~a$r_buff1_thd3~0_122 |v_P2Thread1of1ForFork0_#t~ite43_34|)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_33|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_122, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~a$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-26 21:31:34,915 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L777-->L777-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In-240449765 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In-240449765 256) 0))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite11_Out-240449765|) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork2_#t~ite11_Out-240449765| ~a$w_buff0_used~0_In-240449765) (or .cse1 .cse0)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-240449765, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-240449765} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-240449765, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-240449765, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-240449765|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-26 21:31:34,916 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L778-->L778-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff1_thd2~0_In-596614709 256))) (.cse1 (= (mod ~a$w_buff1_used~0_In-596614709 256) 0)) (.cse2 (= (mod ~a$w_buff0_used~0_In-596614709 256) 0)) (.cse3 (= (mod ~a$r_buff0_thd2~0_In-596614709 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork2_#t~ite12_Out-596614709|)) (and (= ~a$w_buff1_used~0_In-596614709 |P1Thread1of1ForFork2_#t~ite12_Out-596614709|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-596614709, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-596614709, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-596614709, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-596614709} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-596614709, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-596614709, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-596614709, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-596614709|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-596614709} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-26 21:31:34,917 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L779-->L779-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd2~0_In-1393108015 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1393108015 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite13_Out-1393108015| ~a$r_buff0_thd2~0_In-1393108015)) (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite13_Out-1393108015| 0) (not .cse1)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1393108015, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1393108015} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1393108015, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1393108015, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-1393108015|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-26 21:31:34,918 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L780-->L780-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff1_thd2~0_In1842233584 256))) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In1842233584 256))) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In1842233584 256))) (.cse3 (= 0 (mod ~a$r_buff0_thd2~0_In1842233584 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite14_Out1842233584| 0)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork2_#t~ite14_Out1842233584| ~a$r_buff1_thd2~0_In1842233584) (or .cse2 .cse3)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1842233584, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1842233584, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1842233584, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1842233584} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1842233584, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1842233584, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1842233584, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1842233584, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out1842233584|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-26 21:31:34,918 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [855] [855] L780-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#t~ite14_24| v_~a$r_buff1_thd2~0_79) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_54 1) v_~__unbuffered_cnt~0_53) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_24|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_79, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_53, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_23|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-26 21:31:34,919 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L839-1-->L845: Formula: (and (= 3 v_~__unbuffered_cnt~0_13) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-26 21:31:34,920 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L845-2-->L845-4: Formula: (let ((.cse1 (= (mod ~a$w_buff1_used~0_In-188480637 256) 0)) (.cse0 (= 0 (mod ~a$r_buff1_thd0~0_In-188480637 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite47_Out-188480637| ~a~0_In-188480637)) (and (not .cse1) (= ~a$w_buff1~0_In-188480637 |ULTIMATE.start_main_#t~ite47_Out-188480637|) (not .cse0)))) InVars {~a~0=~a~0_In-188480637, ~a$w_buff1~0=~a$w_buff1~0_In-188480637, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-188480637, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-188480637} OutVars{~a~0=~a~0_In-188480637, ~a$w_buff1~0=~a$w_buff1~0_In-188480637, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-188480637|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-188480637, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-188480637} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-26 21:31:34,920 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L845-4-->L846: Formula: (= v_~a~0_30 |v_ULTIMATE.start_main_#t~ite47_13|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_13|} OutVars{~a~0=v_~a~0_30, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_12|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_16|} AuxVars[] AssignedVars[~a~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-26 21:31:34,920 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L846-->L846-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In-56440358 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In-56440358 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite49_Out-56440358| ~a$w_buff0_used~0_In-56440358) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite49_Out-56440358| 0) (not .cse0) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-56440358, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-56440358} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-56440358, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-56440358|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-56440358} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-26 21:31:34,921 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L847-->L847-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In1303887060 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In1303887060 256))) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In1303887060 256))) (.cse3 (= (mod ~a$r_buff1_thd0~0_In1303887060 256) 0))) (or (and (= ~a$w_buff1_used~0_In1303887060 |ULTIMATE.start_main_#t~ite50_Out1303887060|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite50_Out1303887060| 0)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1303887060, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1303887060, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1303887060, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1303887060} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out1303887060|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1303887060, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1303887060, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1303887060, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1303887060} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-26 21:31:34,922 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L848-->L848-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd0~0_In559560503 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In559560503 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite51_Out559560503|) (not .cse1)) (and (= ~a$r_buff0_thd0~0_In559560503 |ULTIMATE.start_main_#t~ite51_Out559560503|) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In559560503, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In559560503} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out559560503|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In559560503, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In559560503} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-26 21:31:34,923 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L849-->L849-2: Formula: (let ((.cse3 (= (mod ~a$r_buff0_thd0~0_In338997185 256) 0)) (.cse2 (= (mod ~a$w_buff0_used~0_In338997185 256) 0)) (.cse0 (= (mod ~a$r_buff1_thd0~0_In338997185 256) 0)) (.cse1 (= (mod ~a$w_buff1_used~0_In338997185 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite52_Out338997185| 0)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite52_Out338997185| ~a$r_buff1_thd0~0_In338997185)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In338997185, ~a$w_buff0_used~0=~a$w_buff0_used~0_In338997185, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In338997185, ~a$w_buff1_used~0=~a$w_buff1_used~0_In338997185} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out338997185|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In338997185, ~a$w_buff0_used~0=~a$w_buff0_used~0_In338997185, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In338997185, ~a$w_buff1_used~0=~a$w_buff1_used~0_In338997185} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-26 21:31:34,923 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [887] [887] L849-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 1 v_~__unbuffered_p2_EAX~0_21) (= v_~main$tmp_guard1~0_18 0) (= 1 v_~__unbuffered_p1_EAX~0_20) (= v_~a$r_buff1_thd0~0_158 |v_ULTIMATE.start_main_#t~ite52_40|) (= 2 v_~x~0_125) (= v_~__unbuffered_p1_EBX~0_21 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_14| (mod v_~main$tmp_guard1~0_18 256)) (= v_~__unbuffered_p2_EBX~0_24 0)) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_40|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_21, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_24, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21, ~x~0=v_~x~0_125} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_39|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_18, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_21, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_24, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_20, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_158, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21, ~x~0=v_~x~0_125, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_14|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-26 21:31:35,014 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 09:31:35 BasicIcfg [2019-12-26 21:31:35,014 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 21:31:35,016 INFO L168 Benchmark]: Toolchain (without parser) took 110788.12 ms. Allocated memory was 139.5 MB in the beginning and 2.8 GB in the end (delta: 2.7 GB). Free memory was 102.6 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2019-12-26 21:31:35,016 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 139.5 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-26 21:31:35,017 INFO L168 Benchmark]: CACSL2BoogieTranslator took 730.22 ms. Allocated memory was 139.5 MB in the beginning and 204.5 MB in the end (delta: 65.0 MB). Free memory was 102.4 MB in the beginning and 157.7 MB in the end (delta: -55.3 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. [2019-12-26 21:31:35,017 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.78 ms. Allocated memory is still 204.5 MB. Free memory was 157.7 MB in the beginning and 155.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-26 21:31:35,018 INFO L168 Benchmark]: Boogie Preprocessor took 41.04 ms. Allocated memory is still 204.5 MB. Free memory was 155.1 MB in the beginning and 152.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-26 21:31:35,018 INFO L168 Benchmark]: RCFGBuilder took 835.05 ms. Allocated memory is still 204.5 MB. Free memory was 152.4 MB in the beginning and 102.0 MB in the end (delta: 50.4 MB). Peak memory consumption was 50.4 MB. Max. memory is 7.1 GB. [2019-12-26 21:31:35,019 INFO L168 Benchmark]: TraceAbstraction took 109116.72 ms. Allocated memory was 204.5 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 101.3 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-12-26 21:31:35,021 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.20 ms. Allocated memory is still 139.5 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 730.22 ms. Allocated memory was 139.5 MB in the beginning and 204.5 MB in the end (delta: 65.0 MB). Free memory was 102.4 MB in the beginning and 157.7 MB in the end (delta: -55.3 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 59.78 ms. Allocated memory is still 204.5 MB. Free memory was 157.7 MB in the beginning and 155.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.04 ms. Allocated memory is still 204.5 MB. Free memory was 155.1 MB in the beginning and 152.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 835.05 ms. Allocated memory is still 204.5 MB. Free memory was 152.4 MB in the beginning and 102.0 MB in the end (delta: 50.4 MB). Peak memory consumption was 50.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 109116.72 ms. Allocated memory was 204.5 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 101.3 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.4s, 178 ProgramPointsBefore, 94 ProgramPointsAfterwards, 215 TransitionsBefore, 103 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 8 FixpointIterations, 35 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 30 ConcurrentYvCompositions, 32 ChoiceCompositions, 7568 VarBasedMoverChecksPositive, 290 VarBasedMoverChecksNegative, 97 SemBasedMoverChecksPositive, 263 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 0 MoverChecksTotal, 90866 CheckedPairsTotal, 114 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L835] FCALL, FORK 0 pthread_create(&t287, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L837] FCALL, FORK 0 pthread_create(&t288, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L735] 1 a$w_buff1 = a$w_buff0 [L736] 1 a$w_buff0 = 1 [L737] 1 a$w_buff1_used = a$w_buff0_used [L738] 1 a$w_buff0_used = (_Bool)1 [L750] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L764] 2 x = 2 [L767] 2 y = 1 [L770] 2 __unbuffered_p1_EAX = y [L773] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L776] 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L750] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L751] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L752] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L839] FCALL, FORK 0 pthread_create(&t289, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=2, y=1, z=0] [L790] 3 z = 1 [L793] 3 __unbuffered_p2_EAX = z [L796] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L797] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L798] 3 a$flush_delayed = weak$$choice2 [L799] 3 a$mem_tmp = a VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, 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=2, y=1, z=1] [L800] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1)=0, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, 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=2, y=1, z=1] [L800] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L801] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L802] EXPR 3 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, 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 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1))=0, x=2, y=1, z=1] [L802] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L803] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L804] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L806] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, 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 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=1] [L806] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L807] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, 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=2, y=1, z=1] [L812] 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, 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=2, y=1, z=1] [L813] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L814] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L815] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L777] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L778] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L779] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L845] 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, 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=2, y=1, z=1] [L846] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L847] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L848] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 169 locations, 2 error locations. Result: UNSAFE, OverallTime: 108.7s, OverallIterations: 29, TraceHistogramMax: 1, AutomataDifference: 32.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7583 SDtfs, 10336 SDslu, 29329 SDs, 0 SdLazy, 13027 SolverSat, 438 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 398 GetRequests, 49 SyntacticMatches, 13 SemanticMatches, 336 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1631 ImplicationChecksByTransitivity, 4.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=162755occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 43.5s AutomataMinimizationTime, 28 MinimizatonAttempts, 322412 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 1444 NumberOfCodeBlocks, 1444 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 1349 ConstructedInterpolants, 0 QuantifiedInterpolants, 265509 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 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...