/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix002_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 15:31:12,834 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 15:31:12,836 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 15:31:12,851 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 15:31:12,851 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 15:31:12,853 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 15:31:12,855 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 15:31:12,865 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 15:31:12,869 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 15:31:12,872 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 15:31:12,875 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 15:31:12,877 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 15:31:12,878 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 15:31:12,880 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 15:31:12,882 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 15:31:12,884 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 15:31:12,885 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 15:31:12,886 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 15:31:12,888 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 15:31:12,893 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 15:31:12,898 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 15:31:12,902 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 15:31:12,903 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 15:31:12,905 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 15:31:12,907 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 15:31:12,907 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 15:31:12,908 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 15:31:12,910 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 15:31:12,911 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 15:31:12,912 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 15:31:12,912 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 15:31:12,914 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 15:31:12,915 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 15:31:12,916 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 15:31:12,917 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 15:31:12,918 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 15:31:12,918 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 15:31:12,918 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 15:31:12,919 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 15:31:12,920 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 15:31:12,921 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 15:31:12,922 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf [2019-12-27 15:31:12,953 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 15:31:12,953 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 15:31:12,960 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 15:31:12,960 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 15:31:12,960 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 15:31:12,961 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 15:31:12,961 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 15:31:12,961 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 15:31:12,961 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 15:31:12,961 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 15:31:12,961 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 15:31:12,962 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 15:31:12,962 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 15:31:12,962 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 15:31:12,962 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 15:31:12,962 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 15:31:12,963 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 15:31:12,963 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 15:31:12,963 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 15:31:12,963 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 15:31:12,963 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 15:31:12,964 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 15:31:12,964 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 15:31:12,964 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 15:31:12,964 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 15:31:12,965 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 15:31:12,965 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 15:31:12,965 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 15:31:12,965 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 15:31:12,965 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 15:31:12,965 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 15:31:13,225 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 15:31:13,239 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 15:31:13,242 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 15:31:13,243 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 15:31:13,243 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 15:31:13,244 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix002_rmo.oepc.i [2019-12-27 15:31:13,317 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ca9833ef/288116b13bbe4171a06ac1e33d8ef71b/FLAG07dc96342 [2019-12-27 15:31:13,882 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 15:31:13,883 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix002_rmo.oepc.i [2019-12-27 15:31:13,915 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ca9833ef/288116b13bbe4171a06ac1e33d8ef71b/FLAG07dc96342 [2019-12-27 15:31:14,233 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ca9833ef/288116b13bbe4171a06ac1e33d8ef71b [2019-12-27 15:31:14,242 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 15:31:14,244 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 15:31:14,245 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 15:31:14,245 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 15:31:14,248 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 15:31:14,249 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:31:14" (1/1) ... [2019-12-27 15:31:14,252 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d1b0b36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:31:14, skipping insertion in model container [2019-12-27 15:31:14,252 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:31:14" (1/1) ... [2019-12-27 15:31:14,259 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 15:31:14,323 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 15:31:14,863 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 15:31:14,875 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 15:31:14,948 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 15:31:15,042 INFO L208 MainTranslator]: Completed translation [2019-12-27 15:31:15,043 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:31:15 WrapperNode [2019-12-27 15:31:15,043 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 15:31:15,044 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 15:31:15,044 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 15:31:15,044 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 15:31:15,053 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:31:15" (1/1) ... [2019-12-27 15:31:15,074 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:31:15" (1/1) ... [2019-12-27 15:31:15,113 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 15:31:15,114 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 15:31:15,114 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 15:31:15,114 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 15:31:15,122 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:31:15" (1/1) ... [2019-12-27 15:31:15,123 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:31:15" (1/1) ... [2019-12-27 15:31:15,128 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:31:15" (1/1) ... [2019-12-27 15:31:15,129 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:31:15" (1/1) ... [2019-12-27 15:31:15,140 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:31:15" (1/1) ... [2019-12-27 15:31:15,144 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:31:15" (1/1) ... [2019-12-27 15:31:15,148 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:31:15" (1/1) ... [2019-12-27 15:31:15,154 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 15:31:15,154 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 15:31:15,155 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 15:31:15,155 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 15:31:15,156 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:31:15" (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-27 15:31:15,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 15:31:15,225 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 15:31:15,225 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 15:31:15,225 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 15:31:15,226 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 15:31:15,226 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 15:31:15,226 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 15:31:15,226 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 15:31:15,226 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 15:31:15,227 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 15:31:15,227 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 15:31:15,227 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 15:31:15,227 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 15:31:15,229 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 15:31:16,169 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 15:31:16,169 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 15:31:16,170 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:31:16 BoogieIcfgContainer [2019-12-27 15:31:16,171 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 15:31:16,172 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 15:31:16,172 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 15:31:16,176 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 15:31:16,176 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 03:31:14" (1/3) ... [2019-12-27 15:31:16,177 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dfd6550 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:31:16, skipping insertion in model container [2019-12-27 15:31:16,177 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:31:15" (2/3) ... [2019-12-27 15:31:16,178 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dfd6550 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:31:16, skipping insertion in model container [2019-12-27 15:31:16,178 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:31:16" (3/3) ... [2019-12-27 15:31:16,180 INFO L109 eAbstractionObserver]: Analyzing ICFG mix002_rmo.oepc.i [2019-12-27 15:31:16,190 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 15:31:16,190 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 15:31:16,197 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 15:31:16,198 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 15:31:16,244 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,244 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,245 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,245 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,245 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,261 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,264 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,264 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,265 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,266 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,266 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,266 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,267 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,267 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,267 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,267 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,267 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,268 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,268 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,268 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,268 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,268 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,269 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,269 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,269 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,269 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,269 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,270 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,270 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,271 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,271 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,272 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,272 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,272 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,275 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,275 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,283 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,283 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,283 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,283 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,284 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,284 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,284 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,284 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,284 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,285 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,285 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,285 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,285 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,285 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,286 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,286 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,286 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,286 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,286 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,287 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,287 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,287 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,287 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,291 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,291 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,291 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,291 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,291 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,292 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,292 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,292 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,292 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,293 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,293 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,293 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,293 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,293 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,294 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,294 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,294 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,294 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,294 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,295 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,295 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,295 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,295 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,295 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,296 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,296 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,296 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,296 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,296 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,296 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,297 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,297 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,297 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,297 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,297 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,298 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,298 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,298 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,298 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,298 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,298 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,299 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,299 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,299 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,299 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,299 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,300 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,300 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,300 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,300 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,300 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,301 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,301 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,301 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,301 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,301 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,302 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,302 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,302 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,302 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,302 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,302 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,303 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,303 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,303 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,303 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,303 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,304 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,304 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,304 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,304 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,304 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,305 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,305 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,306 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,306 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,309 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,309 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,309 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,310 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,315 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,316 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,316 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,316 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,316 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,316 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,320 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,320 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,320 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,321 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,321 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,321 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,321 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,321 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,321 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,322 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,322 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,322 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,322 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,322 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,323 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,323 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,323 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,323 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,323 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,324 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,324 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,324 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,324 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,324 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,324 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,325 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,325 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,325 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,325 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,325 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,326 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,326 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,326 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,328 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,329 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,329 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,329 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,329 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,330 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,330 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,330 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,330 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,330 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,330 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,331 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:16,349 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 15:31:16,370 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 15:31:16,370 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 15:31:16,370 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 15:31:16,370 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 15:31:16,371 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 15:31:16,371 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 15:31:16,371 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 15:31:16,371 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 15:31:16,399 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 180 places, 217 transitions [2019-12-27 15:31:16,401 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 217 transitions [2019-12-27 15:31:16,523 INFO L132 PetriNetUnfolder]: 47/214 cut-off events. [2019-12-27 15:31:16,523 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 15:31:16,540 INFO L76 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 214 events. 47/214 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 434 event pairs. 0/165 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 15:31:16,565 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 217 transitions [2019-12-27 15:31:16,621 INFO L132 PetriNetUnfolder]: 47/214 cut-off events. [2019-12-27 15:31:16,621 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 15:31:16,630 INFO L76 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 214 events. 47/214 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 434 event pairs. 0/165 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 15:31:16,651 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 15:31:16,652 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 15:31:22,117 WARN L192 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-27 15:31:22,251 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-12-27 15:31:22,463 INFO L206 etLargeBlockEncoding]: Checked pairs total: 93316 [2019-12-27 15:31:22,464 INFO L214 etLargeBlockEncoding]: Total number of compositions: 117 [2019-12-27 15:31:22,467 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 95 places, 104 transitions [2019-12-27 15:31:41,871 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 120347 states. [2019-12-27 15:31:41,873 INFO L276 IsEmpty]: Start isEmpty. Operand 120347 states. [2019-12-27 15:31:41,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 15:31:41,879 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:31:41,880 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 15:31:41,880 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-27 15:31:41,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:31:41,888 INFO L82 PathProgramCache]: Analyzing trace with hash 922900, now seen corresponding path program 1 times [2019-12-27 15:31:41,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:31:41,898 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070796653] [2019-12-27 15:31:41,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:31:42,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:31:42,167 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-27 15:31:42,168 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070796653] [2019-12-27 15:31:42,169 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:31:42,169 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 15:31:42,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1340356584] [2019-12-27 15:31:42,173 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:31:42,179 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:31:42,191 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 15:31:42,192 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:31:42,196 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:31:42,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:31:42,197 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:31:42,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:31:42,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:31:42,215 INFO L87 Difference]: Start difference. First operand 120347 states. Second operand 3 states. [2019-12-27 15:31:46,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:31:46,060 INFO L93 Difference]: Finished difference Result 119349 states and 508327 transitions. [2019-12-27 15:31:46,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:31:46,062 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 15:31:46,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:31:46,841 INFO L225 Difference]: With dead ends: 119349 [2019-12-27 15:31:46,842 INFO L226 Difference]: Without dead ends: 112420 [2019-12-27 15:31:46,843 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-27 15:31:51,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112420 states. [2019-12-27 15:31:54,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112420 to 112420. [2019-12-27 15:31:54,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112420 states. [2019-12-27 15:31:55,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112420 states to 112420 states and 478219 transitions. [2019-12-27 15:31:55,165 INFO L78 Accepts]: Start accepts. Automaton has 112420 states and 478219 transitions. Word has length 3 [2019-12-27 15:31:55,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:31:55,166 INFO L462 AbstractCegarLoop]: Abstraction has 112420 states and 478219 transitions. [2019-12-27 15:31:55,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:31:55,166 INFO L276 IsEmpty]: Start isEmpty. Operand 112420 states and 478219 transitions. [2019-12-27 15:31:55,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 15:31:55,170 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:31:55,170 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:31:55,171 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-27 15:31:55,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:31:55,171 INFO L82 PathProgramCache]: Analyzing trace with hash -1739393843, now seen corresponding path program 1 times [2019-12-27 15:31:55,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:31:55,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474563104] [2019-12-27 15:31:55,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:31:55,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:31:55,287 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-27 15:31:55,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474563104] [2019-12-27 15:31:55,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:31:55,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:31:55,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1050339775] [2019-12-27 15:31:55,289 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:31:55,291 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:31:55,297 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 15:31:55,297 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:31:55,297 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:31:55,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 15:31:55,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:31:55,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 15:31:55,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:31:55,300 INFO L87 Difference]: Start difference. First operand 112420 states and 478219 transitions. Second operand 4 states. [2019-12-27 15:32:00,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:32:00,331 INFO L93 Difference]: Finished difference Result 179210 states and 732067 transitions. [2019-12-27 15:32:00,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 15:32:00,331 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 15:32:00,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:32:01,603 INFO L225 Difference]: With dead ends: 179210 [2019-12-27 15:32:01,603 INFO L226 Difference]: Without dead ends: 179161 [2019-12-27 15:32:01,604 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-27 15:32:11,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179161 states. [2019-12-27 15:32:14,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179161 to 162301. [2019-12-27 15:32:14,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162301 states. [2019-12-27 15:32:16,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162301 states to 162301 states and 672031 transitions. [2019-12-27 15:32:16,338 INFO L78 Accepts]: Start accepts. Automaton has 162301 states and 672031 transitions. Word has length 11 [2019-12-27 15:32:16,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:32:16,339 INFO L462 AbstractCegarLoop]: Abstraction has 162301 states and 672031 transitions. [2019-12-27 15:32:16,339 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 15:32:16,339 INFO L276 IsEmpty]: Start isEmpty. Operand 162301 states and 672031 transitions. [2019-12-27 15:32:16,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 15:32:16,345 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:32:16,345 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:32:16,346 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-27 15:32:16,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:32:16,346 INFO L82 PathProgramCache]: Analyzing trace with hash 53844596, now seen corresponding path program 1 times [2019-12-27 15:32:16,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:32:16,347 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777552884] [2019-12-27 15:32:16,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:32:16,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:32:16,407 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-27 15:32:16,407 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777552884] [2019-12-27 15:32:16,407 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:32:16,408 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:32:16,408 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1861054195] [2019-12-27 15:32:16,408 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:32:16,413 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:32:16,418 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 15:32:16,418 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:32:16,419 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:32:16,422 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:32:16,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:32:16,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:32:16,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:32:16,423 INFO L87 Difference]: Start difference. First operand 162301 states and 672031 transitions. Second operand 3 states. [2019-12-27 15:32:16,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:32:16,607 INFO L93 Difference]: Finished difference Result 34811 states and 113031 transitions. [2019-12-27 15:32:16,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:32:16,607 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 15:32:16,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:32:16,673 INFO L225 Difference]: With dead ends: 34811 [2019-12-27 15:32:16,673 INFO L226 Difference]: Without dead ends: 34811 [2019-12-27 15:32:16,674 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-27 15:32:16,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34811 states. [2019-12-27 15:32:17,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34811 to 34811. [2019-12-27 15:32:17,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34811 states. [2019-12-27 15:32:17,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34811 states to 34811 states and 113031 transitions. [2019-12-27 15:32:17,352 INFO L78 Accepts]: Start accepts. Automaton has 34811 states and 113031 transitions. Word has length 13 [2019-12-27 15:32:17,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:32:17,352 INFO L462 AbstractCegarLoop]: Abstraction has 34811 states and 113031 transitions. [2019-12-27 15:32:17,353 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:32:17,353 INFO L276 IsEmpty]: Start isEmpty. Operand 34811 states and 113031 transitions. [2019-12-27 15:32:17,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 15:32:17,356 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:32:17,356 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:32:17,356 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-27 15:32:17,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:32:17,356 INFO L82 PathProgramCache]: Analyzing trace with hash -2104175705, now seen corresponding path program 1 times [2019-12-27 15:32:17,357 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:32:17,357 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999794775] [2019-12-27 15:32:17,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:32:17,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:32:17,446 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-27 15:32:17,448 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999794775] [2019-12-27 15:32:17,448 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:32:17,448 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:32:17,449 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [29232614] [2019-12-27 15:32:17,449 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:32:17,453 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:32:17,456 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 15:32:17,456 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:32:17,457 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:32:17,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 15:32:17,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:32:17,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 15:32:17,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 15:32:17,458 INFO L87 Difference]: Start difference. First operand 34811 states and 113031 transitions. Second operand 5 states. [2019-12-27 15:32:20,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:32:20,500 INFO L93 Difference]: Finished difference Result 48236 states and 154913 transitions. [2019-12-27 15:32:20,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 15:32:20,500 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 15:32:20,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:32:20,590 INFO L225 Difference]: With dead ends: 48236 [2019-12-27 15:32:20,591 INFO L226 Difference]: Without dead ends: 48236 [2019-12-27 15:32:20,591 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-27 15:32:20,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48236 states. [2019-12-27 15:32:21,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48236 to 41215. [2019-12-27 15:32:21,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41215 states. [2019-12-27 15:32:21,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41215 states to 41215 states and 133442 transitions. [2019-12-27 15:32:21,308 INFO L78 Accepts]: Start accepts. Automaton has 41215 states and 133442 transitions. Word has length 16 [2019-12-27 15:32:21,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:32:21,309 INFO L462 AbstractCegarLoop]: Abstraction has 41215 states and 133442 transitions. [2019-12-27 15:32:21,309 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 15:32:21,309 INFO L276 IsEmpty]: Start isEmpty. Operand 41215 states and 133442 transitions. [2019-12-27 15:32:21,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 15:32:21,318 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:32:21,318 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-27 15:32:21,319 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-27 15:32:21,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:32:21,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1566659883, now seen corresponding path program 1 times [2019-12-27 15:32:21,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:32:21,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735927440] [2019-12-27 15:32:21,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:32:21,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:32:21,466 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-27 15:32:21,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735927440] [2019-12-27 15:32:21,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:32:21,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 15:32:21,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1627903033] [2019-12-27 15:32:21,467 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:32:21,471 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:32:21,477 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 37 states and 50 transitions. [2019-12-27 15:32:21,477 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:32:21,479 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:32:21,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 15:32:21,479 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:32:21,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 15:32:21,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 15:32:21,480 INFO L87 Difference]: Start difference. First operand 41215 states and 133442 transitions. Second operand 6 states. [2019-12-27 15:32:22,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:32:22,389 INFO L93 Difference]: Finished difference Result 62182 states and 196414 transitions. [2019-12-27 15:32:22,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 15:32:22,390 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 15:32:22,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:32:22,489 INFO L225 Difference]: With dead ends: 62182 [2019-12-27 15:32:22,489 INFO L226 Difference]: Without dead ends: 62175 [2019-12-27 15:32:22,490 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 15:32:22,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62175 states. [2019-12-27 15:32:23,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62175 to 40995. [2019-12-27 15:32:23,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40995 states. [2019-12-27 15:32:23,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40995 states to 40995 states and 132031 transitions. [2019-12-27 15:32:23,651 INFO L78 Accepts]: Start accepts. Automaton has 40995 states and 132031 transitions. Word has length 22 [2019-12-27 15:32:23,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:32:23,651 INFO L462 AbstractCegarLoop]: Abstraction has 40995 states and 132031 transitions. [2019-12-27 15:32:23,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 15:32:23,651 INFO L276 IsEmpty]: Start isEmpty. Operand 40995 states and 132031 transitions. [2019-12-27 15:32:23,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 15:32:23,665 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:32:23,665 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-27 15:32:23,665 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-27 15:32:23,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:32:23,666 INFO L82 PathProgramCache]: Analyzing trace with hash -1076429505, now seen corresponding path program 1 times [2019-12-27 15:32:23,666 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:32:23,667 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106610784] [2019-12-27 15:32:23,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:32:23,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:32:23,723 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-27 15:32:23,723 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106610784] [2019-12-27 15:32:23,724 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:32:23,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:32:23,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [387560248] [2019-12-27 15:32:23,724 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:32:23,727 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:32:23,736 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 15:32:23,736 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:32:23,737 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:32:23,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 15:32:23,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:32:23,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 15:32:23,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:32:23,738 INFO L87 Difference]: Start difference. First operand 40995 states and 132031 transitions. Second operand 4 states. [2019-12-27 15:32:23,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:32:23,811 INFO L93 Difference]: Finished difference Result 16196 states and 49196 transitions. [2019-12-27 15:32:23,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 15:32:23,811 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 15:32:23,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:32:23,834 INFO L225 Difference]: With dead ends: 16196 [2019-12-27 15:32:23,834 INFO L226 Difference]: Without dead ends: 16196 [2019-12-27 15:32:23,834 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-27 15:32:23,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16196 states. [2019-12-27 15:32:24,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16196 to 15833. [2019-12-27 15:32:24,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15833 states. [2019-12-27 15:32:24,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15833 states to 15833 states and 48160 transitions. [2019-12-27 15:32:24,057 INFO L78 Accepts]: Start accepts. Automaton has 15833 states and 48160 transitions. Word has length 25 [2019-12-27 15:32:24,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:32:24,058 INFO L462 AbstractCegarLoop]: Abstraction has 15833 states and 48160 transitions. [2019-12-27 15:32:24,058 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 15:32:24,058 INFO L276 IsEmpty]: Start isEmpty. Operand 15833 states and 48160 transitions. [2019-12-27 15:32:24,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 15:32:24,068 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:32:24,068 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-27 15:32:24,068 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-27 15:32:24,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:32:24,069 INFO L82 PathProgramCache]: Analyzing trace with hash -877586735, now seen corresponding path program 1 times [2019-12-27 15:32:24,069 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:32:24,069 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183319747] [2019-12-27 15:32:24,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:32:24,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:32:24,125 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-27 15:32:24,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183319747] [2019-12-27 15:32:24,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:32:24,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:32:24,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1720319781] [2019-12-27 15:32:24,126 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:32:24,130 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:32:24,136 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 15:32:24,136 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:32:24,136 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:32:24,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:32:24,137 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:32:24,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:32:24,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:32:24,137 INFO L87 Difference]: Start difference. First operand 15833 states and 48160 transitions. Second operand 3 states. [2019-12-27 15:32:24,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:32:24,241 INFO L93 Difference]: Finished difference Result 23073 states and 68792 transitions. [2019-12-27 15:32:24,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:32:24,241 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-27 15:32:24,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:32:24,272 INFO L225 Difference]: With dead ends: 23073 [2019-12-27 15:32:24,272 INFO L226 Difference]: Without dead ends: 23073 [2019-12-27 15:32:24,272 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-27 15:32:24,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23073 states. [2019-12-27 15:32:24,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23073 to 17600. [2019-12-27 15:32:24,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17600 states. [2019-12-27 15:32:24,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17600 states to 17600 states and 53010 transitions. [2019-12-27 15:32:24,553 INFO L78 Accepts]: Start accepts. Automaton has 17600 states and 53010 transitions. Word has length 27 [2019-12-27 15:32:24,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:32:24,553 INFO L462 AbstractCegarLoop]: Abstraction has 17600 states and 53010 transitions. [2019-12-27 15:32:24,554 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:32:24,554 INFO L276 IsEmpty]: Start isEmpty. Operand 17600 states and 53010 transitions. [2019-12-27 15:32:24,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 15:32:24,567 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:32:24,567 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:32:24,567 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-27 15:32:24,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:32:24,568 INFO L82 PathProgramCache]: Analyzing trace with hash -603523497, now seen corresponding path program 1 times [2019-12-27 15:32:24,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:32:24,568 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875735969] [2019-12-27 15:32:24,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:32:24,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:32:24,633 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-27 15:32:24,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875735969] [2019-12-27 15:32:24,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:32:24,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 15:32:24,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1789076390] [2019-12-27 15:32:24,634 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:32:24,638 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:32:24,644 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 15:32:24,644 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:32:24,644 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:32:24,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 15:32:24,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:32:24,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 15:32:24,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 15:32:24,646 INFO L87 Difference]: Start difference. First operand 17600 states and 53010 transitions. Second operand 6 states. [2019-12-27 15:32:25,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:32:25,288 INFO L93 Difference]: Finished difference Result 24767 states and 72789 transitions. [2019-12-27 15:32:25,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 15:32:25,289 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 15:32:25,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:32:25,322 INFO L225 Difference]: With dead ends: 24767 [2019-12-27 15:32:25,322 INFO L226 Difference]: Without dead ends: 24767 [2019-12-27 15:32:25,323 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 15:32:25,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24767 states. [2019-12-27 15:32:25,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24767 to 20286. [2019-12-27 15:32:25,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20286 states. [2019-12-27 15:32:25,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20286 states to 20286 states and 60759 transitions. [2019-12-27 15:32:25,618 INFO L78 Accepts]: Start accepts. Automaton has 20286 states and 60759 transitions. Word has length 27 [2019-12-27 15:32:25,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:32:25,618 INFO L462 AbstractCegarLoop]: Abstraction has 20286 states and 60759 transitions. [2019-12-27 15:32:25,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 15:32:25,619 INFO L276 IsEmpty]: Start isEmpty. Operand 20286 states and 60759 transitions. [2019-12-27 15:32:25,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 15:32:25,640 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:32:25,640 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-27 15:32:25,640 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-27 15:32:25,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:32:25,640 INFO L82 PathProgramCache]: Analyzing trace with hash 94968403, now seen corresponding path program 1 times [2019-12-27 15:32:25,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:32:25,641 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137319124] [2019-12-27 15:32:25,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:32:25,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:32:25,731 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-27 15:32:25,732 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137319124] [2019-12-27 15:32:25,732 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:32:25,732 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 15:32:25,733 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1107797218] [2019-12-27 15:32:25,733 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:32:25,739 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:32:25,750 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 48 states and 61 transitions. [2019-12-27 15:32:25,750 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:32:25,751 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:32:25,751 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 15:32:25,751 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:32:25,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 15:32:25,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 15:32:25,752 INFO L87 Difference]: Start difference. First operand 20286 states and 60759 transitions. Second operand 7 states. [2019-12-27 15:32:27,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:32:27,051 INFO L93 Difference]: Finished difference Result 27601 states and 80773 transitions. [2019-12-27 15:32:27,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 15:32:27,051 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-27 15:32:27,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:32:27,094 INFO L225 Difference]: With dead ends: 27601 [2019-12-27 15:32:27,094 INFO L226 Difference]: Without dead ends: 27601 [2019-12-27 15:32:27,094 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-27 15:32:27,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27601 states. [2019-12-27 15:32:27,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27601 to 18412. [2019-12-27 15:32:27,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18412 states. [2019-12-27 15:32:27,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18412 states to 18412 states and 55362 transitions. [2019-12-27 15:32:27,409 INFO L78 Accepts]: Start accepts. Automaton has 18412 states and 55362 transitions. Word has length 33 [2019-12-27 15:32:27,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:32:27,409 INFO L462 AbstractCegarLoop]: Abstraction has 18412 states and 55362 transitions. [2019-12-27 15:32:27,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 15:32:27,409 INFO L276 IsEmpty]: Start isEmpty. Operand 18412 states and 55362 transitions. [2019-12-27 15:32:27,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 15:32:27,433 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:32:27,433 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-27 15:32:27,433 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-27 15:32:27,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:32:27,434 INFO L82 PathProgramCache]: Analyzing trace with hash 994852703, now seen corresponding path program 1 times [2019-12-27 15:32:27,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:32:27,434 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114955982] [2019-12-27 15:32:27,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:32:27,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:32:27,491 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-27 15:32:27,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114955982] [2019-12-27 15:32:27,492 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:32:27,492 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 15:32:27,492 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1164045047] [2019-12-27 15:32:27,492 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:32:27,501 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:32:27,558 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 170 states and 351 transitions. [2019-12-27 15:32:27,558 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:32:27,560 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:32:27,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:32:27,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:32:27,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:32:27,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:32:27,561 INFO L87 Difference]: Start difference. First operand 18412 states and 55362 transitions. Second operand 3 states. [2019-12-27 15:32:27,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:32:27,642 INFO L93 Difference]: Finished difference Result 18411 states and 55360 transitions. [2019-12-27 15:32:27,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:32:27,643 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 15:32:27,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:32:27,675 INFO L225 Difference]: With dead ends: 18411 [2019-12-27 15:32:27,675 INFO L226 Difference]: Without dead ends: 18411 [2019-12-27 15:32:27,676 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-27 15:32:27,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18411 states. [2019-12-27 15:32:27,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18411 to 18411. [2019-12-27 15:32:27,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18411 states. [2019-12-27 15:32:28,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18411 states to 18411 states and 55360 transitions. [2019-12-27 15:32:28,098 INFO L78 Accepts]: Start accepts. Automaton has 18411 states and 55360 transitions. Word has length 39 [2019-12-27 15:32:28,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:32:28,099 INFO L462 AbstractCegarLoop]: Abstraction has 18411 states and 55360 transitions. [2019-12-27 15:32:28,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:32:28,099 INFO L276 IsEmpty]: Start isEmpty. Operand 18411 states and 55360 transitions. [2019-12-27 15:32:28,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 15:32:28,123 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:32:28,123 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:32:28,123 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-27 15:32:28,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:32:28,124 INFO L82 PathProgramCache]: Analyzing trace with hash 467911076, now seen corresponding path program 1 times [2019-12-27 15:32:28,124 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:32:28,125 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599787696] [2019-12-27 15:32:28,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:32:28,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:32:28,266 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-27 15:32:28,266 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599787696] [2019-12-27 15:32:28,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:32:28,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:32:28,267 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2146658426] [2019-12-27 15:32:28,267 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:32:28,275 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:32:28,346 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 210 states and 423 transitions. [2019-12-27 15:32:28,346 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:32:28,349 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 15:32:28,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:32:28,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:32:28,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:32:28,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:32:28,351 INFO L87 Difference]: Start difference. First operand 18411 states and 55360 transitions. Second operand 3 states. [2019-12-27 15:32:28,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:32:28,420 INFO L93 Difference]: Finished difference Result 18325 states and 55099 transitions. [2019-12-27 15:32:28,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:32:28,426 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-27 15:32:28,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:32:28,458 INFO L225 Difference]: With dead ends: 18325 [2019-12-27 15:32:28,458 INFO L226 Difference]: Without dead ends: 18325 [2019-12-27 15:32:28,459 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-27 15:32:28,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18325 states. [2019-12-27 15:32:28,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18325 to 16323. [2019-12-27 15:32:28,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16323 states. [2019-12-27 15:32:28,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16323 states to 16323 states and 49617 transitions. [2019-12-27 15:32:28,719 INFO L78 Accepts]: Start accepts. Automaton has 16323 states and 49617 transitions. Word has length 40 [2019-12-27 15:32:28,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:32:28,720 INFO L462 AbstractCegarLoop]: Abstraction has 16323 states and 49617 transitions. [2019-12-27 15:32:28,720 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:32:28,720 INFO L276 IsEmpty]: Start isEmpty. Operand 16323 states and 49617 transitions. [2019-12-27 15:32:28,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 15:32:28,736 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:32:28,736 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] [2019-12-27 15:32:28,737 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-27 15:32:28,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:32:28,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1873584483, now seen corresponding path program 1 times [2019-12-27 15:32:28,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:32:28,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555369156] [2019-12-27 15:32:28,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:32:28,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:32:28,800 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-27 15:32:28,801 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555369156] [2019-12-27 15:32:28,801 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:32:28,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 15:32:28,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [59006537] [2019-12-27 15:32:28,801 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:32:28,810 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:32:28,898 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 212 states and 417 transitions. [2019-12-27 15:32:28,899 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:32:28,958 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 15:32:28,959 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 15:32:28,959 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:32:28,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 15:32:28,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 15:32:28,960 INFO L87 Difference]: Start difference. First operand 16323 states and 49617 transitions. Second operand 6 states. [2019-12-27 15:32:29,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:32:29,052 INFO L93 Difference]: Finished difference Result 15143 states and 47024 transitions. [2019-12-27 15:32:29,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 15:32:29,053 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-27 15:32:29,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:32:29,075 INFO L225 Difference]: With dead ends: 15143 [2019-12-27 15:32:29,075 INFO L226 Difference]: Without dead ends: 15143 [2019-12-27 15:32:29,075 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 15:32:29,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15143 states. [2019-12-27 15:32:29,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15143 to 15143. [2019-12-27 15:32:29,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15143 states. [2019-12-27 15:32:29,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15143 states to 15143 states and 47024 transitions. [2019-12-27 15:32:29,290 INFO L78 Accepts]: Start accepts. Automaton has 15143 states and 47024 transitions. Word has length 41 [2019-12-27 15:32:29,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:32:29,290 INFO L462 AbstractCegarLoop]: Abstraction has 15143 states and 47024 transitions. [2019-12-27 15:32:29,290 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 15:32:29,291 INFO L276 IsEmpty]: Start isEmpty. Operand 15143 states and 47024 transitions. [2019-12-27 15:32:29,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 15:32:29,306 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:32:29,306 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-27 15:32:29,306 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-27 15:32:29,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:32:29,307 INFO L82 PathProgramCache]: Analyzing trace with hash 628999064, now seen corresponding path program 1 times [2019-12-27 15:32:29,307 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:32:29,308 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257050807] [2019-12-27 15:32:29,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:32:29,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:32:29,356 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-27 15:32:29,357 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257050807] [2019-12-27 15:32:29,357 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:32:29,357 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:32:29,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2087769431] [2019-12-27 15:32:29,358 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:32:29,379 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:32:29,836 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 313 states and 574 transitions. [2019-12-27 15:32:29,836 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:32:29,850 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 15:32:29,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:32:29,851 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:32:29,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:32:29,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:32:29,851 INFO L87 Difference]: Start difference. First operand 15143 states and 47024 transitions. Second operand 3 states. [2019-12-27 15:32:29,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:32:29,966 INFO L93 Difference]: Finished difference Result 19655 states and 59985 transitions. [2019-12-27 15:32:29,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:32:29,967 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 15:32:29,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:32:30,001 INFO L225 Difference]: With dead ends: 19655 [2019-12-27 15:32:30,002 INFO L226 Difference]: Without dead ends: 19655 [2019-12-27 15:32:30,007 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:32:30,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19655 states. [2019-12-27 15:32:30,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19655 to 14961. [2019-12-27 15:32:30,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14961 states. [2019-12-27 15:32:30,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14961 states to 14961 states and 45870 transitions. [2019-12-27 15:32:30,272 INFO L78 Accepts]: Start accepts. Automaton has 14961 states and 45870 transitions. Word has length 65 [2019-12-27 15:32:30,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:32:30,272 INFO L462 AbstractCegarLoop]: Abstraction has 14961 states and 45870 transitions. [2019-12-27 15:32:30,272 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:32:30,273 INFO L276 IsEmpty]: Start isEmpty. Operand 14961 states and 45870 transitions. [2019-12-27 15:32:30,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 15:32:30,294 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:32:30,294 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-27 15:32:30,294 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-27 15:32:30,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:32:30,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1958678932, now seen corresponding path program 1 times [2019-12-27 15:32:30,296 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:32:30,296 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486236356] [2019-12-27 15:32:30,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:32:30,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:32:30,385 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-27 15:32:30,385 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486236356] [2019-12-27 15:32:30,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:32:30,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 15:32:30,386 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1783636071] [2019-12-27 15:32:30,386 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:32:30,410 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:32:30,708 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 313 states and 574 transitions. [2019-12-27 15:32:30,709 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:32:30,768 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 15:32:30,769 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 15:32:30,769 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:32:30,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 15:32:30,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 15:32:30,770 INFO L87 Difference]: Start difference. First operand 14961 states and 45870 transitions. Second operand 9 states. [2019-12-27 15:32:33,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:32:33,794 INFO L93 Difference]: Finished difference Result 67643 states and 203328 transitions. [2019-12-27 15:32:33,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-27 15:32:33,795 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-27 15:32:33,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:32:33,869 INFO L225 Difference]: With dead ends: 67643 [2019-12-27 15:32:33,869 INFO L226 Difference]: Without dead ends: 53075 [2019-12-27 15:32:33,870 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=220, Invalid=836, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 15:32:34,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53075 states. [2019-12-27 15:32:34,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53075 to 18596. [2019-12-27 15:32:34,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18596 states. [2019-12-27 15:32:34,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18596 states to 18596 states and 57138 transitions. [2019-12-27 15:32:34,382 INFO L78 Accepts]: Start accepts. Automaton has 18596 states and 57138 transitions. Word has length 65 [2019-12-27 15:32:34,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:32:34,382 INFO L462 AbstractCegarLoop]: Abstraction has 18596 states and 57138 transitions. [2019-12-27 15:32:34,382 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 15:32:34,382 INFO L276 IsEmpty]: Start isEmpty. Operand 18596 states and 57138 transitions. [2019-12-27 15:32:34,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 15:32:34,413 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:32:34,413 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-27 15:32:34,414 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-27 15:32:34,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:32:34,414 INFO L82 PathProgramCache]: Analyzing trace with hash -29541862, now seen corresponding path program 2 times [2019-12-27 15:32:34,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:32:34,415 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539708506] [2019-12-27 15:32:34,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:32:34,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:32:34,511 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-27 15:32:34,511 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539708506] [2019-12-27 15:32:34,511 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:32:34,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 15:32:34,512 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1465741324] [2019-12-27 15:32:34,512 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:32:34,534 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:32:34,838 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 261 states and 497 transitions. [2019-12-27 15:32:34,838 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:32:34,854 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 15:32:34,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 15:32:34,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:32:34,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 15:32:34,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 15:32:34,856 INFO L87 Difference]: Start difference. First operand 18596 states and 57138 transitions. Second operand 8 states. [2019-12-27 15:32:37,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:32:37,340 INFO L93 Difference]: Finished difference Result 69175 states and 210360 transitions. [2019-12-27 15:32:37,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 15:32:37,340 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-27 15:32:37,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:32:37,408 INFO L225 Difference]: With dead ends: 69175 [2019-12-27 15:32:37,408 INFO L226 Difference]: Without dead ends: 48309 [2019-12-27 15:32:37,408 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=167, Invalid=703, Unknown=0, NotChecked=0, Total=870 [2019-12-27 15:32:37,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48309 states. [2019-12-27 15:32:37,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48309 to 23571. [2019-12-27 15:32:37,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23571 states. [2019-12-27 15:32:37,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23571 states to 23571 states and 72094 transitions. [2019-12-27 15:32:37,966 INFO L78 Accepts]: Start accepts. Automaton has 23571 states and 72094 transitions. Word has length 65 [2019-12-27 15:32:37,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:32:37,966 INFO L462 AbstractCegarLoop]: Abstraction has 23571 states and 72094 transitions. [2019-12-27 15:32:37,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 15:32:37,966 INFO L276 IsEmpty]: Start isEmpty. Operand 23571 states and 72094 transitions. [2019-12-27 15:32:37,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 15:32:37,992 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:32:37,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 15:32:37,992 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-27 15:32:37,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:32:37,993 INFO L82 PathProgramCache]: Analyzing trace with hash -1604322860, now seen corresponding path program 3 times [2019-12-27 15:32:37,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:32:37,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828787669] [2019-12-27 15:32:37,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:32:38,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:32:38,107 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-27 15:32:38,108 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828787669] [2019-12-27 15:32:38,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:32:38,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 15:32:38,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [826013116] [2019-12-27 15:32:38,110 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:32:38,133 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:32:38,309 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 178 states and 310 transitions. [2019-12-27 15:32:38,309 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:32:38,344 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 15:32:38,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 15:32:38,345 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:32:38,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 15:32:38,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-27 15:32:38,346 INFO L87 Difference]: Start difference. First operand 23571 states and 72094 transitions. Second operand 11 states. [2019-12-27 15:32:41,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:32:41,251 INFO L93 Difference]: Finished difference Result 93089 states and 282056 transitions. [2019-12-27 15:32:41,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-12-27 15:32:41,252 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-12-27 15:32:41,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:32:41,410 INFO L225 Difference]: With dead ends: 93089 [2019-12-27 15:32:41,410 INFO L226 Difference]: Without dead ends: 90467 [2019-12-27 15:32:41,411 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 709 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=489, Invalid=1767, Unknown=0, NotChecked=0, Total=2256 [2019-12-27 15:32:41,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90467 states. [2019-12-27 15:32:42,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90467 to 23764. [2019-12-27 15:32:42,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23764 states. [2019-12-27 15:32:42,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23764 states to 23764 states and 72954 transitions. [2019-12-27 15:32:42,287 INFO L78 Accepts]: Start accepts. Automaton has 23764 states and 72954 transitions. Word has length 65 [2019-12-27 15:32:42,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:32:42,287 INFO L462 AbstractCegarLoop]: Abstraction has 23764 states and 72954 transitions. [2019-12-27 15:32:42,287 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 15:32:42,288 INFO L276 IsEmpty]: Start isEmpty. Operand 23764 states and 72954 transitions. [2019-12-27 15:32:42,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 15:32:42,312 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:32:42,312 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-27 15:32:42,312 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-27 15:32:42,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:32:42,312 INFO L82 PathProgramCache]: Analyzing trace with hash -841108452, now seen corresponding path program 4 times [2019-12-27 15:32:42,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:32:42,313 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227276475] [2019-12-27 15:32:42,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:32:42,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:32:42,372 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-27 15:32:42,372 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227276475] [2019-12-27 15:32:42,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:32:42,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:32:42,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1811212879] [2019-12-27 15:32:42,373 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:32:42,393 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:32:42,824 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 340 states and 648 transitions. [2019-12-27 15:32:42,824 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:32:42,836 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 15:32:42,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:32:42,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:32:42,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:32:42,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:32:42,837 INFO L87 Difference]: Start difference. First operand 23764 states and 72954 transitions. Second operand 3 states. [2019-12-27 15:32:43,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:32:43,153 INFO L93 Difference]: Finished difference Result 26831 states and 82437 transitions. [2019-12-27 15:32:43,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:32:43,154 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 15:32:43,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:32:43,207 INFO L225 Difference]: With dead ends: 26831 [2019-12-27 15:32:43,207 INFO L226 Difference]: Without dead ends: 26831 [2019-12-27 15:32:43,208 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 4 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:32:43,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26831 states. [2019-12-27 15:32:43,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26831 to 22448. [2019-12-27 15:32:43,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22448 states. [2019-12-27 15:32:43,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22448 states to 22448 states and 69699 transitions. [2019-12-27 15:32:43,560 INFO L78 Accepts]: Start accepts. Automaton has 22448 states and 69699 transitions. Word has length 65 [2019-12-27 15:32:43,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:32:43,560 INFO L462 AbstractCegarLoop]: Abstraction has 22448 states and 69699 transitions. [2019-12-27 15:32:43,561 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:32:43,561 INFO L276 IsEmpty]: Start isEmpty. Operand 22448 states and 69699 transitions. [2019-12-27 15:32:43,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 15:32:43,586 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:32:43,586 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-27 15:32:43,586 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-27 15:32:43,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:32:43,587 INFO L82 PathProgramCache]: Analyzing trace with hash -23971085, now seen corresponding path program 1 times [2019-12-27 15:32:43,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:32:43,587 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863935699] [2019-12-27 15:32:43,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:32:43,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:32:43,684 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-27 15:32:43,684 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863935699] [2019-12-27 15:32:43,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:32:43,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 15:32:43,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1093549556] [2019-12-27 15:32:43,686 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:32:43,710 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:32:43,946 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 168 states and 293 transitions. [2019-12-27 15:32:43,946 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:32:43,948 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 15:32:43,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 15:32:43,949 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:32:43,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 15:32:43,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 15:32:43,950 INFO L87 Difference]: Start difference. First operand 22448 states and 69699 transitions. Second operand 8 states. [2019-12-27 15:32:45,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:32:45,085 INFO L93 Difference]: Finished difference Result 55952 states and 170672 transitions. [2019-12-27 15:32:45,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 15:32:45,085 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 66 [2019-12-27 15:32:45,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:32:45,160 INFO L225 Difference]: With dead ends: 55952 [2019-12-27 15:32:45,160 INFO L226 Difference]: Without dead ends: 52796 [2019-12-27 15:32:45,161 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2019-12-27 15:32:45,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52796 states. [2019-12-27 15:32:45,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52796 to 22532. [2019-12-27 15:32:45,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22532 states. [2019-12-27 15:32:45,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22532 states to 22532 states and 70039 transitions. [2019-12-27 15:32:45,730 INFO L78 Accepts]: Start accepts. Automaton has 22532 states and 70039 transitions. Word has length 66 [2019-12-27 15:32:45,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:32:45,730 INFO L462 AbstractCegarLoop]: Abstraction has 22532 states and 70039 transitions. [2019-12-27 15:32:45,730 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 15:32:45,730 INFO L276 IsEmpty]: Start isEmpty. Operand 22532 states and 70039 transitions. [2019-12-27 15:32:45,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 15:32:45,756 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:32:45,756 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-27 15:32:45,756 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-27 15:32:45,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:32:45,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1713623309, now seen corresponding path program 2 times [2019-12-27 15:32:45,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:32:45,757 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546292974] [2019-12-27 15:32:45,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:32:45,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:32:45,865 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-27 15:32:45,865 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546292974] [2019-12-27 15:32:45,865 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:32:45,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 15:32:45,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [912740649] [2019-12-27 15:32:45,866 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:32:46,003 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:32:46,150 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 175 states and 307 transitions. [2019-12-27 15:32:46,150 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:32:46,309 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 15:32:46,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 15:32:46,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:32:46,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 15:32:46,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-27 15:32:46,311 INFO L87 Difference]: Start difference. First operand 22532 states and 70039 transitions. Second operand 12 states. [2019-12-27 15:32:52,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:32:52,016 INFO L93 Difference]: Finished difference Result 98642 states and 299379 transitions. [2019-12-27 15:32:52,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-12-27 15:32:52,016 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2019-12-27 15:32:52,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:32:52,139 INFO L225 Difference]: With dead ends: 98642 [2019-12-27 15:32:52,139 INFO L226 Difference]: Without dead ends: 83103 [2019-12-27 15:32:52,141 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1690 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=840, Invalid=3990, Unknown=0, NotChecked=0, Total=4830 [2019-12-27 15:32:52,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83103 states. [2019-12-27 15:32:53,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83103 to 24328. [2019-12-27 15:32:53,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24328 states. [2019-12-27 15:32:53,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24328 states to 24328 states and 75952 transitions. [2019-12-27 15:32:53,175 INFO L78 Accepts]: Start accepts. Automaton has 24328 states and 75952 transitions. Word has length 66 [2019-12-27 15:32:53,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:32:53,175 INFO L462 AbstractCegarLoop]: Abstraction has 24328 states and 75952 transitions. [2019-12-27 15:32:53,175 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 15:32:53,175 INFO L276 IsEmpty]: Start isEmpty. Operand 24328 states and 75952 transitions. [2019-12-27 15:32:53,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 15:32:53,202 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:32:53,202 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-27 15:32:53,202 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-27 15:32:53,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:32:53,203 INFO L82 PathProgramCache]: Analyzing trace with hash -1583227917, now seen corresponding path program 3 times [2019-12-27 15:32:53,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:32:53,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291353405] [2019-12-27 15:32:53,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:32:53,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:32:53,327 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-27 15:32:53,328 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291353405] [2019-12-27 15:32:53,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:32:53,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 15:32:53,329 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [832758213] [2019-12-27 15:32:53,329 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:32:53,355 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:32:53,549 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 168 states and 293 transitions. [2019-12-27 15:32:53,550 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:32:53,551 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 15:32:53,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 15:32:53,552 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:32:53,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 15:32:53,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 15:32:53,552 INFO L87 Difference]: Start difference. First operand 24328 states and 75952 transitions. Second operand 9 states. [2019-12-27 15:32:54,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:32:54,861 INFO L93 Difference]: Finished difference Result 72337 states and 218873 transitions. [2019-12-27 15:32:54,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 15:32:54,862 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-27 15:32:54,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:32:54,957 INFO L225 Difference]: With dead ends: 72337 [2019-12-27 15:32:54,957 INFO L226 Difference]: Without dead ends: 68973 [2019-12-27 15:32:54,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=159, Invalid=491, Unknown=0, NotChecked=0, Total=650 [2019-12-27 15:32:55,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68973 states. [2019-12-27 15:32:55,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68973 to 24188. [2019-12-27 15:32:55,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24188 states. [2019-12-27 15:32:55,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24188 states to 24188 states and 75284 transitions. [2019-12-27 15:32:55,908 INFO L78 Accepts]: Start accepts. Automaton has 24188 states and 75284 transitions. Word has length 66 [2019-12-27 15:32:55,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:32:55,908 INFO L462 AbstractCegarLoop]: Abstraction has 24188 states and 75284 transitions. [2019-12-27 15:32:55,908 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 15:32:55,908 INFO L276 IsEmpty]: Start isEmpty. Operand 24188 states and 75284 transitions. [2019-12-27 15:32:55,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 15:32:55,934 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:32:55,934 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-27 15:32:55,934 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-27 15:32:55,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:32:55,934 INFO L82 PathProgramCache]: Analyzing trace with hash -1805047887, now seen corresponding path program 4 times [2019-12-27 15:32:55,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:32:55,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772057751] [2019-12-27 15:32:55,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:32:55,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:32:56,077 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-27 15:32:56,078 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772057751] [2019-12-27 15:32:56,078 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:32:56,078 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 15:32:56,078 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1572720476] [2019-12-27 15:32:56,079 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:32:56,095 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:32:56,547 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 298 states and 548 transitions. [2019-12-27 15:32:56,547 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:32:56,844 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 15:32:56,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 15:32:56,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:32:56,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 15:32:56,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-12-27 15:32:56,846 INFO L87 Difference]: Start difference. First operand 24188 states and 75284 transitions. Second operand 13 states. [2019-12-27 15:33:00,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:33:00,298 INFO L93 Difference]: Finished difference Result 61337 states and 185557 transitions. [2019-12-27 15:33:00,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-27 15:33:00,299 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 66 [2019-12-27 15:33:00,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:33:00,389 INFO L225 Difference]: With dead ends: 61337 [2019-12-27 15:33:00,389 INFO L226 Difference]: Without dead ends: 61337 [2019-12-27 15:33:00,389 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=284, Invalid=472, Unknown=0, NotChecked=0, Total=756 [2019-12-27 15:33:00,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61337 states. [2019-12-27 15:33:01,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61337 to 22583. [2019-12-27 15:33:01,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22583 states. [2019-12-27 15:33:01,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22583 states to 22583 states and 69137 transitions. [2019-12-27 15:33:01,207 INFO L78 Accepts]: Start accepts. Automaton has 22583 states and 69137 transitions. Word has length 66 [2019-12-27 15:33:01,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:33:01,208 INFO L462 AbstractCegarLoop]: Abstraction has 22583 states and 69137 transitions. [2019-12-27 15:33:01,208 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 15:33:01,208 INFO L276 IsEmpty]: Start isEmpty. Operand 22583 states and 69137 transitions. [2019-12-27 15:33:01,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 15:33:01,234 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:33:01,234 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-27 15:33:01,234 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-27 15:33:01,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:33:01,234 INFO L82 PathProgramCache]: Analyzing trace with hash -707932787, now seen corresponding path program 1 times [2019-12-27 15:33:01,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:33:01,235 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605053399] [2019-12-27 15:33:01,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:33:01,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:33:01,298 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-27 15:33:01,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605053399] [2019-12-27 15:33:01,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:33:01,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:33:01,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1470842] [2019-12-27 15:33:01,299 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:33:01,313 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:33:01,619 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 298 states and 548 transitions. [2019-12-27 15:33:01,619 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:33:01,625 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 15:33:01,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 15:33:01,626 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:33:01,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 15:33:01,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:33:01,627 INFO L87 Difference]: Start difference. First operand 22583 states and 69137 transitions. Second operand 4 states. [2019-12-27 15:33:01,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:33:01,751 INFO L93 Difference]: Finished difference Result 22398 states and 68401 transitions. [2019-12-27 15:33:01,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 15:33:01,752 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-27 15:33:01,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:33:01,781 INFO L225 Difference]: With dead ends: 22398 [2019-12-27 15:33:01,781 INFO L226 Difference]: Without dead ends: 22398 [2019-12-27 15:33:01,781 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 5 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 15:33:01,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22398 states. [2019-12-27 15:33:02,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22398 to 20584. [2019-12-27 15:33:02,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20584 states. [2019-12-27 15:33:02,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20584 states to 20584 states and 62988 transitions. [2019-12-27 15:33:02,116 INFO L78 Accepts]: Start accepts. Automaton has 20584 states and 62988 transitions. Word has length 66 [2019-12-27 15:33:02,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:33:02,116 INFO L462 AbstractCegarLoop]: Abstraction has 20584 states and 62988 transitions. [2019-12-27 15:33:02,116 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 15:33:02,116 INFO L276 IsEmpty]: Start isEmpty. Operand 20584 states and 62988 transitions. [2019-12-27 15:33:02,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 15:33:02,140 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:33:02,141 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-27 15:33:02,141 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-27 15:33:02,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:33:02,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1506873112, now seen corresponding path program 1 times [2019-12-27 15:33:02,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:33:02,142 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602539278] [2019-12-27 15:33:02,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:33:02,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:33:02,195 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-27 15:33:02,195 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602539278] [2019-12-27 15:33:02,196 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:33:02,196 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:33:02,196 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1190980842] [2019-12-27 15:33:02,196 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:33:02,209 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:33:02,685 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 308 states and 520 transitions. [2019-12-27 15:33:02,685 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:33:02,695 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 15:33:02,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 15:33:02,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:33:02,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 15:33:02,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:33:02,696 INFO L87 Difference]: Start difference. First operand 20584 states and 62988 transitions. Second operand 4 states. [2019-12-27 15:33:02,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:33:02,956 INFO L93 Difference]: Finished difference Result 26349 states and 78432 transitions. [2019-12-27 15:33:02,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 15:33:02,956 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-27 15:33:02,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:33:02,992 INFO L225 Difference]: With dead ends: 26349 [2019-12-27 15:33:02,992 INFO L226 Difference]: Without dead ends: 26349 [2019-12-27 15:33:02,992 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 15:33:03,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26349 states. [2019-12-27 15:33:03,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26349 to 18341. [2019-12-27 15:33:03,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18341 states. [2019-12-27 15:33:03,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18341 states to 18341 states and 55309 transitions. [2019-12-27 15:33:03,299 INFO L78 Accepts]: Start accepts. Automaton has 18341 states and 55309 transitions. Word has length 66 [2019-12-27 15:33:03,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:33:03,300 INFO L462 AbstractCegarLoop]: Abstraction has 18341 states and 55309 transitions. [2019-12-27 15:33:03,300 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 15:33:03,300 INFO L276 IsEmpty]: Start isEmpty. Operand 18341 states and 55309 transitions. [2019-12-27 15:33:03,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 15:33:03,318 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:33:03,318 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-27 15:33:03,318 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-27 15:33:03,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:33:03,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1717710349, now seen corresponding path program 1 times [2019-12-27 15:33:03,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:33:03,319 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638531163] [2019-12-27 15:33:03,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:33:03,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:33:03,420 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-27 15:33:03,421 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638531163] [2019-12-27 15:33:03,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:33:03,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 15:33:03,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [28738022] [2019-12-27 15:33:03,422 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:33:03,440 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:33:03,638 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 195 states and 334 transitions. [2019-12-27 15:33:03,638 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:33:03,663 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 15:33:03,664 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 15:33:03,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:33:03,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 15:33:03,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-27 15:33:03,665 INFO L87 Difference]: Start difference. First operand 18341 states and 55309 transitions. Second operand 9 states. [2019-12-27 15:33:05,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:33:05,173 INFO L93 Difference]: Finished difference Result 34193 states and 101561 transitions. [2019-12-27 15:33:05,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 15:33:05,174 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2019-12-27 15:33:05,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:33:05,216 INFO L225 Difference]: With dead ends: 34193 [2019-12-27 15:33:05,216 INFO L226 Difference]: Without dead ends: 28904 [2019-12-27 15:33:05,216 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=399, Unknown=0, NotChecked=0, Total=506 [2019-12-27 15:33:05,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28904 states. [2019-12-27 15:33:05,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28904 to 18973. [2019-12-27 15:33:05,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18973 states. [2019-12-27 15:33:05,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18973 states to 18973 states and 56913 transitions. [2019-12-27 15:33:05,538 INFO L78 Accepts]: Start accepts. Automaton has 18973 states and 56913 transitions. Word has length 67 [2019-12-27 15:33:05,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:33:05,538 INFO L462 AbstractCegarLoop]: Abstraction has 18973 states and 56913 transitions. [2019-12-27 15:33:05,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 15:33:05,539 INFO L276 IsEmpty]: Start isEmpty. Operand 18973 states and 56913 transitions. [2019-12-27 15:33:05,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 15:33:05,557 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:33:05,557 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-27 15:33:05,558 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-27 15:33:05,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:33:05,558 INFO L82 PathProgramCache]: Analyzing trace with hash 1715738515, now seen corresponding path program 2 times [2019-12-27 15:33:05,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:33:05,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239959827] [2019-12-27 15:33:05,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:33:05,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:33:05,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:33:05,722 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239959827] [2019-12-27 15:33:05,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:33:05,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 15:33:05,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1599457518] [2019-12-27 15:33:05,723 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:33:05,742 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:33:05,917 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 190 states and 324 transitions. [2019-12-27 15:33:05,917 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:33:06,158 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 15:33:06,159 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 15:33:06,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:33:06,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 15:33:06,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-27 15:33:06,160 INFO L87 Difference]: Start difference. First operand 18973 states and 56913 transitions. Second operand 12 states. [2019-12-27 15:33:07,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:33:07,360 INFO L93 Difference]: Finished difference Result 23858 states and 70963 transitions. [2019-12-27 15:33:07,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 15:33:07,360 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-27 15:33:07,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:33:07,388 INFO L225 Difference]: With dead ends: 23858 [2019-12-27 15:33:07,388 INFO L226 Difference]: Without dead ends: 22303 [2019-12-27 15:33:07,388 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 6 SyntacticMatches, 5 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=96, Invalid=456, Unknown=0, NotChecked=0, Total=552 [2019-12-27 15:33:07,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22303 states. [2019-12-27 15:33:07,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22303 to 19069. [2019-12-27 15:33:07,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19069 states. [2019-12-27 15:33:07,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19069 states to 19069 states and 57154 transitions. [2019-12-27 15:33:07,672 INFO L78 Accepts]: Start accepts. Automaton has 19069 states and 57154 transitions. Word has length 67 [2019-12-27 15:33:07,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:33:07,672 INFO L462 AbstractCegarLoop]: Abstraction has 19069 states and 57154 transitions. [2019-12-27 15:33:07,673 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 15:33:07,673 INFO L276 IsEmpty]: Start isEmpty. Operand 19069 states and 57154 transitions. [2019-12-27 15:33:07,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 15:33:07,692 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:33:07,692 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-27 15:33:07,692 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-27 15:33:07,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:33:07,692 INFO L82 PathProgramCache]: Analyzing trace with hash -809344243, now seen corresponding path program 3 times [2019-12-27 15:33:07,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:33:07,693 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222391948] [2019-12-27 15:33:07,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:33:07,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:33:07,860 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-27 15:33:07,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222391948] [2019-12-27 15:33:07,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:33:07,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 15:33:07,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1957964770] [2019-12-27 15:33:07,861 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:33:07,870 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:33:08,095 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 289 states and 588 transitions. [2019-12-27 15:33:08,096 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:33:08,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 15:33:08,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 15:33:08,310 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 15 times. [2019-12-27 15:33:08,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 15:33:08,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:33:08,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 15:33:08,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-12-27 15:33:08,311 INFO L87 Difference]: Start difference. First operand 19069 states and 57154 transitions. Second operand 17 states. [2019-12-27 15:33:11,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:33:11,759 INFO L93 Difference]: Finished difference Result 41904 states and 124469 transitions. [2019-12-27 15:33:11,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-27 15:33:11,760 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 67 [2019-12-27 15:33:11,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:33:11,813 INFO L225 Difference]: With dead ends: 41904 [2019-12-27 15:33:11,813 INFO L226 Difference]: Without dead ends: 41245 [2019-12-27 15:33:11,814 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 7 SyntacticMatches, 5 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 521 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=363, Invalid=1989, Unknown=0, NotChecked=0, Total=2352 [2019-12-27 15:33:12,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41245 states. [2019-12-27 15:33:12,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41245 to 19021. [2019-12-27 15:33:12,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19021 states. [2019-12-27 15:33:12,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19021 states to 19021 states and 57038 transitions. [2019-12-27 15:33:12,352 INFO L78 Accepts]: Start accepts. Automaton has 19021 states and 57038 transitions. Word has length 67 [2019-12-27 15:33:12,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:33:12,353 INFO L462 AbstractCegarLoop]: Abstraction has 19021 states and 57038 transitions. [2019-12-27 15:33:12,353 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 15:33:12,353 INFO L276 IsEmpty]: Start isEmpty. Operand 19021 states and 57038 transitions. [2019-12-27 15:33:12,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 15:33:12,370 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:33:12,371 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-27 15:33:12,371 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-27 15:33:12,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:33:12,371 INFO L82 PathProgramCache]: Analyzing trace with hash -96373001, now seen corresponding path program 4 times [2019-12-27 15:33:12,372 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:33:12,372 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175753507] [2019-12-27 15:33:12,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:33:12,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:33:12,562 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-27 15:33:12,563 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175753507] [2019-12-27 15:33:12,563 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:33:12,563 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 15:33:12,563 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1391992407] [2019-12-27 15:33:12,563 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:33:12,577 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:33:12,768 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 244 states and 472 transitions. [2019-12-27 15:33:12,768 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:33:12,849 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 15:33:12,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 15:33:12,850 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:33:12,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 15:33:12,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-12-27 15:33:12,851 INFO L87 Difference]: Start difference. First operand 19021 states and 57038 transitions. Second operand 15 states. [2019-12-27 15:33:19,021 WARN L192 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 16 [2019-12-27 15:33:19,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:33:19,305 INFO L93 Difference]: Finished difference Result 72431 states and 214760 transitions. [2019-12-27 15:33:19,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-12-27 15:33:19,305 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2019-12-27 15:33:19,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:33:19,371 INFO L225 Difference]: With dead ends: 72431 [2019-12-27 15:33:19,371 INFO L226 Difference]: Without dead ends: 51774 [2019-12-27 15:33:19,374 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3833 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1438, Invalid=9068, Unknown=0, NotChecked=0, Total=10506 [2019-12-27 15:33:19,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51774 states. [2019-12-27 15:33:19,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51774 to 18617. [2019-12-27 15:33:19,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18617 states. [2019-12-27 15:33:19,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18617 states to 18617 states and 55706 transitions. [2019-12-27 15:33:19,812 INFO L78 Accepts]: Start accepts. Automaton has 18617 states and 55706 transitions. Word has length 67 [2019-12-27 15:33:19,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:33:19,813 INFO L462 AbstractCegarLoop]: Abstraction has 18617 states and 55706 transitions. [2019-12-27 15:33:19,813 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 15:33:19,813 INFO L276 IsEmpty]: Start isEmpty. Operand 18617 states and 55706 transitions. [2019-12-27 15:33:19,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 15:33:19,831 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:33:19,831 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-27 15:33:19,831 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-27 15:33:19,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:33:19,832 INFO L82 PathProgramCache]: Analyzing trace with hash -1475658587, now seen corresponding path program 5 times [2019-12-27 15:33:19,832 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:33:19,832 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640364751] [2019-12-27 15:33:19,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:33:19,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:33:19,998 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-27 15:33:19,998 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640364751] [2019-12-27 15:33:19,998 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:33:19,998 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 15:33:19,999 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [194264459] [2019-12-27 15:33:19,999 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:33:20,013 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:33:20,196 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 242 states and 464 transitions. [2019-12-27 15:33:20,196 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:33:20,315 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 15:33:20,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 15:33:20,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:33:20,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 15:33:20,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-27 15:33:20,316 INFO L87 Difference]: Start difference. First operand 18617 states and 55706 transitions. Second operand 12 states. [2019-12-27 15:33:21,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:33:21,370 INFO L93 Difference]: Finished difference Result 31528 states and 93292 transitions. [2019-12-27 15:33:21,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 15:33:21,371 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-27 15:33:21,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:33:21,411 INFO L225 Difference]: With dead ends: 31528 [2019-12-27 15:33:21,411 INFO L226 Difference]: Without dead ends: 31305 [2019-12-27 15:33:21,411 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 7 SyntacticMatches, 5 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=136, Invalid=566, Unknown=0, NotChecked=0, Total=702 [2019-12-27 15:33:21,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31305 states. [2019-12-27 15:33:21,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31305 to 18601. [2019-12-27 15:33:21,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18601 states. [2019-12-27 15:33:21,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18601 states to 18601 states and 55662 transitions. [2019-12-27 15:33:21,734 INFO L78 Accepts]: Start accepts. Automaton has 18601 states and 55662 transitions. Word has length 67 [2019-12-27 15:33:21,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:33:21,734 INFO L462 AbstractCegarLoop]: Abstraction has 18601 states and 55662 transitions. [2019-12-27 15:33:21,734 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 15:33:21,734 INFO L276 IsEmpty]: Start isEmpty. Operand 18601 states and 55662 transitions. [2019-12-27 15:33:21,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 15:33:21,752 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:33:21,752 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-27 15:33:21,752 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-27 15:33:21,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:33:21,753 INFO L82 PathProgramCache]: Analyzing trace with hash -200373485, now seen corresponding path program 6 times [2019-12-27 15:33:21,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:33:21,753 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007046240] [2019-12-27 15:33:21,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:33:21,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 15:33:21,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 15:33:21,873 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 15:33:21,873 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 15:33:21,877 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [904] [904] ULTIMATE.startENTRY-->L842: Formula: (let ((.cse0 (store |v_#valid_64| 0 0))) (and (= v_~__unbuffered_cnt~0_134 0) (= v_~a$r_buff1_thd0~0_110 0) (= v_~x~0_44 0) (= 0 v_~a$read_delayed_var~0.base_7) (= 0 v_~a$r_buff0_thd1~0_147) (= 0 v_~a$read_delayed~0_7) (= v_~a$read_delayed_var~0.offset_7 0) (= 0 v_~__unbuffered_p0_EAX~0_60) (= 0 v_~a$w_buff0_used~0_862) (= v_~__unbuffered_p0_EBX~0_60 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t50~0.base_23| 1) |v_#valid_62|) (= 0 v_~a$r_buff1_thd1~0_105) (= v_~main$tmp_guard1~0_27 0) (= v_~a$flush_delayed~0_24 0) (= 0 v_~__unbuffered_p1_EAX~0_34) (= v_~a~0_173 0) (= v_~a$r_buff1_thd3~0_219 0) (< 0 |v_#StackHeapBarrier_18|) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t50~0.base_23|) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t50~0.base_23| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t50~0.base_23|) |v_ULTIMATE.start_main_~#t50~0.offset_18| 0)) |v_#memory_int_21|) (= v_~a$r_buff0_thd3~0_314 0) (= 0 v_~__unbuffered_p2_EAX~0_29) (= v_~__unbuffered_p2_EBX~0_35 0) (= 0 v_~a$r_buff1_thd2~0_106) (= 0 |v_#NULL.base_4|) (= v_~__unbuffered_p1_EBX~0_34 0) (= v_~a$w_buff0~0_390 0) (= 0 v_~a$r_buff0_thd2~0_104) (= (select .cse0 |v_ULTIMATE.start_main_~#t50~0.base_23|) 0) (= v_~y~0_53 0) (= v_~a$mem_tmp~0_13 0) (= |v_ULTIMATE.start_main_~#t50~0.offset_18| 0) (= |v_#NULL.offset_4| 0) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t50~0.base_23| 4) |v_#length_23|) (= v_~main$tmp_guard0~0_22 0) (= v_~z~0_20 0) (= 0 v_~a$w_buff1~0_260) (= v_~weak$$choice2~0_108 0) (= v_~a$r_buff0_thd0~0_142 0) (= 0 v_~a$w_buff1_used~0_471) (= 0 v_~weak$$choice0~0_12))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t52~0.offset=|v_ULTIMATE.start_main_~#t52~0.offset_15|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_106, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_83|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_241|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_142, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_45|, ULTIMATE.start_main_~#t52~0.base=|v_ULTIMATE.start_main_~#t52~0.base_20|, ~a~0=v_~a~0_173, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_53|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_60, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_34, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_29, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_35, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_60, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_219, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_862, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_147, ULTIMATE.start_main_~#t50~0.offset=|v_ULTIMATE.start_main_~#t50~0.offset_18|, ~weak$$choice0~0=v_~weak$$choice0~0_12, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_7, ~a$w_buff0~0=v_~a$w_buff0~0_390, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_110, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_134, ~x~0=v_~x~0_44, ~a$read_delayed~0=v_~a$read_delayed~0_7, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_104, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_27, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_61|, ULTIMATE.start_main_~#t51~0.base=|v_ULTIMATE.start_main_~#t51~0.base_23|, ~a$mem_tmp~0=v_~a$mem_tmp~0_13, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_37|, ~a$w_buff1~0=v_~a$w_buff1~0_260, ~y~0=v_~y~0_53, ULTIMATE.start_main_~#t51~0.offset=|v_ULTIMATE.start_main_~#t51~0.offset_18|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_34, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_21|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_105, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_314, ULTIMATE.start_main_~#t50~0.base=|v_ULTIMATE.start_main_~#t50~0.base_23|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, #NULL.base=|v_#NULL.base_4|, ~a$flush_delayed~0=v_~a$flush_delayed~0_24, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_20, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_471, ~weak$$choice2~0=v_~weak$$choice2~0_108, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t52~0.offset, ~a$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_~#t52~0.base, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_#t~nondet45, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ULTIMATE.start_main_~#t50~0.offset, ~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, ULTIMATE.start_main_~#t51~0.base, ~a$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~a$w_buff1~0, ~y~0, ULTIMATE.start_main_~#t51~0.offset, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~a$r_buff1_thd1~0, ~a$r_buff0_thd3~0, ULTIMATE.start_main_~#t50~0.base, ~main$tmp_guard0~0, #NULL.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-27 15:33:21,878 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] P0ENTRY-->L4-3: Formula: (and (= ~a$w_buff0_used~0_Out1013953395 1) (= P0Thread1of1ForFork2___VERIFIER_assert_~expression_Out1013953395 |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression_Out1013953395|) (= ~a$w_buff1~0_Out1013953395 ~a$w_buff0~0_In1013953395) (= |P0Thread1of1ForFork2_#in~arg.base_In1013953395| P0Thread1of1ForFork2_~arg.base_Out1013953395) (= ~a$w_buff1_used~0_Out1013953395 ~a$w_buff0_used~0_In1013953395) (= ~a$w_buff0~0_Out1013953395 1) (= P0Thread1of1ForFork2_~arg.offset_Out1013953395 |P0Thread1of1ForFork2_#in~arg.offset_In1013953395|) (= 1 |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression_Out1013953395|) (= (mod ~a$w_buff1_used~0_Out1013953395 256) 0)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|P0Thread1of1ForFork2_#in~arg.offset_In1013953395|, ~a$w_buff0~0=~a$w_buff0~0_In1013953395, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1013953395, P0Thread1of1ForFork2_#in~arg.base=|P0Thread1of1ForFork2_#in~arg.base_In1013953395|} OutVars{~a$w_buff1~0=~a$w_buff1~0_Out1013953395, P0Thread1of1ForFork2_#in~arg.offset=|P0Thread1of1ForFork2_#in~arg.offset_In1013953395|, ~a$w_buff0~0=~a$w_buff0~0_Out1013953395, P0Thread1of1ForFork2_~arg.offset=P0Thread1of1ForFork2_~arg.offset_Out1013953395, ~a$w_buff0_used~0=~a$w_buff0_used~0_Out1013953395, P0Thread1of1ForFork2___VERIFIER_assert_~expression=P0Thread1of1ForFork2___VERIFIER_assert_~expression_Out1013953395, P0Thread1of1ForFork2_#in~arg.base=|P0Thread1of1ForFork2_#in~arg.base_In1013953395|, ~a$w_buff1_used~0=~a$w_buff1_used~0_Out1013953395, P0Thread1of1ForFork2_~arg.base=P0Thread1of1ForFork2_~arg.base_Out1013953395, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression=|P0Thread1of1ForFork2___VERIFIER_assert_#in~expression_Out1013953395|} AuxVars[] AssignedVars[~a$w_buff1~0, ~a$w_buff0~0, P0Thread1of1ForFork2_~arg.offset, ~a$w_buff0_used~0, P0Thread1of1ForFork2___VERIFIER_assert_~expression, ~a$w_buff1_used~0, P0Thread1of1ForFork2_~arg.base, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 15:33:21,879 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L842-1-->L844: Formula: (and (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t51~0.base_13| 4)) (= |v_ULTIMATE.start_main_~#t51~0.offset_11| 0) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t51~0.base_13|)) (= (store |v_#valid_37| |v_ULTIMATE.start_main_~#t51~0.base_13| 1) |v_#valid_36|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t51~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t51~0.base_13|) |v_ULTIMATE.start_main_~#t51~0.offset_11| 1)) |v_#memory_int_13|) (not (= 0 |v_ULTIMATE.start_main_~#t51~0.base_13|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t51~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|, ULTIMATE.start_main_~#t51~0.base=|v_ULTIMATE.start_main_~#t51~0.base_13|, ULTIMATE.start_main_~#t51~0.offset=|v_ULTIMATE.start_main_~#t51~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t51~0.base, ULTIMATE.start_main_~#t51~0.offset] because there is no mapped edge [2019-12-27 15:33:21,881 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L783-2-->L783-5: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff1_used~0_In-1194579931 256))) (.cse0 (= |P1Thread1of1ForFork0_#t~ite10_Out-1194579931| |P1Thread1of1ForFork0_#t~ite9_Out-1194579931|)) (.cse2 (= (mod ~a$r_buff1_thd2~0_In-1194579931 256) 0))) (or (and .cse0 (= ~a~0_In-1194579931 |P1Thread1of1ForFork0_#t~ite9_Out-1194579931|) (or .cse1 .cse2)) (and (not .cse1) .cse0 (= ~a$w_buff1~0_In-1194579931 |P1Thread1of1ForFork0_#t~ite9_Out-1194579931|) (not .cse2)))) InVars {~a~0=~a~0_In-1194579931, ~a$w_buff1~0=~a$w_buff1~0_In-1194579931, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1194579931, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1194579931} OutVars{~a~0=~a~0_In-1194579931, ~a$w_buff1~0=~a$w_buff1~0_In-1194579931, P1Thread1of1ForFork0_#t~ite10=|P1Thread1of1ForFork0_#t~ite10_Out-1194579931|, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1194579931, P1Thread1of1ForFork0_#t~ite9=|P1Thread1of1ForFork0_#t~ite9_Out-1194579931|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1194579931} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite10, P1Thread1of1ForFork0_#t~ite9] because there is no mapped edge [2019-12-27 15:33:21,882 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L784-->L784-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd2~0_In1296027285 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In1296027285 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite11_Out1296027285| ~a$w_buff0_used~0_In1296027285) (or .cse0 .cse1)) (and (not .cse0) (= 0 |P1Thread1of1ForFork0_#t~ite11_Out1296027285|) (not .cse1)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1296027285, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1296027285} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1296027285, P1Thread1of1ForFork0_#t~ite11=|P1Thread1of1ForFork0_#t~ite11_Out1296027285|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1296027285} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite11] because there is no mapped edge [2019-12-27 15:33:21,883 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L785-->L785-2: Formula: (let ((.cse2 (= 0 (mod ~a$w_buff0_used~0_In604872486 256))) (.cse3 (= 0 (mod ~a$r_buff0_thd2~0_In604872486 256))) (.cse0 (= (mod ~a$r_buff1_thd2~0_In604872486 256) 0)) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In604872486 256)))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite12_Out604872486|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P1Thread1of1ForFork0_#t~ite12_Out604872486| ~a$w_buff1_used~0_In604872486) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In604872486, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In604872486, ~a$w_buff0_used~0=~a$w_buff0_used~0_In604872486, ~a$w_buff1_used~0=~a$w_buff1_used~0_In604872486} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In604872486, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In604872486, P1Thread1of1ForFork0_#t~ite12=|P1Thread1of1ForFork0_#t~ite12_Out604872486|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In604872486, ~a$w_buff1_used~0=~a$w_buff1_used~0_In604872486} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-27 15:33:21,884 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [853] [853] L786-->L786-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In595845159 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In595845159 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork0_#t~ite13_Out595845159|) (not .cse1)) (and (or .cse1 .cse0) (= ~a$r_buff0_thd2~0_In595845159 |P1Thread1of1ForFork0_#t~ite13_Out595845159|)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In595845159, ~a$w_buff0_used~0=~a$w_buff0_used~0_In595845159} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In595845159, ~a$w_buff0_used~0=~a$w_buff0_used~0_In595845159, P1Thread1of1ForFork0_#t~ite13=|P1Thread1of1ForFork0_#t~ite13_Out595845159|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite13] because there is no mapped edge [2019-12-27 15:33:21,884 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [854] [854] L787-->L787-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff1_used~0_In-822844644 256))) (.cse1 (= (mod ~a$r_buff1_thd2~0_In-822844644 256) 0)) (.cse2 (= 0 (mod ~a$r_buff0_thd2~0_In-822844644 256))) (.cse3 (= (mod ~a$w_buff0_used~0_In-822844644 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~a$r_buff1_thd2~0_In-822844644 |P1Thread1of1ForFork0_#t~ite14_Out-822844644|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite14_Out-822844644|)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-822844644, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-822844644, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-822844644, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-822844644} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-822844644, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-822844644, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-822844644, P1Thread1of1ForFork0_#t~ite14=|P1Thread1of1ForFork0_#t~ite14_Out-822844644|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-822844644} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-27 15:33:21,884 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [856] [856] L787-2-->P1EXIT: Formula: (and (= v_~a$r_buff1_thd2~0_53 |v_P1Thread1of1ForFork0_#t~ite14_28|) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_45 1) v_~__unbuffered_cnt~0_44)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45, P1Thread1of1ForFork0_#t~ite14=|v_P1Thread1of1ForFork0_#t~ite14_28|} OutVars{~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_53, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44, P1Thread1of1ForFork0_#t~ite14=|v_P1Thread1of1ForFork0_#t~ite14_27|, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#t~ite14, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-27 15:33:21,885 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L844-1-->L846: Formula: (and (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t52~0.base_12|) (not (= |v_ULTIMATE.start_main_~#t52~0.base_12| 0)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t52~0.base_12| 4)) (= (store |v_#valid_35| |v_ULTIMATE.start_main_~#t52~0.base_12| 1) |v_#valid_34|) (= 0 |v_ULTIMATE.start_main_~#t52~0.offset_10|) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t52~0.base_12|)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t52~0.base_12| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t52~0.base_12|) |v_ULTIMATE.start_main_~#t52~0.offset_10| 2)) |v_#memory_int_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t52~0.base=|v_ULTIMATE.start_main_~#t52~0.base_12|, ULTIMATE.start_main_~#t52~0.offset=|v_ULTIMATE.start_main_~#t52~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_34|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_6|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t52~0.base, ULTIMATE.start_main_~#t52~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length] because there is no mapped edge [2019-12-27 15:33:21,887 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [884] [884] L808-->L808-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In600300731 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite20_In600300731| |P2Thread1of1ForFork1_#t~ite20_Out600300731|) (= ~a$w_buff0~0_In600300731 |P2Thread1of1ForFork1_#t~ite21_Out600300731|) (not .cse0)) (and (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In600300731 256) 0))) (or (and (= (mod ~a$w_buff1_used~0_In600300731 256) 0) .cse1) (= 0 (mod ~a$w_buff0_used~0_In600300731 256)) (and .cse1 (= 0 (mod ~a$r_buff1_thd3~0_In600300731 256))))) (= |P2Thread1of1ForFork1_#t~ite20_Out600300731| |P2Thread1of1ForFork1_#t~ite21_Out600300731|) (= ~a$w_buff0~0_In600300731 |P2Thread1of1ForFork1_#t~ite20_Out600300731|) .cse0))) InVars {P2Thread1of1ForFork1_#t~ite20=|P2Thread1of1ForFork1_#t~ite20_In600300731|, ~a$w_buff0~0=~a$w_buff0~0_In600300731, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In600300731, ~a$w_buff0_used~0=~a$w_buff0_used~0_In600300731, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In600300731, ~a$w_buff1_used~0=~a$w_buff1_used~0_In600300731, ~weak$$choice2~0=~weak$$choice2~0_In600300731} OutVars{P2Thread1of1ForFork1_#t~ite20=|P2Thread1of1ForFork1_#t~ite20_Out600300731|, P2Thread1of1ForFork1_#t~ite21=|P2Thread1of1ForFork1_#t~ite21_Out600300731|, ~a$w_buff0~0=~a$w_buff0~0_In600300731, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In600300731, ~a$w_buff0_used~0=~a$w_buff0_used~0_In600300731, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In600300731, ~a$w_buff1_used~0=~a$w_buff1_used~0_In600300731, ~weak$$choice2~0=~weak$$choice2~0_In600300731} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite20, P2Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-27 15:33:21,889 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [885] [885] L810-->L810-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-2064483483 256) 0))) (or (and (not .cse0) (= ~a$w_buff0_used~0_In-2064483483 |P2Thread1of1ForFork1_#t~ite27_Out-2064483483|) (= |P2Thread1of1ForFork1_#t~ite26_In-2064483483| |P2Thread1of1ForFork1_#t~ite26_Out-2064483483|)) (and .cse0 (= |P2Thread1of1ForFork1_#t~ite27_Out-2064483483| |P2Thread1of1ForFork1_#t~ite26_Out-2064483483|) (= ~a$w_buff0_used~0_In-2064483483 |P2Thread1of1ForFork1_#t~ite26_Out-2064483483|) (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In-2064483483 256) 0))) (or (= (mod ~a$w_buff0_used~0_In-2064483483 256) 0) (and (= (mod ~a$w_buff1_used~0_In-2064483483 256) 0) .cse1) (and .cse1 (= (mod ~a$r_buff1_thd3~0_In-2064483483 256) 0))))))) InVars {P2Thread1of1ForFork1_#t~ite26=|P2Thread1of1ForFork1_#t~ite26_In-2064483483|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-2064483483, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2064483483, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-2064483483, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2064483483, ~weak$$choice2~0=~weak$$choice2~0_In-2064483483} OutVars{P2Thread1of1ForFork1_#t~ite26=|P2Thread1of1ForFork1_#t~ite26_Out-2064483483|, P2Thread1of1ForFork1_#t~ite27=|P2Thread1of1ForFork1_#t~ite27_Out-2064483483|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-2064483483, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2064483483, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-2064483483, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2064483483, ~weak$$choice2~0=~weak$$choice2~0_In-2064483483} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite26, P2Thread1of1ForFork1_#t~ite27] because there is no mapped edge [2019-12-27 15:33:21,890 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L812-->L813: Formula: (and (= v_~a$r_buff0_thd3~0_59 v_~a$r_buff0_thd3~0_60) (not (= 0 (mod v_~weak$$choice2~0_15 256)))) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_15} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_9|, P2Thread1of1ForFork1_#t~ite31=|v_P2Thread1of1ForFork1_#t~ite31_8|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_9|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_59, ~weak$$choice2~0=v_~weak$$choice2~0_15} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite31, P2Thread1of1ForFork1_#t~ite33, ~a$r_buff0_thd3~0] because there is no mapped edge [2019-12-27 15:33:21,892 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L815-->L819: Formula: (and (not (= 0 (mod v_~a$flush_delayed~0_8 256))) (= v_~a$flush_delayed~0_7 0) (= v_~a~0_42 v_~a$mem_tmp~0_5)) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_8} OutVars{~a~0=v_~a~0_42, ~a$mem_tmp~0=v_~a$mem_tmp~0_5, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_7|, ~a$flush_delayed~0=v_~a$flush_delayed~0_7} AuxVars[] AssignedVars[~a~0, P2Thread1of1ForFork1_#t~ite37, ~a$flush_delayed~0] because there is no mapped edge [2019-12-27 15:33:21,892 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L819-2-->L819-4: Formula: (let ((.cse1 (= (mod ~a$w_buff1_used~0_In-272617107 256) 0)) (.cse0 (= 0 (mod ~a$r_buff1_thd3~0_In-272617107 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite38_Out-272617107| ~a~0_In-272617107)) (and (= ~a$w_buff1~0_In-272617107 |P2Thread1of1ForFork1_#t~ite38_Out-272617107|) (not .cse1) (not .cse0)))) InVars {~a~0=~a~0_In-272617107, ~a$w_buff1~0=~a$w_buff1~0_In-272617107, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-272617107, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-272617107} OutVars{~a~0=~a~0_In-272617107, P2Thread1of1ForFork1_#t~ite38=|P2Thread1of1ForFork1_#t~ite38_Out-272617107|, ~a$w_buff1~0=~a$w_buff1~0_In-272617107, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-272617107, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-272617107} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite38] because there is no mapped edge [2019-12-27 15:33:21,892 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L819-4-->L820: Formula: (= v_~a~0_31 |v_P2Thread1of1ForFork1_#t~ite38_14|) InVars {P2Thread1of1ForFork1_#t~ite38=|v_P2Thread1of1ForFork1_#t~ite38_14|} OutVars{~a~0=v_~a~0_31, P2Thread1of1ForFork1_#t~ite38=|v_P2Thread1of1ForFork1_#t~ite38_13|, P2Thread1of1ForFork1_#t~ite39=|v_P2Thread1of1ForFork1_#t~ite39_13|} AuxVars[] AssignedVars[~a~0, P2Thread1of1ForFork1_#t~ite38, P2Thread1of1ForFork1_#t~ite39] because there is no mapped edge [2019-12-27 15:33:21,893 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L820-->L820-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In-938086588 256) 0)) (.cse1 (= (mod ~a$r_buff0_thd3~0_In-938086588 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite40_Out-938086588| ~a$w_buff0_used~0_In-938086588)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork1_#t~ite40_Out-938086588| 0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-938086588, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-938086588} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-938086588, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-938086588, P2Thread1of1ForFork1_#t~ite40=|P2Thread1of1ForFork1_#t~ite40_Out-938086588|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite40] because there is no mapped edge [2019-12-27 15:33:21,893 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L821-->L821-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In-1240338723 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd3~0_In-1240338723 256) 0)) (.cse3 (= (mod ~a$w_buff1_used~0_In-1240338723 256) 0)) (.cse2 (= (mod ~a$r_buff1_thd3~0_In-1240338723 256) 0))) (or (and (= ~a$w_buff1_used~0_In-1240338723 |P2Thread1of1ForFork1_#t~ite41_Out-1240338723|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork1_#t~ite41_Out-1240338723|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1240338723, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1240338723, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1240338723, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1240338723} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1240338723, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1240338723, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1240338723, P2Thread1of1ForFork1_#t~ite41=|P2Thread1of1ForFork1_#t~ite41_Out-1240338723|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1240338723} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite41] because there is no mapped edge [2019-12-27 15:33:21,894 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L822-->L822-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In1504864953 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In1504864953 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite42_Out1504864953| ~a$r_buff0_thd3~0_In1504864953)) (and (= |P2Thread1of1ForFork1_#t~ite42_Out1504864953| 0) (not .cse1) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1504864953, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1504864953} OutVars{P2Thread1of1ForFork1_#t~ite42=|P2Thread1of1ForFork1_#t~ite42_Out1504864953|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1504864953, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1504864953} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite42] because there is no mapped edge [2019-12-27 15:33:21,895 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L823-->L823-2: Formula: (let ((.cse2 (= (mod ~a$w_buff1_used~0_In-1013211954 256) 0)) (.cse3 (= (mod ~a$r_buff1_thd3~0_In-1013211954 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1013211954 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In-1013211954 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite43_Out-1013211954| ~a$r_buff1_thd3~0_In-1013211954) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P2Thread1of1ForFork1_#t~ite43_Out-1013211954|)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1013211954, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1013211954, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1013211954, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1013211954} OutVars{P2Thread1of1ForFork1_#t~ite43=|P2Thread1of1ForFork1_#t~ite43_Out-1013211954|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1013211954, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1013211954, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1013211954, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1013211954} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite43] because there is no mapped edge [2019-12-27 15:33:21,895 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L823-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_54 (+ v_~__unbuffered_cnt~0_55 1)) (= v_~a$r_buff1_thd3~0_109 |v_P2Thread1of1ForFork1_#t~ite43_34|)) InVars {P2Thread1of1ForFork1_#t~ite43=|v_P2Thread1of1ForFork1_#t~ite43_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55} OutVars{P2Thread1of1ForFork1_#t~ite43=|v_P2Thread1of1ForFork1_#t~ite43_33|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_109, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite43, P2Thread1of1ForFork1_#res.base, ~a$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-27 15:33:21,895 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L761-->L761-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd1~0_In1934147036 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In1934147036 256)))) (or (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork2_#t~ite5_Out1934147036| 0)) (and (= |P0Thread1of1ForFork2_#t~ite5_Out1934147036| ~a$w_buff0_used~0_In1934147036) (or .cse1 .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1934147036, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1934147036} OutVars{P0Thread1of1ForFork2_#t~ite5=|P0Thread1of1ForFork2_#t~ite5_Out1934147036|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1934147036, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1934147036} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-27 15:33:21,896 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L762-->L762-2: Formula: (let ((.cse0 (= (mod ~a$w_buff1_used~0_In2140222563 256) 0)) (.cse1 (= (mod ~a$r_buff1_thd1~0_In2140222563 256) 0)) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In2140222563 256))) (.cse2 (= 0 (mod ~a$r_buff0_thd1~0_In2140222563 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite6_Out2140222563| ~a$w_buff1_used~0_In2140222563) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P0Thread1of1ForFork2_#t~ite6_Out2140222563|)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In2140222563, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2140222563, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In2140222563, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2140222563} OutVars{~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In2140222563, P0Thread1of1ForFork2_#t~ite6=|P0Thread1of1ForFork2_#t~ite6_Out2140222563|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2140222563, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In2140222563, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2140222563} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-27 15:33:21,897 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L763-->L764: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In-1895802153 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd1~0_In-1895802153 256) 0))) (or (and (not .cse0) (= ~a$r_buff0_thd1~0_Out-1895802153 0) (not .cse1)) (and (or .cse1 .cse0) (= ~a$r_buff0_thd1~0_Out-1895802153 ~a$r_buff0_thd1~0_In-1895802153)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1895802153, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1895802153} OutVars{P0Thread1of1ForFork2_#t~ite7=|P0Thread1of1ForFork2_#t~ite7_Out-1895802153|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1895802153, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-1895802153} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 15:33:21,897 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L764-->L764-2: Formula: (let ((.cse3 (= (mod ~a$w_buff1_used~0_In-1748894179 256) 0)) (.cse2 (= (mod ~a$r_buff1_thd1~0_In-1748894179 256) 0)) (.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In-1748894179 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In-1748894179 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork2_#t~ite8_Out-1748894179| ~a$r_buff1_thd1~0_In-1748894179)) (and (= |P0Thread1of1ForFork2_#t~ite8_Out-1748894179| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1748894179, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1748894179, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1748894179, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1748894179} OutVars{P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out-1748894179|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1748894179, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1748894179, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1748894179, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1748894179} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 15:33:21,897 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L764-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#res.offset_5| 0) (= 0 |v_P0Thread1of1ForFork2_#res.base_5|) (= |v_P0Thread1of1ForFork2_#t~ite8_44| v_~a$r_buff1_thd1~0_72) (= v_~__unbuffered_cnt~0_77 (+ v_~__unbuffered_cnt~0_78 1))) InVars {P0Thread1of1ForFork2_#t~ite8=|v_P0Thread1of1ForFork2_#t~ite8_44|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78} OutVars{P0Thread1of1ForFork2_#t~ite8=|v_P0Thread1of1ForFork2_#t~ite8_43|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_72, P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8, ~a$r_buff1_thd1~0, P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 15:33:21,897 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L846-1-->L852: Formula: (and (= 3 v_~__unbuffered_cnt~0_33) (= v_~main$tmp_guard0~0_8 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 15:33:21,898 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L852-2-->L852-4: Formula: (let ((.cse0 (= (mod ~a$r_buff1_thd0~0_In-892017656 256) 0)) (.cse1 (= (mod ~a$w_buff1_used~0_In-892017656 256) 0))) (or (and (= ~a~0_In-892017656 |ULTIMATE.start_main_#t~ite47_Out-892017656|) (or .cse0 .cse1)) (and (not .cse0) (= ~a$w_buff1~0_In-892017656 |ULTIMATE.start_main_#t~ite47_Out-892017656|) (not .cse1)))) InVars {~a~0=~a~0_In-892017656, ~a$w_buff1~0=~a$w_buff1~0_In-892017656, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-892017656, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-892017656} OutVars{~a~0=~a~0_In-892017656, ~a$w_buff1~0=~a$w_buff1~0_In-892017656, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-892017656|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-892017656, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-892017656} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-27 15:33:21,898 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [802] [802] L852-4-->L853: Formula: (= v_~a~0_58 |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_58, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_12|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_12|} AuxVars[] AssignedVars[~a~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 15:33:21,898 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L853-->L853-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In-1472144724 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd0~0_In-1472144724 256) 0))) (or (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In-1472144724 |ULTIMATE.start_main_#t~ite49_Out-1472144724|)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite49_Out-1472144724|) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1472144724, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1472144724} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-1472144724, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-1472144724|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1472144724} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 15:33:21,899 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L854-->L854-2: Formula: (let ((.cse2 (= 0 (mod ~a$r_buff1_thd0~0_In-692487079 256))) (.cse3 (= (mod ~a$w_buff1_used~0_In-692487079 256) 0)) (.cse1 (= (mod ~a$r_buff0_thd0~0_In-692487079 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-692487079 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite50_Out-692487079|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~a$w_buff1_used~0_In-692487079 |ULTIMATE.start_main_#t~ite50_Out-692487079|)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-692487079, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-692487079, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-692487079, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-692487079} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-692487079|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-692487079, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-692487079, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-692487079, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-692487079} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 15:33:21,900 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L855-->L855-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd0~0_In1433915075 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In1433915075 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite51_Out1433915075|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~a$r_buff0_thd0~0_In1433915075 |ULTIMATE.start_main_#t~ite51_Out1433915075|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1433915075, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1433915075} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out1433915075|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1433915075, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1433915075} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 15:33:21,900 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] L856-->L856-2: Formula: (let ((.cse3 (= (mod ~a$r_buff1_thd0~0_In1653625122 256) 0)) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In1653625122 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd0~0_In1653625122 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In1653625122 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~a$r_buff1_thd0~0_In1653625122 |ULTIMATE.start_main_#t~ite52_Out1653625122|)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |ULTIMATE.start_main_#t~ite52_Out1653625122|)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1653625122, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1653625122, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1653625122, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1653625122} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out1653625122|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1653625122, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1653625122, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1653625122, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1653625122} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 15:33:21,901 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [894] [894] L856-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p0_EBX~0_54 0) (= v_~__unbuffered_p1_EBX~0_27 0) (= v_~main$tmp_guard1~0_21 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_21 256)) (= 1 v_~__unbuffered_p1_EAX~0_27) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_~a$r_buff1_thd0~0_104 |v_ULTIMATE.start_main_#t~ite52_44|) (= v_~__unbuffered_p2_EBX~0_30 0) (= 1 v_~__unbuffered_p0_EAX~0_54) (= 1 v_~__unbuffered_p2_EAX~0_24)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_54, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_44|, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_54, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_27, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_30, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_27, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_24} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_54, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_43|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_54, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_27, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_30, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_27, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_104, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_24, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} 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-27 15:33:22,015 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 03:33:22 BasicIcfg [2019-12-27 15:33:22,015 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 15:33:22,018 INFO L168 Benchmark]: Toolchain (without parser) took 127774.74 ms. Allocated memory was 139.5 MB in the beginning and 3.0 GB in the end (delta: 2.9 GB). Free memory was 101.1 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2019-12-27 15:33:22,018 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 139.5 MB. Free memory was 121.4 MB in the beginning and 121.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 15:33:22,022 INFO L168 Benchmark]: CACSL2BoogieTranslator took 798.97 ms. Allocated memory was 139.5 MB in the beginning and 203.9 MB in the end (delta: 64.5 MB). Free memory was 100.7 MB in the beginning and 157.1 MB in the end (delta: -56.4 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. [2019-12-27 15:33:22,022 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.34 ms. Allocated memory is still 203.9 MB. Free memory was 157.1 MB in the beginning and 154.6 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2019-12-27 15:33:22,022 INFO L168 Benchmark]: Boogie Preprocessor took 40.46 ms. Allocated memory is still 203.9 MB. Free memory was 154.6 MB in the beginning and 152.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 15:33:22,023 INFO L168 Benchmark]: RCFGBuilder took 1016.46 ms. Allocated memory is still 203.9 MB. Free memory was 152.0 MB in the beginning and 100.9 MB in the end (delta: 51.0 MB). Peak memory consumption was 51.0 MB. Max. memory is 7.1 GB. [2019-12-27 15:33:22,023 INFO L168 Benchmark]: TraceAbstraction took 125843.50 ms. Allocated memory was 203.9 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 100.9 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2019-12-27 15:33:22,030 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.17 ms. Allocated memory is still 139.5 MB. Free memory was 121.4 MB in the beginning and 121.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 798.97 ms. Allocated memory was 139.5 MB in the beginning and 203.9 MB in the end (delta: 64.5 MB). Free memory was 100.7 MB in the beginning and 157.1 MB in the end (delta: -56.4 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 69.34 ms. Allocated memory is still 203.9 MB. Free memory was 157.1 MB in the beginning and 154.6 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.46 ms. Allocated memory is still 203.9 MB. Free memory was 154.6 MB in the beginning and 152.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1016.46 ms. Allocated memory is still 203.9 MB. Free memory was 152.0 MB in the beginning and 100.9 MB in the end (delta: 51.0 MB). Peak memory consumption was 51.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 125843.50 ms. Allocated memory was 203.9 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 100.9 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.0s, 180 ProgramPointsBefore, 95 ProgramPointsAfterwards, 217 TransitionsBefore, 104 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 8 FixpointIterations, 37 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 32 ChoiceCompositions, 7415 VarBasedMoverChecksPositive, 242 VarBasedMoverChecksNegative, 41 SemBasedMoverChecksPositive, 273 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 93316 CheckedPairsTotal, 117 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L842] FCALL, FORK 0 pthread_create(&t50, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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] [L744] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L745] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L746] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L747] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L748] 1 a$r_buff0_thd1 = (_Bool)1 [L751] 1 x = 1 [L754] 1 __unbuffered_p0_EAX = x [L757] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L760] 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_p0_EAX=1, __unbuffered_p0_EBX=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, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L844] FCALL, FORK 0 pthread_create(&t51, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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] [L774] 2 y = 1 [L777] 2 __unbuffered_p1_EAX = y [L780] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, y=1, z=0] [L783] EXPR 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_p0_EAX=1, __unbuffered_p0_EBX=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=1, y=1, z=0] [L760] 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) [L783] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L784] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L785] 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 [L786] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L846] FCALL, FORK 0 pthread_create(&t52, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L797] 3 z = 1 [L800] 3 __unbuffered_p2_EAX = z [L803] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L804] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L805] 3 a$flush_delayed = weak$$choice2 [L806] 3 a$mem_tmp = a VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __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=1, 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=1, y=1, z=1] [L807] 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, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __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=1, 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=1, y=1, z=1] [L807] 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) [L808] 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)) [L809] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __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=1, 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=1, y=1, z=1] [L809] 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)) [L810] 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)) [L811] EXPR 3 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)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __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=1, 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_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))=0, x=1, y=1, z=1] [L811] 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)) [L813] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __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=1, 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=1, y=1, z=1] [L813] 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)) [L814] 3 __unbuffered_p2_EBX = a VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __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=1, 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=1, y=1, z=1] [L819] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __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=1, 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=1, y=1, z=1] [L820] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L821] 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 [L822] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L761] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L762] 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 [L852] 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_p0_EAX=1, __unbuffered_p0_EBX=0, __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=1, y=1, z=1] [L853] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L854] 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 [L855] 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, 171 locations, 2 error locations. Result: UNSAFE, OverallTime: 125.5s, OverallIterations: 29, TraceHistogramMax: 1, AutomataDifference: 53.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8184 SDtfs, 12957 SDslu, 32859 SDs, 0 SdLazy, 21810 SolverSat, 876 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 20.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 691 GetRequests, 138 SyntacticMatches, 33 SemanticMatches, 520 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7942 ImplicationChecksByTransitivity, 11.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=162301occurred 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: 36.0s AutomataMinimizationTime, 28 MinimizatonAttempts, 465216 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 1420 NumberOfCodeBlocks, 1420 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 1325 ConstructedInterpolants, 0 QuantifiedInterpolants, 268404 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...