/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe024_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 22:52:11,936 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 22:52:11,938 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 22:52:11,950 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 22:52:11,951 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 22:52:11,952 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 22:52:11,953 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 22:52:11,955 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 22:52:11,957 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 22:52:11,958 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 22:52:11,959 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 22:52:11,960 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 22:52:11,960 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 22:52:11,961 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 22:52:11,962 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 22:52:11,963 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 22:52:11,964 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 22:52:11,965 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 22:52:11,966 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 22:52:11,968 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 22:52:11,972 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 22:52:11,973 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 22:52:11,974 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 22:52:11,974 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 22:52:11,978 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 22:52:11,979 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 22:52:11,979 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 22:52:11,981 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 22:52:11,981 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 22:52:11,983 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 22:52:11,983 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 22:52:11,985 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 22:52:11,986 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 22:52:11,987 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 22:52:11,991 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 22:52:11,991 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 22:52:11,992 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 22:52:11,992 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 22:52:11,992 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 22:52:11,997 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 22:52:11,999 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 22:52:12,000 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 22:52:12,020 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 22:52:12,020 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 22:52:12,023 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 22:52:12,023 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 22:52:12,023 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 22:52:12,023 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 22:52:12,023 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 22:52:12,024 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 22:52:12,024 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 22:52:12,024 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 22:52:12,025 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 22:52:12,025 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 22:52:12,025 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 22:52:12,026 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 22:52:12,026 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 22:52:12,026 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 22:52:12,026 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 22:52:12,026 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 22:52:12,026 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 22:52:12,026 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 22:52:12,027 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 22:52:12,027 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 22:52:12,027 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 22:52:12,027 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 22:52:12,027 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 22:52:12,027 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 22:52:12,028 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 22:52:12,028 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 22:52:12,028 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 22:52:12,028 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 22:52:12,308 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 22:52:12,321 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 22:52:12,325 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 22:52:12,327 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 22:52:12,327 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 22:52:12,328 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe024_pso.oepc.i [2019-12-18 22:52:12,413 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37f4bab7e/a952961028c44d41980d626a31b2437b/FLAGd1c72499c [2019-12-18 22:52:12,974 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 22:52:12,976 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe024_pso.oepc.i [2019-12-18 22:52:13,004 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37f4bab7e/a952961028c44d41980d626a31b2437b/FLAGd1c72499c [2019-12-18 22:52:13,297 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37f4bab7e/a952961028c44d41980d626a31b2437b [2019-12-18 22:52:13,310 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 22:52:13,312 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 22:52:13,313 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 22:52:13,313 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 22:52:13,317 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 22:52:13,318 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 10:52:13" (1/1) ... [2019-12-18 22:52:13,321 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c47c529 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:52:13, skipping insertion in model container [2019-12-18 22:52:13,321 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 10:52:13" (1/1) ... [2019-12-18 22:52:13,329 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 22:52:13,399 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 22:52:13,972 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 22:52:13,992 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 22:52:14,089 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 22:52:14,156 INFO L208 MainTranslator]: Completed translation [2019-12-18 22:52:14,157 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:52:14 WrapperNode [2019-12-18 22:52:14,157 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 22:52:14,158 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 22:52:14,158 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 22:52:14,158 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 22:52:14,167 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:52:14" (1/1) ... [2019-12-18 22:52:14,192 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:52:14" (1/1) ... [2019-12-18 22:52:14,224 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 22:52:14,224 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 22:52:14,225 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 22:52:14,225 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 22:52:14,235 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:52:14" (1/1) ... [2019-12-18 22:52:14,235 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:52:14" (1/1) ... [2019-12-18 22:52:14,241 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:52:14" (1/1) ... [2019-12-18 22:52:14,241 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:52:14" (1/1) ... [2019-12-18 22:52:14,268 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:52:14" (1/1) ... [2019-12-18 22:52:14,276 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:52:14" (1/1) ... [2019-12-18 22:52:14,279 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:52:14" (1/1) ... [2019-12-18 22:52:14,284 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 22:52:14,285 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 22:52:14,285 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 22:52:14,285 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 22:52:14,286 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:52:14" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 22:52:14,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 22:52:14,364 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 22:52:14,364 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 22:52:14,364 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 22:52:14,365 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 22:52:14,365 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 22:52:14,365 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 22:52:14,365 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 22:52:14,365 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 22:52:14,366 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 22:52:14,366 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 22:52:14,366 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 22:52:14,366 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 22:52:14,368 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 22:52:15,130 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 22:52:15,130 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 22:52:15,132 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:52:15 BoogieIcfgContainer [2019-12-18 22:52:15,132 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 22:52:15,133 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 22:52:15,134 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 22:52:15,137 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 22:52:15,138 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 10:52:13" (1/3) ... [2019-12-18 22:52:15,139 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7475d637 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 10:52:15, skipping insertion in model container [2019-12-18 22:52:15,139 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:52:14" (2/3) ... [2019-12-18 22:52:15,140 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7475d637 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 10:52:15, skipping insertion in model container [2019-12-18 22:52:15,140 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:52:15" (3/3) ... [2019-12-18 22:52:15,142 INFO L109 eAbstractionObserver]: Analyzing ICFG safe024_pso.oepc.i [2019-12-18 22:52:15,152 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 22:52:15,152 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 22:52:15,161 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 22:52:15,162 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 22:52:15,203 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,204 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,204 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,204 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,204 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,205 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,205 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,205 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,206 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,206 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,206 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,206 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,207 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,207 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,207 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,208 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,208 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,208 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,208 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,208 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,209 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,209 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,209 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,210 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,210 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,210 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,210 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,211 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,211 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,211 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,211 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,212 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,212 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,212 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,213 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,213 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,213 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,213 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,214 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,214 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,214 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,214 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,215 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,215 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,215 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,215 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,216 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,216 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,216 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,216 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,217 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,217 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,217 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,217 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,218 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,218 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,218 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,219 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,219 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,219 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,219 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,220 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,220 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,220 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,220 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,221 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,221 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,221 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,221 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,222 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,222 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,222 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,222 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,223 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,223 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,223 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,223 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,224 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,224 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,224 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,224 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,225 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,225 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,225 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,225 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,226 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,226 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,226 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,226 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,227 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,227 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,227 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,227 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,228 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,229 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,229 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,229 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,229 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,229 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,230 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,230 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,230 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,237 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,256 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,256 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,256 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,258 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,258 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,259 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,259 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,259 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,260 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,260 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,260 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,260 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,261 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,261 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,261 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,261 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,262 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,262 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,262 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,263 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,263 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,263 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,263 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,263 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,264 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,264 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,264 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,264 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,264 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,271 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,272 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,272 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,279 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,279 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,279 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,279 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,280 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,283 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,283 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,284 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,284 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,284 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,284 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,284 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,285 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,285 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,285 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,285 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,285 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,286 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,286 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,286 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,286 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,286 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,286 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,287 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,287 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,287 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,287 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,287 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,288 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,288 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,288 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,288 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:52:15,304 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 22:52:15,327 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 22:52:15,327 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 22:52:15,327 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 22:52:15,327 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 22:52:15,327 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 22:52:15,328 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 22:52:15,328 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 22:52:15,328 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 22:52:15,346 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 164 places, 195 transitions [2019-12-18 22:52:15,348 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-18 22:52:15,435 INFO L126 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-18 22:52:15,436 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 22:52:15,458 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 449 event pairs. 9/158 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 22:52:15,494 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-18 22:52:15,543 INFO L126 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-18 22:52:15,543 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 22:52:15,564 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 449 event pairs. 9/158 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 22:52:15,602 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-18 22:52:15,604 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 22:52:19,026 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2019-12-18 22:52:19,399 WARN L192 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-18 22:52:19,530 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-18 22:52:19,560 INFO L206 etLargeBlockEncoding]: Checked pairs total: 75034 [2019-12-18 22:52:19,560 INFO L214 etLargeBlockEncoding]: Total number of compositions: 108 [2019-12-18 22:52:19,564 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 82 places, 87 transitions [2019-12-18 22:52:31,415 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 85916 states. [2019-12-18 22:52:31,417 INFO L276 IsEmpty]: Start isEmpty. Operand 85916 states. [2019-12-18 22:52:31,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 22:52:31,424 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:52:31,425 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 22:52:31,425 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:52:31,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:52:31,430 INFO L82 PathProgramCache]: Analyzing trace with hash 797474655, now seen corresponding path program 1 times [2019-12-18 22:52:31,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:52:31,438 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951276148] [2019-12-18 22:52:31,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:52:31,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:52:31,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:52:31,777 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951276148] [2019-12-18 22:52:31,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:52:31,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 22:52:31,781 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319980542] [2019-12-18 22:52:31,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:52:31,786 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:52:31,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:52:31,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:52:31,804 INFO L87 Difference]: Start difference. First operand 85916 states. Second operand 3 states. [2019-12-18 22:52:35,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:52:35,295 INFO L93 Difference]: Finished difference Result 84652 states and 359098 transitions. [2019-12-18 22:52:35,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:52:35,297 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 22:52:35,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:52:35,871 INFO L225 Difference]: With dead ends: 84652 [2019-12-18 22:52:35,872 INFO L226 Difference]: Without dead ends: 79738 [2019-12-18 22:52:35,873 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:52:40,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79738 states. [2019-12-18 22:52:42,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79738 to 79738. [2019-12-18 22:52:42,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79738 states. [2019-12-18 22:52:45,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79738 states to 79738 states and 337790 transitions. [2019-12-18 22:52:45,944 INFO L78 Accepts]: Start accepts. Automaton has 79738 states and 337790 transitions. Word has length 5 [2019-12-18 22:52:45,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:52:45,945 INFO L462 AbstractCegarLoop]: Abstraction has 79738 states and 337790 transitions. [2019-12-18 22:52:45,945 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:52:45,945 INFO L276 IsEmpty]: Start isEmpty. Operand 79738 states and 337790 transitions. [2019-12-18 22:52:45,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 22:52:45,956 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:52:45,956 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:52:45,956 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:52:45,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:52:45,957 INFO L82 PathProgramCache]: Analyzing trace with hash 334215787, now seen corresponding path program 1 times [2019-12-18 22:52:45,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:52:45,957 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628178205] [2019-12-18 22:52:45,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:52:45,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:52:46,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:52:46,044 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628178205] [2019-12-18 22:52:46,044 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:52:46,044 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:52:46,044 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614692796] [2019-12-18 22:52:46,046 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:52:46,046 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:52:46,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:52:46,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:52:46,047 INFO L87 Difference]: Start difference. First operand 79738 states and 337790 transitions. Second operand 4 states. [2019-12-18 22:52:46,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:52:46,945 INFO L93 Difference]: Finished difference Result 122590 states and 499694 transitions. [2019-12-18 22:52:46,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:52:46,946 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 22:52:46,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:52:48,427 INFO L225 Difference]: With dead ends: 122590 [2019-12-18 22:52:48,427 INFO L226 Difference]: Without dead ends: 122513 [2019-12-18 22:52:48,428 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:52:52,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122513 states. [2019-12-18 22:52:55,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122513 to 111273. [2019-12-18 22:52:55,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111273 states. [2019-12-18 22:53:01,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111273 states to 111273 states and 458752 transitions. [2019-12-18 22:53:01,180 INFO L78 Accepts]: Start accepts. Automaton has 111273 states and 458752 transitions. Word has length 13 [2019-12-18 22:53:01,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:53:01,181 INFO L462 AbstractCegarLoop]: Abstraction has 111273 states and 458752 transitions. [2019-12-18 22:53:01,181 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:53:01,182 INFO L276 IsEmpty]: Start isEmpty. Operand 111273 states and 458752 transitions. [2019-12-18 22:53:01,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 22:53:01,186 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:53:01,186 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:53:01,186 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:53:01,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:53:01,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1013985611, now seen corresponding path program 1 times [2019-12-18 22:53:01,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:53:01,187 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987343682] [2019-12-18 22:53:01,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:53:01,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:53:01,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:53:01,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987343682] [2019-12-18 22:53:01,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:53:01,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:53:01,291 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289453808] [2019-12-18 22:53:01,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:53:01,291 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:53:01,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:53:01,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:53:01,292 INFO L87 Difference]: Start difference. First operand 111273 states and 458752 transitions. Second operand 3 states. [2019-12-18 22:53:01,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:53:01,393 INFO L93 Difference]: Finished difference Result 27590 states and 92015 transitions. [2019-12-18 22:53:01,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:53:01,394 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 22:53:01,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:53:01,517 INFO L225 Difference]: With dead ends: 27590 [2019-12-18 22:53:01,517 INFO L226 Difference]: Without dead ends: 27590 [2019-12-18 22:53:01,517 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:53:01,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27590 states. [2019-12-18 22:53:02,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27590 to 27590. [2019-12-18 22:53:02,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27590 states. [2019-12-18 22:53:02,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27590 states to 27590 states and 92015 transitions. [2019-12-18 22:53:02,172 INFO L78 Accepts]: Start accepts. Automaton has 27590 states and 92015 transitions. Word has length 13 [2019-12-18 22:53:02,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:53:02,172 INFO L462 AbstractCegarLoop]: Abstraction has 27590 states and 92015 transitions. [2019-12-18 22:53:02,172 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:53:02,172 INFO L276 IsEmpty]: Start isEmpty. Operand 27590 states and 92015 transitions. [2019-12-18 22:53:02,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 22:53:02,174 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:53:02,174 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:53:02,174 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:53:02,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:53:02,174 INFO L82 PathProgramCache]: Analyzing trace with hash -569288949, now seen corresponding path program 1 times [2019-12-18 22:53:02,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:53:02,175 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357400288] [2019-12-18 22:53:02,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:53:02,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:53:02,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:53:02,262 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357400288] [2019-12-18 22:53:02,263 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:53:02,263 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:53:02,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399771413] [2019-12-18 22:53:02,264 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:53:02,264 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:53:02,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:53:02,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:53:02,265 INFO L87 Difference]: Start difference. First operand 27590 states and 92015 transitions. Second operand 5 states. [2019-12-18 22:53:03,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:53:03,601 INFO L93 Difference]: Finished difference Result 40899 states and 133989 transitions. [2019-12-18 22:53:03,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 22:53:03,601 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-18 22:53:03,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:53:03,701 INFO L225 Difference]: With dead ends: 40899 [2019-12-18 22:53:03,701 INFO L226 Difference]: Without dead ends: 40883 [2019-12-18 22:53:03,702 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-18 22:53:03,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40883 states. [2019-12-18 22:53:04,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40883 to 30763. [2019-12-18 22:53:04,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30763 states. [2019-12-18 22:53:04,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30763 states to 30763 states and 102099 transitions. [2019-12-18 22:53:04,337 INFO L78 Accepts]: Start accepts. Automaton has 30763 states and 102099 transitions. Word has length 14 [2019-12-18 22:53:04,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:53:04,337 INFO L462 AbstractCegarLoop]: Abstraction has 30763 states and 102099 transitions. [2019-12-18 22:53:04,338 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:53:04,338 INFO L276 IsEmpty]: Start isEmpty. Operand 30763 states and 102099 transitions. [2019-12-18 22:53:04,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 22:53:04,349 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:53:04,349 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:53:04,349 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:53:04,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:53:04,350 INFO L82 PathProgramCache]: Analyzing trace with hash -777509353, now seen corresponding path program 1 times [2019-12-18 22:53:04,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:53:04,350 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220128420] [2019-12-18 22:53:04,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:53:04,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:53:04,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:53:04,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220128420] [2019-12-18 22:53:04,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:53:04,452 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 22:53:04,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595703158] [2019-12-18 22:53:04,452 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 22:53:04,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:53:04,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 22:53:04,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 22:53:04,453 INFO L87 Difference]: Start difference. First operand 30763 states and 102099 transitions. Second operand 6 states. [2019-12-18 22:53:05,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:53:05,414 INFO L93 Difference]: Finished difference Result 48043 states and 156144 transitions. [2019-12-18 22:53:05,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 22:53:05,415 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-18 22:53:05,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:53:05,498 INFO L225 Difference]: With dead ends: 48043 [2019-12-18 22:53:05,498 INFO L226 Difference]: Without dead ends: 48015 [2019-12-18 22:53:05,499 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-18 22:53:06,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48015 states. [2019-12-18 22:53:06,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48015 to 32442. [2019-12-18 22:53:06,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32442 states. [2019-12-18 22:53:06,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32442 states to 32442 states and 106747 transitions. [2019-12-18 22:53:06,686 INFO L78 Accepts]: Start accepts. Automaton has 32442 states and 106747 transitions. Word has length 22 [2019-12-18 22:53:06,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:53:06,686 INFO L462 AbstractCegarLoop]: Abstraction has 32442 states and 106747 transitions. [2019-12-18 22:53:06,686 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 22:53:06,686 INFO L276 IsEmpty]: Start isEmpty. Operand 32442 states and 106747 transitions. [2019-12-18 22:53:06,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 22:53:06,703 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:53:06,703 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:53:06,703 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:53:06,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:53:06,704 INFO L82 PathProgramCache]: Analyzing trace with hash -1832050688, now seen corresponding path program 1 times [2019-12-18 22:53:06,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:53:06,704 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727571082] [2019-12-18 22:53:06,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:53:06,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:53:06,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:53:06,793 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727571082] [2019-12-18 22:53:06,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:53:06,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:53:06,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391043844] [2019-12-18 22:53:06,795 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:53:06,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:53:06,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:53:06,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:53:06,796 INFO L87 Difference]: Start difference. First operand 32442 states and 106747 transitions. Second operand 4 states. [2019-12-18 22:53:06,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:53:06,857 INFO L93 Difference]: Finished difference Result 12531 states and 37988 transitions. [2019-12-18 22:53:06,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 22:53:06,858 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 22:53:06,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:53:06,880 INFO L225 Difference]: With dead ends: 12531 [2019-12-18 22:53:06,880 INFO L226 Difference]: Without dead ends: 12531 [2019-12-18 22:53:06,880 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:53:06,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12531 states. [2019-12-18 22:53:07,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12531 to 12391. [2019-12-18 22:53:07,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12391 states. [2019-12-18 22:53:07,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12391 states to 12391 states and 37578 transitions. [2019-12-18 22:53:07,076 INFO L78 Accepts]: Start accepts. Automaton has 12391 states and 37578 transitions. Word has length 25 [2019-12-18 22:53:07,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:53:07,077 INFO L462 AbstractCegarLoop]: Abstraction has 12391 states and 37578 transitions. [2019-12-18 22:53:07,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:53:07,077 INFO L276 IsEmpty]: Start isEmpty. Operand 12391 states and 37578 transitions. [2019-12-18 22:53:07,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 22:53:07,094 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:53:07,095 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:53:07,095 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:53:07,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:53:07,095 INFO L82 PathProgramCache]: Analyzing trace with hash 1562204347, now seen corresponding path program 1 times [2019-12-18 22:53:07,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:53:07,096 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480359772] [2019-12-18 22:53:07,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:53:07,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:53:07,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:53:07,254 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480359772] [2019-12-18 22:53:07,254 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:53:07,254 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 22:53:07,255 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773567661] [2019-12-18 22:53:07,255 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:53:07,255 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:53:07,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:53:07,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:53:07,256 INFO L87 Difference]: Start difference. First operand 12391 states and 37578 transitions. Second operand 5 states. [2019-12-18 22:53:07,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:53:07,762 INFO L93 Difference]: Finished difference Result 17659 states and 53000 transitions. [2019-12-18 22:53:07,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 22:53:07,763 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-18 22:53:07,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:53:07,787 INFO L225 Difference]: With dead ends: 17659 [2019-12-18 22:53:07,787 INFO L226 Difference]: Without dead ends: 17659 [2019-12-18 22:53:07,788 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 22:53:07,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17659 states. [2019-12-18 22:53:09,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17659 to 16146. [2019-12-18 22:53:09,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16146 states. [2019-12-18 22:53:09,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16146 states to 16146 states and 48801 transitions. [2019-12-18 22:53:09,059 INFO L78 Accepts]: Start accepts. Automaton has 16146 states and 48801 transitions. Word has length 39 [2019-12-18 22:53:09,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:53:09,059 INFO L462 AbstractCegarLoop]: Abstraction has 16146 states and 48801 transitions. [2019-12-18 22:53:09,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:53:09,059 INFO L276 IsEmpty]: Start isEmpty. Operand 16146 states and 48801 transitions. [2019-12-18 22:53:09,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 22:53:09,083 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:53:09,083 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:53:09,083 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:53:09,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:53:09,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1354690859, now seen corresponding path program 2 times [2019-12-18 22:53:09,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:53:09,084 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023333072] [2019-12-18 22:53:09,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:53:09,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:53:09,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:53:09,175 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023333072] [2019-12-18 22:53:09,175 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:53:09,175 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 22:53:09,176 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109222161] [2019-12-18 22:53:09,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 22:53:09,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:53:09,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 22:53:09,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 22:53:09,177 INFO L87 Difference]: Start difference. First operand 16146 states and 48801 transitions. Second operand 6 states. [2019-12-18 22:53:09,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:53:09,940 INFO L93 Difference]: Finished difference Result 28014 states and 84353 transitions. [2019-12-18 22:53:09,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 22:53:09,941 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2019-12-18 22:53:09,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:53:09,983 INFO L225 Difference]: With dead ends: 28014 [2019-12-18 22:53:09,983 INFO L226 Difference]: Without dead ends: 28014 [2019-12-18 22:53:09,983 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-18 22:53:10,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28014 states. [2019-12-18 22:53:10,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28014 to 17882. [2019-12-18 22:53:10,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17882 states. [2019-12-18 22:53:10,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17882 states to 17882 states and 54176 transitions. [2019-12-18 22:53:10,319 INFO L78 Accepts]: Start accepts. Automaton has 17882 states and 54176 transitions. Word has length 39 [2019-12-18 22:53:10,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:53:10,319 INFO L462 AbstractCegarLoop]: Abstraction has 17882 states and 54176 transitions. [2019-12-18 22:53:10,319 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 22:53:10,319 INFO L276 IsEmpty]: Start isEmpty. Operand 17882 states and 54176 transitions. [2019-12-18 22:53:10,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 22:53:10,347 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:53:10,347 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:53:10,347 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:53:10,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:53:10,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1850486613, now seen corresponding path program 3 times [2019-12-18 22:53:10,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:53:10,348 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256726398] [2019-12-18 22:53:10,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:53:10,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:53:10,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:53:10,414 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256726398] [2019-12-18 22:53:10,414 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:53:10,415 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 22:53:10,415 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441673491] [2019-12-18 22:53:10,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:53:10,415 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:53:10,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:53:10,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:53:10,416 INFO L87 Difference]: Start difference. First operand 17882 states and 54176 transitions. Second operand 5 states. [2019-12-18 22:53:10,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:53:10,528 INFO L93 Difference]: Finished difference Result 16509 states and 50641 transitions. [2019-12-18 22:53:10,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:53:10,528 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-18 22:53:10,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:53:10,558 INFO L225 Difference]: With dead ends: 16509 [2019-12-18 22:53:10,558 INFO L226 Difference]: Without dead ends: 16509 [2019-12-18 22:53:10,559 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:53:10,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16509 states. [2019-12-18 22:53:10,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16509 to 15675. [2019-12-18 22:53:10,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15675 states. [2019-12-18 22:53:10,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15675 states to 15675 states and 48288 transitions. [2019-12-18 22:53:10,812 INFO L78 Accepts]: Start accepts. Automaton has 15675 states and 48288 transitions. Word has length 39 [2019-12-18 22:53:10,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:53:10,813 INFO L462 AbstractCegarLoop]: Abstraction has 15675 states and 48288 transitions. [2019-12-18 22:53:10,813 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:53:10,813 INFO L276 IsEmpty]: Start isEmpty. Operand 15675 states and 48288 transitions. [2019-12-18 22:53:10,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 22:53:10,832 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:53:10,833 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:53:10,833 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:53:10,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:53:10,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1166865475, now seen corresponding path program 1 times [2019-12-18 22:53:10,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:53:10,834 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749955877] [2019-12-18 22:53:10,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:53:10,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:53:10,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:53:10,920 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749955877] [2019-12-18 22:53:10,920 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:53:10,920 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:53:10,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358211739] [2019-12-18 22:53:10,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:53:10,922 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:53:10,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:53:10,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:53:10,923 INFO L87 Difference]: Start difference. First operand 15675 states and 48288 transitions. Second operand 4 states. [2019-12-18 22:53:11,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:53:11,051 INFO L93 Difference]: Finished difference Result 28485 states and 87800 transitions. [2019-12-18 22:53:11,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 22:53:11,052 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-12-18 22:53:11,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:53:11,083 INFO L225 Difference]: With dead ends: 28485 [2019-12-18 22:53:11,083 INFO L226 Difference]: Without dead ends: 13391 [2019-12-18 22:53:11,084 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:53:11,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13391 states. [2019-12-18 22:53:11,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13391 to 13391. [2019-12-18 22:53:11,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13391 states. [2019-12-18 22:53:11,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13391 states to 13391 states and 41122 transitions. [2019-12-18 22:53:11,496 INFO L78 Accepts]: Start accepts. Automaton has 13391 states and 41122 transitions. Word has length 54 [2019-12-18 22:53:11,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:53:11,496 INFO L462 AbstractCegarLoop]: Abstraction has 13391 states and 41122 transitions. [2019-12-18 22:53:11,496 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:53:11,497 INFO L276 IsEmpty]: Start isEmpty. Operand 13391 states and 41122 transitions. [2019-12-18 22:53:11,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 22:53:11,511 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:53:11,512 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:53:11,512 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:53:11,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:53:11,512 INFO L82 PathProgramCache]: Analyzing trace with hash 2026182027, now seen corresponding path program 2 times [2019-12-18 22:53:11,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:53:11,513 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886611411] [2019-12-18 22:53:11,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:53:11,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:53:11,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:53:11,611 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886611411] [2019-12-18 22:53:11,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:53:11,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 22:53:11,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5203418] [2019-12-18 22:53:11,612 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 22:53:11,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:53:11,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 22:53:11,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:53:11,612 INFO L87 Difference]: Start difference. First operand 13391 states and 41122 transitions. Second operand 7 states. [2019-12-18 22:53:12,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:53:12,067 INFO L93 Difference]: Finished difference Result 32485 states and 98796 transitions. [2019-12-18 22:53:12,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 22:53:12,068 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-18 22:53:12,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:53:12,103 INFO L225 Difference]: With dead ends: 32485 [2019-12-18 22:53:12,103 INFO L226 Difference]: Without dead ends: 24797 [2019-12-18 22:53:12,104 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 22:53:12,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24797 states. [2019-12-18 22:53:12,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24797 to 15424. [2019-12-18 22:53:12,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15424 states. [2019-12-18 22:53:12,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15424 states to 15424 states and 47254 transitions. [2019-12-18 22:53:12,418 INFO L78 Accepts]: Start accepts. Automaton has 15424 states and 47254 transitions. Word has length 54 [2019-12-18 22:53:12,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:53:12,419 INFO L462 AbstractCegarLoop]: Abstraction has 15424 states and 47254 transitions. [2019-12-18 22:53:12,419 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 22:53:12,419 INFO L276 IsEmpty]: Start isEmpty. Operand 15424 states and 47254 transitions. [2019-12-18 22:53:12,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 22:53:12,436 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:53:12,436 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:53:12,437 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:53:12,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:53:12,437 INFO L82 PathProgramCache]: Analyzing trace with hash -345709295, now seen corresponding path program 3 times [2019-12-18 22:53:12,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:53:12,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492708111] [2019-12-18 22:53:12,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:53:12,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:53:12,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:53:12,534 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492708111] [2019-12-18 22:53:12,534 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:53:12,534 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 22:53:12,535 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930904304] [2019-12-18 22:53:12,535 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 22:53:12,535 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:53:12,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 22:53:12,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:53:12,536 INFO L87 Difference]: Start difference. First operand 15424 states and 47254 transitions. Second operand 7 states. [2019-12-18 22:53:12,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:53:12,997 INFO L93 Difference]: Finished difference Result 36083 states and 108358 transitions. [2019-12-18 22:53:12,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 22:53:12,998 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-18 22:53:12,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:53:13,036 INFO L225 Difference]: With dead ends: 36083 [2019-12-18 22:53:13,036 INFO L226 Difference]: Without dead ends: 25619 [2019-12-18 22:53:13,036 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 22:53:13,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25619 states. [2019-12-18 22:53:13,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25619 to 17229. [2019-12-18 22:53:13,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17229 states. [2019-12-18 22:53:13,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17229 states to 17229 states and 52420 transitions. [2019-12-18 22:53:13,370 INFO L78 Accepts]: Start accepts. Automaton has 17229 states and 52420 transitions. Word has length 54 [2019-12-18 22:53:13,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:53:13,371 INFO L462 AbstractCegarLoop]: Abstraction has 17229 states and 52420 transitions. [2019-12-18 22:53:13,371 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 22:53:13,371 INFO L276 IsEmpty]: Start isEmpty. Operand 17229 states and 52420 transitions. [2019-12-18 22:53:13,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 22:53:13,585 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:53:13,585 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:53:13,586 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:53:13,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:53:13,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1893996223, now seen corresponding path program 4 times [2019-12-18 22:53:13,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:53:13,587 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086145162] [2019-12-18 22:53:13,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:53:13,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:53:13,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:53:13,669 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086145162] [2019-12-18 22:53:13,669 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:53:13,670 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 22:53:13,670 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281553726] [2019-12-18 22:53:13,670 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 22:53:13,670 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:53:13,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 22:53:13,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:53:13,671 INFO L87 Difference]: Start difference. First operand 17229 states and 52420 transitions. Second operand 7 states. [2019-12-18 22:53:14,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:53:14,128 INFO L93 Difference]: Finished difference Result 35362 states and 106807 transitions. [2019-12-18 22:53:14,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 22:53:14,129 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-18 22:53:14,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:53:14,192 INFO L225 Difference]: With dead ends: 35362 [2019-12-18 22:53:14,193 INFO L226 Difference]: Without dead ends: 31672 [2019-12-18 22:53:14,193 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-18 22:53:14,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31672 states. [2019-12-18 22:53:14,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31672 to 17439. [2019-12-18 22:53:14,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17439 states. [2019-12-18 22:53:14,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17439 states to 17439 states and 53184 transitions. [2019-12-18 22:53:14,622 INFO L78 Accepts]: Start accepts. Automaton has 17439 states and 53184 transitions. Word has length 54 [2019-12-18 22:53:14,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:53:14,622 INFO L462 AbstractCegarLoop]: Abstraction has 17439 states and 53184 transitions. [2019-12-18 22:53:14,622 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 22:53:14,622 INFO L276 IsEmpty]: Start isEmpty. Operand 17439 states and 53184 transitions. [2019-12-18 22:53:14,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 22:53:14,648 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:53:14,648 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:53:14,649 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:53:14,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:53:14,649 INFO L82 PathProgramCache]: Analyzing trace with hash -763040279, now seen corresponding path program 1 times [2019-12-18 22:53:14,649 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:53:14,649 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227498896] [2019-12-18 22:53:14,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:53:14,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:53:14,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:53:14,700 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227498896] [2019-12-18 22:53:14,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:53:14,700 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:53:14,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788785537] [2019-12-18 22:53:14,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:53:14,701 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:53:14,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:53:14,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:53:14,701 INFO L87 Difference]: Start difference. First operand 17439 states and 53184 transitions. Second operand 3 states. [2019-12-18 22:53:14,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:53:14,825 INFO L93 Difference]: Finished difference Result 25639 states and 78092 transitions. [2019-12-18 22:53:14,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:53:14,825 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-18 22:53:14,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:53:14,873 INFO L225 Difference]: With dead ends: 25639 [2019-12-18 22:53:14,874 INFO L226 Difference]: Without dead ends: 25639 [2019-12-18 22:53:14,874 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:53:14,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25639 states. [2019-12-18 22:53:15,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25639 to 22781. [2019-12-18 22:53:15,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22781 states. [2019-12-18 22:53:15,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22781 states to 22781 states and 69876 transitions. [2019-12-18 22:53:15,241 INFO L78 Accepts]: Start accepts. Automaton has 22781 states and 69876 transitions. Word has length 54 [2019-12-18 22:53:15,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:53:15,242 INFO L462 AbstractCegarLoop]: Abstraction has 22781 states and 69876 transitions. [2019-12-18 22:53:15,242 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:53:15,242 INFO L276 IsEmpty]: Start isEmpty. Operand 22781 states and 69876 transitions. [2019-12-18 22:53:15,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 22:53:15,265 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:53:15,265 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:53:15,265 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:53:15,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:53:15,265 INFO L82 PathProgramCache]: Analyzing trace with hash 709346415, now seen corresponding path program 5 times [2019-12-18 22:53:15,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:53:15,266 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662597223] [2019-12-18 22:53:15,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:53:15,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:53:15,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:53:15,384 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662597223] [2019-12-18 22:53:15,384 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:53:15,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 22:53:15,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064451005] [2019-12-18 22:53:15,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 22:53:15,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:53:15,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 22:53:15,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:53:15,386 INFO L87 Difference]: Start difference. First operand 22781 states and 69876 transitions. Second operand 7 states. [2019-12-18 22:53:16,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:53:16,279 INFO L93 Difference]: Finished difference Result 31754 states and 94887 transitions. [2019-12-18 22:53:16,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 22:53:16,280 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-18 22:53:16,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:53:16,324 INFO L225 Difference]: With dead ends: 31754 [2019-12-18 22:53:16,324 INFO L226 Difference]: Without dead ends: 31754 [2019-12-18 22:53:16,324 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2019-12-18 22:53:16,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31754 states. [2019-12-18 22:53:16,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31754 to 24278. [2019-12-18 22:53:16,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24278 states. [2019-12-18 22:53:16,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24278 states to 24278 states and 74075 transitions. [2019-12-18 22:53:16,915 INFO L78 Accepts]: Start accepts. Automaton has 24278 states and 74075 transitions. Word has length 54 [2019-12-18 22:53:16,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:53:16,915 INFO L462 AbstractCegarLoop]: Abstraction has 24278 states and 74075 transitions. [2019-12-18 22:53:16,915 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 22:53:16,915 INFO L276 IsEmpty]: Start isEmpty. Operand 24278 states and 74075 transitions. [2019-12-18 22:53:16,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 22:53:16,940 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:53:16,940 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:53:16,940 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:53:16,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:53:16,940 INFO L82 PathProgramCache]: Analyzing trace with hash 1752990847, now seen corresponding path program 6 times [2019-12-18 22:53:16,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:53:16,941 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725084597] [2019-12-18 22:53:16,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:53:16,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:53:17,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:53:17,088 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725084597] [2019-12-18 22:53:17,088 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:53:17,088 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 22:53:17,089 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158974640] [2019-12-18 22:53:17,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 22:53:17,089 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:53:17,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 22:53:17,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-18 22:53:17,090 INFO L87 Difference]: Start difference. First operand 24278 states and 74075 transitions. Second operand 9 states. [2019-12-18 22:53:18,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:53:18,952 INFO L93 Difference]: Finished difference Result 40208 states and 120418 transitions. [2019-12-18 22:53:18,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 22:53:18,953 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-12-18 22:53:18,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:53:19,011 INFO L225 Difference]: With dead ends: 40208 [2019-12-18 22:53:19,011 INFO L226 Difference]: Without dead ends: 40208 [2019-12-18 22:53:19,013 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=512, Unknown=0, NotChecked=0, Total=650 [2019-12-18 22:53:19,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40208 states. [2019-12-18 22:53:19,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40208 to 22831. [2019-12-18 22:53:19,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22831 states. [2019-12-18 22:53:19,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22831 states to 22831 states and 69909 transitions. [2019-12-18 22:53:19,493 INFO L78 Accepts]: Start accepts. Automaton has 22831 states and 69909 transitions. Word has length 54 [2019-12-18 22:53:19,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:53:19,494 INFO L462 AbstractCegarLoop]: Abstraction has 22831 states and 69909 transitions. [2019-12-18 22:53:19,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 22:53:19,494 INFO L276 IsEmpty]: Start isEmpty. Operand 22831 states and 69909 transitions. [2019-12-18 22:53:19,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 22:53:19,520 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:53:19,520 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:53:19,521 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:53:19,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:53:19,521 INFO L82 PathProgramCache]: Analyzing trace with hash -931727569, now seen corresponding path program 7 times [2019-12-18 22:53:19,521 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:53:19,521 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114702758] [2019-12-18 22:53:19,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:53:19,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:53:19,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:53:19,864 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114702758] [2019-12-18 22:53:19,864 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:53:19,864 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:53:19,864 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139685631] [2019-12-18 22:53:19,864 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:53:19,865 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:53:19,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:53:19,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:53:19,865 INFO L87 Difference]: Start difference. First operand 22831 states and 69909 transitions. Second operand 3 states. [2019-12-18 22:53:19,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:53:19,943 INFO L93 Difference]: Finished difference Result 16943 states and 51210 transitions. [2019-12-18 22:53:19,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:53:19,943 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-18 22:53:19,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:53:19,972 INFO L225 Difference]: With dead ends: 16943 [2019-12-18 22:53:19,972 INFO L226 Difference]: Without dead ends: 16943 [2019-12-18 22:53:19,973 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:53:20,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16943 states. [2019-12-18 22:53:20,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16943 to 16396. [2019-12-18 22:53:20,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16396 states. [2019-12-18 22:53:20,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16396 states to 16396 states and 49459 transitions. [2019-12-18 22:53:20,373 INFO L78 Accepts]: Start accepts. Automaton has 16396 states and 49459 transitions. Word has length 54 [2019-12-18 22:53:20,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:53:20,374 INFO L462 AbstractCegarLoop]: Abstraction has 16396 states and 49459 transitions. [2019-12-18 22:53:20,374 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:53:20,374 INFO L276 IsEmpty]: Start isEmpty. Operand 16396 states and 49459 transitions. [2019-12-18 22:53:20,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 22:53:20,407 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:53:20,407 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:53:20,408 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:53:20,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:53:20,408 INFO L82 PathProgramCache]: Analyzing trace with hash 2068351876, now seen corresponding path program 1 times [2019-12-18 22:53:20,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:53:20,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500256734] [2019-12-18 22:53:20,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:53:20,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:53:20,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:53:20,587 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500256734] [2019-12-18 22:53:20,587 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:53:20,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 22:53:20,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732390440] [2019-12-18 22:53:20,588 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 22:53:20,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:53:20,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 22:53:20,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:53:20,589 INFO L87 Difference]: Start difference. First operand 16396 states and 49459 transitions. Second operand 7 states. [2019-12-18 22:53:21,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:53:21,609 INFO L93 Difference]: Finished difference Result 22708 states and 67209 transitions. [2019-12-18 22:53:21,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 22:53:21,609 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 55 [2019-12-18 22:53:21,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:53:21,640 INFO L225 Difference]: With dead ends: 22708 [2019-12-18 22:53:21,640 INFO L226 Difference]: Without dead ends: 22572 [2019-12-18 22:53:21,640 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-18 22:53:21,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22572 states. [2019-12-18 22:53:21,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22572 to 17796. [2019-12-18 22:53:21,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17796 states. [2019-12-18 22:53:21,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17796 states to 17796 states and 53426 transitions. [2019-12-18 22:53:21,927 INFO L78 Accepts]: Start accepts. Automaton has 17796 states and 53426 transitions. Word has length 55 [2019-12-18 22:53:21,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:53:21,927 INFO L462 AbstractCegarLoop]: Abstraction has 17796 states and 53426 transitions. [2019-12-18 22:53:21,927 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 22:53:21,927 INFO L276 IsEmpty]: Start isEmpty. Operand 17796 states and 53426 transitions. [2019-12-18 22:53:21,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 22:53:21,944 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:53:21,944 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:53:21,945 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:53:21,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:53:21,945 INFO L82 PathProgramCache]: Analyzing trace with hash 1084774030, now seen corresponding path program 2 times [2019-12-18 22:53:21,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:53:21,945 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581432425] [2019-12-18 22:53:21,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:53:21,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:53:22,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:53:22,444 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581432425] [2019-12-18 22:53:22,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:53:22,444 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 22:53:22,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557143576] [2019-12-18 22:53:22,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 22:53:22,445 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:53:22,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 22:53:22,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-12-18 22:53:22,445 INFO L87 Difference]: Start difference. First operand 17796 states and 53426 transitions. Second operand 15 states. [2019-12-18 22:53:26,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:53:26,625 INFO L93 Difference]: Finished difference Result 38610 states and 114235 transitions. [2019-12-18 22:53:26,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-12-18 22:53:26,626 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 55 [2019-12-18 22:53:26,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:53:26,686 INFO L225 Difference]: With dead ends: 38610 [2019-12-18 22:53:26,686 INFO L226 Difference]: Without dead ends: 32491 [2019-12-18 22:53:26,687 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 944 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=519, Invalid=2787, Unknown=0, NotChecked=0, Total=3306 [2019-12-18 22:53:26,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32491 states. [2019-12-18 22:53:27,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32491 to 18434. [2019-12-18 22:53:27,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18434 states. [2019-12-18 22:53:27,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18434 states to 18434 states and 55033 transitions. [2019-12-18 22:53:27,055 INFO L78 Accepts]: Start accepts. Automaton has 18434 states and 55033 transitions. Word has length 55 [2019-12-18 22:53:27,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:53:27,055 INFO L462 AbstractCegarLoop]: Abstraction has 18434 states and 55033 transitions. [2019-12-18 22:53:27,055 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 22:53:27,055 INFO L276 IsEmpty]: Start isEmpty. Operand 18434 states and 55033 transitions. [2019-12-18 22:53:27,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 22:53:27,074 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:53:27,075 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:53:27,075 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:53:27,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:53:27,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1593822048, now seen corresponding path program 3 times [2019-12-18 22:53:27,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:53:27,076 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898910947] [2019-12-18 22:53:27,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:53:27,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:53:27,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:53:27,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898910947] [2019-12-18 22:53:27,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:53:27,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 22:53:27,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388729211] [2019-12-18 22:53:27,539 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 22:53:27,539 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:53:27,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 22:53:27,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-12-18 22:53:27,540 INFO L87 Difference]: Start difference. First operand 18434 states and 55033 transitions. Second operand 15 states. [2019-12-18 22:53:31,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:53:31,206 INFO L93 Difference]: Finished difference Result 34602 states and 102158 transitions. [2019-12-18 22:53:31,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-12-18 22:53:31,207 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 55 [2019-12-18 22:53:31,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:53:31,443 INFO L225 Difference]: With dead ends: 34602 [2019-12-18 22:53:31,443 INFO L226 Difference]: Without dead ends: 32476 [2019-12-18 22:53:31,444 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 860 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=514, Invalid=2566, Unknown=0, NotChecked=0, Total=3080 [2019-12-18 22:53:31,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32476 states. [2019-12-18 22:53:31,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32476 to 18530. [2019-12-18 22:53:31,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18530 states. [2019-12-18 22:53:31,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18530 states to 18530 states and 55269 transitions. [2019-12-18 22:53:31,778 INFO L78 Accepts]: Start accepts. Automaton has 18530 states and 55269 transitions. Word has length 55 [2019-12-18 22:53:31,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:53:31,778 INFO L462 AbstractCegarLoop]: Abstraction has 18530 states and 55269 transitions. [2019-12-18 22:53:31,778 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 22:53:31,778 INFO L276 IsEmpty]: Start isEmpty. Operand 18530 states and 55269 transitions. [2019-12-18 22:53:31,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 22:53:31,798 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:53:31,798 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:53:31,798 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:53:31,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:53:31,798 INFO L82 PathProgramCache]: Analyzing trace with hash -2137930756, now seen corresponding path program 4 times [2019-12-18 22:53:31,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:53:31,799 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546116277] [2019-12-18 22:53:31,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:53:31,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:53:32,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:53:32,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546116277] [2019-12-18 22:53:32,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:53:32,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 22:53:32,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566395071] [2019-12-18 22:53:32,202 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 22:53:32,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:53:32,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 22:53:32,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-12-18 22:53:32,203 INFO L87 Difference]: Start difference. First operand 18530 states and 55269 transitions. Second operand 15 states. [2019-12-18 22:53:35,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:53:35,667 INFO L93 Difference]: Finished difference Result 32464 states and 95885 transitions. [2019-12-18 22:53:35,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-12-18 22:53:35,667 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 55 [2019-12-18 22:53:35,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:53:35,711 INFO L225 Difference]: With dead ends: 32464 [2019-12-18 22:53:35,711 INFO L226 Difference]: Without dead ends: 32056 [2019-12-18 22:53:35,712 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 824 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=497, Invalid=2473, Unknown=0, NotChecked=0, Total=2970 [2019-12-18 22:53:35,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32056 states. [2019-12-18 22:53:36,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32056 to 18386. [2019-12-18 22:53:36,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18386 states. [2019-12-18 22:53:36,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18386 states to 18386 states and 54897 transitions. [2019-12-18 22:53:36,075 INFO L78 Accepts]: Start accepts. Automaton has 18386 states and 54897 transitions. Word has length 55 [2019-12-18 22:53:36,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:53:36,075 INFO L462 AbstractCegarLoop]: Abstraction has 18386 states and 54897 transitions. [2019-12-18 22:53:36,075 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 22:53:36,075 INFO L276 IsEmpty]: Start isEmpty. Operand 18386 states and 54897 transitions. [2019-12-18 22:53:36,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 22:53:36,095 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:53:36,095 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:53:36,095 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:53:36,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:53:36,095 INFO L82 PathProgramCache]: Analyzing trace with hash 139656710, now seen corresponding path program 5 times [2019-12-18 22:53:36,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:53:36,095 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748942435] [2019-12-18 22:53:36,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:53:36,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:53:36,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:53:36,784 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748942435] [2019-12-18 22:53:36,784 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:53:36,785 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 22:53:36,785 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652692782] [2019-12-18 22:53:36,785 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 22:53:36,785 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:53:36,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 22:53:36,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-12-18 22:53:36,789 INFO L87 Difference]: Start difference. First operand 18386 states and 54897 transitions. Second operand 15 states. [2019-12-18 22:53:40,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:53:40,800 INFO L93 Difference]: Finished difference Result 44440 states and 131991 transitions. [2019-12-18 22:53:40,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-12-18 22:53:40,801 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 55 [2019-12-18 22:53:40,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:53:40,863 INFO L225 Difference]: With dead ends: 44440 [2019-12-18 22:53:40,863 INFO L226 Difference]: Without dead ends: 43146 [2019-12-18 22:53:40,864 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1185 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=576, Invalid=3456, Unknown=0, NotChecked=0, Total=4032 [2019-12-18 22:53:40,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43146 states. [2019-12-18 22:53:41,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43146 to 24012. [2019-12-18 22:53:41,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24012 states. [2019-12-18 22:53:41,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24012 states to 24012 states and 71748 transitions. [2019-12-18 22:53:41,372 INFO L78 Accepts]: Start accepts. Automaton has 24012 states and 71748 transitions. Word has length 55 [2019-12-18 22:53:41,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:53:41,372 INFO L462 AbstractCegarLoop]: Abstraction has 24012 states and 71748 transitions. [2019-12-18 22:53:41,372 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 22:53:41,372 INFO L276 IsEmpty]: Start isEmpty. Operand 24012 states and 71748 transitions. [2019-12-18 22:53:41,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 22:53:41,396 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:53:41,397 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:53:41,397 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:53:41,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:53:41,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1813018142, now seen corresponding path program 6 times [2019-12-18 22:53:41,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:53:41,397 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538135853] [2019-12-18 22:53:41,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:53:41,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:53:41,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:53:41,767 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538135853] [2019-12-18 22:53:41,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:53:41,768 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 22:53:41,768 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549672593] [2019-12-18 22:53:41,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 22:53:41,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:53:41,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 22:53:41,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2019-12-18 22:53:41,769 INFO L87 Difference]: Start difference. First operand 24012 states and 71748 transitions. Second operand 15 states. [2019-12-18 22:53:45,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:53:45,979 INFO L93 Difference]: Finished difference Result 43972 states and 129714 transitions. [2019-12-18 22:53:45,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-12-18 22:53:45,980 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 55 [2019-12-18 22:53:45,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:53:46,025 INFO L225 Difference]: With dead ends: 43972 [2019-12-18 22:53:46,025 INFO L226 Difference]: Without dead ends: 32054 [2019-12-18 22:53:46,026 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 758 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=490, Invalid=2372, Unknown=0, NotChecked=0, Total=2862 [2019-12-18 22:53:46,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32054 states. [2019-12-18 22:53:46,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32054 to 18330. [2019-12-18 22:53:46,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18330 states. [2019-12-18 22:53:46,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18330 states to 18330 states and 54502 transitions. [2019-12-18 22:53:46,385 INFO L78 Accepts]: Start accepts. Automaton has 18330 states and 54502 transitions. Word has length 55 [2019-12-18 22:53:46,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:53:46,385 INFO L462 AbstractCegarLoop]: Abstraction has 18330 states and 54502 transitions. [2019-12-18 22:53:46,385 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 22:53:46,385 INFO L276 IsEmpty]: Start isEmpty. Operand 18330 states and 54502 transitions. [2019-12-18 22:53:46,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 22:53:46,402 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:53:46,402 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:53:46,402 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:53:46,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:53:46,403 INFO L82 PathProgramCache]: Analyzing trace with hash -1691334286, now seen corresponding path program 7 times [2019-12-18 22:53:46,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:53:46,403 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443268860] [2019-12-18 22:53:46,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:53:46,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:53:46,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:53:46,872 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443268860] [2019-12-18 22:53:46,872 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:53:46,872 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 22:53:46,872 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861326220] [2019-12-18 22:53:46,874 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 22:53:46,875 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:53:46,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 22:53:46,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-12-18 22:53:46,875 INFO L87 Difference]: Start difference. First operand 18330 states and 54502 transitions. Second operand 16 states. [2019-12-18 22:53:50,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:53:50,659 INFO L93 Difference]: Finished difference Result 34152 states and 100945 transitions. [2019-12-18 22:53:50,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-12-18 22:53:50,659 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 55 [2019-12-18 22:53:50,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:53:50,705 INFO L225 Difference]: With dead ends: 34152 [2019-12-18 22:53:50,705 INFO L226 Difference]: Without dead ends: 33718 [2019-12-18 22:53:50,706 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 750 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=434, Invalid=2428, Unknown=0, NotChecked=0, Total=2862 [2019-12-18 22:53:50,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33718 states. [2019-12-18 22:53:51,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33718 to 20184. [2019-12-18 22:53:51,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20184 states. [2019-12-18 22:53:51,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20184 states to 20184 states and 59785 transitions. [2019-12-18 22:53:51,102 INFO L78 Accepts]: Start accepts. Automaton has 20184 states and 59785 transitions. Word has length 55 [2019-12-18 22:53:51,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:53:51,102 INFO L462 AbstractCegarLoop]: Abstraction has 20184 states and 59785 transitions. [2019-12-18 22:53:51,102 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 22:53:51,102 INFO L276 IsEmpty]: Start isEmpty. Operand 20184 states and 59785 transitions. [2019-12-18 22:53:51,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 22:53:51,121 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:53:51,122 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:53:51,122 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:53:51,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:53:51,122 INFO L82 PathProgramCache]: Analyzing trace with hash 650958158, now seen corresponding path program 8 times [2019-12-18 22:53:51,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:53:51,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818612675] [2019-12-18 22:53:51,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:53:51,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:53:51,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:53:51,555 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818612675] [2019-12-18 22:53:51,555 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:53:51,556 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 22:53:51,556 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569717348] [2019-12-18 22:53:51,556 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 22:53:51,556 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:53:51,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 22:53:51,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2019-12-18 22:53:51,557 INFO L87 Difference]: Start difference. First operand 20184 states and 59785 transitions. Second operand 16 states. [2019-12-18 22:53:55,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:53:55,210 INFO L93 Difference]: Finished difference Result 34192 states and 100616 transitions. [2019-12-18 22:53:55,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-18 22:53:55,210 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 55 [2019-12-18 22:53:55,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:53:55,257 INFO L225 Difference]: With dead ends: 34192 [2019-12-18 22:53:55,257 INFO L226 Difference]: Without dead ends: 32012 [2019-12-18 22:53:55,258 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 677 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=449, Invalid=2203, Unknown=0, NotChecked=0, Total=2652 [2019-12-18 22:53:55,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32012 states. [2019-12-18 22:53:55,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32012 to 18324. [2019-12-18 22:53:55,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18324 states. [2019-12-18 22:53:55,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18324 states to 18324 states and 54496 transitions. [2019-12-18 22:53:55,862 INFO L78 Accepts]: Start accepts. Automaton has 18324 states and 54496 transitions. Word has length 55 [2019-12-18 22:53:55,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:53:55,862 INFO L462 AbstractCegarLoop]: Abstraction has 18324 states and 54496 transitions. [2019-12-18 22:53:55,862 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 22:53:55,862 INFO L276 IsEmpty]: Start isEmpty. Operand 18324 states and 54496 transitions. [2019-12-18 22:53:55,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 22:53:55,879 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:53:55,879 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:53:55,880 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:53:55,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:53:55,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1247506214, now seen corresponding path program 9 times [2019-12-18 22:53:55,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:53:55,880 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815334557] [2019-12-18 22:53:55,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:53:55,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:53:55,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:53:55,986 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815334557] [2019-12-18 22:53:55,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:53:55,987 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 22:53:55,987 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385049380] [2019-12-18 22:53:55,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 22:53:55,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:53:55,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 22:53:55,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-18 22:53:55,988 INFO L87 Difference]: Start difference. First operand 18324 states and 54496 transitions. Second operand 9 states. [2019-12-18 22:53:57,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:53:57,081 INFO L93 Difference]: Finished difference Result 31587 states and 93553 transitions. [2019-12-18 22:53:57,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 22:53:57,081 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-12-18 22:53:57,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:53:57,116 INFO L225 Difference]: With dead ends: 31587 [2019-12-18 22:53:57,116 INFO L226 Difference]: Without dead ends: 25473 [2019-12-18 22:53:57,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2019-12-18 22:53:57,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25473 states. [2019-12-18 22:53:57,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25473 to 18254. [2019-12-18 22:53:57,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18254 states. [2019-12-18 22:53:57,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18254 states to 18254 states and 54186 transitions. [2019-12-18 22:53:57,429 INFO L78 Accepts]: Start accepts. Automaton has 18254 states and 54186 transitions. Word has length 55 [2019-12-18 22:53:57,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:53:57,430 INFO L462 AbstractCegarLoop]: Abstraction has 18254 states and 54186 transitions. [2019-12-18 22:53:57,430 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 22:53:57,430 INFO L276 IsEmpty]: Start isEmpty. Operand 18254 states and 54186 transitions. [2019-12-18 22:53:57,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 22:53:57,449 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:53:57,449 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:53:57,449 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:53:57,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:53:57,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1854560994, now seen corresponding path program 10 times [2019-12-18 22:53:57,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:53:57,449 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264123907] [2019-12-18 22:53:57,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:53:57,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:53:57,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:53:57,616 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264123907] [2019-12-18 22:53:57,616 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:53:57,616 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 22:53:57,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19493935] [2019-12-18 22:53:57,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 22:53:57,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:53:57,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 22:53:57,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-12-18 22:53:57,617 INFO L87 Difference]: Start difference. First operand 18254 states and 54186 transitions. Second operand 11 states. [2019-12-18 22:54:00,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:54:00,296 INFO L93 Difference]: Finished difference Result 31476 states and 91292 transitions. [2019-12-18 22:54:00,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-18 22:54:00,297 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2019-12-18 22:54:00,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:54:00,335 INFO L225 Difference]: With dead ends: 31476 [2019-12-18 22:54:00,335 INFO L226 Difference]: Without dead ends: 31476 [2019-12-18 22:54:00,336 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=174, Invalid=818, Unknown=0, NotChecked=0, Total=992 [2019-12-18 22:54:00,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31476 states. [2019-12-18 22:54:00,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31476 to 20346. [2019-12-18 22:54:00,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20346 states. [2019-12-18 22:54:00,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20346 states to 20346 states and 59954 transitions. [2019-12-18 22:54:00,690 INFO L78 Accepts]: Start accepts. Automaton has 20346 states and 59954 transitions. Word has length 55 [2019-12-18 22:54:00,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:54:00,691 INFO L462 AbstractCegarLoop]: Abstraction has 20346 states and 59954 transitions. [2019-12-18 22:54:00,691 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 22:54:00,691 INFO L276 IsEmpty]: Start isEmpty. Operand 20346 states and 59954 transitions. [2019-12-18 22:54:00,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 22:54:00,713 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:54:00,715 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:54:00,715 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:54:00,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:54:00,715 INFO L82 PathProgramCache]: Analyzing trace with hash -1521150196, now seen corresponding path program 11 times [2019-12-18 22:54:00,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:54:00,716 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849541037] [2019-12-18 22:54:00,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:54:00,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:54:00,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:54:00,911 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849541037] [2019-12-18 22:54:00,911 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:54:00,911 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 22:54:00,911 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312338363] [2019-12-18 22:54:00,912 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 22:54:00,912 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:54:00,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 22:54:00,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-12-18 22:54:00,913 INFO L87 Difference]: Start difference. First operand 20346 states and 59954 transitions. Second operand 12 states. [2019-12-18 22:54:03,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:54:03,284 INFO L93 Difference]: Finished difference Result 31380 states and 90719 transitions. [2019-12-18 22:54:03,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-18 22:54:03,284 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2019-12-18 22:54:03,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:54:03,324 INFO L225 Difference]: With dead ends: 31380 [2019-12-18 22:54:03,325 INFO L226 Difference]: Without dead ends: 31380 [2019-12-18 22:54:03,325 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=135, Invalid=621, Unknown=0, NotChecked=0, Total=756 [2019-12-18 22:54:03,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31380 states. [2019-12-18 22:54:03,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31380 to 20145. [2019-12-18 22:54:03,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20145 states. [2019-12-18 22:54:03,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20145 states to 20145 states and 59518 transitions. [2019-12-18 22:54:03,685 INFO L78 Accepts]: Start accepts. Automaton has 20145 states and 59518 transitions. Word has length 55 [2019-12-18 22:54:03,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:54:03,686 INFO L462 AbstractCegarLoop]: Abstraction has 20145 states and 59518 transitions. [2019-12-18 22:54:03,686 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 22:54:03,686 INFO L276 IsEmpty]: Start isEmpty. Operand 20145 states and 59518 transitions. [2019-12-18 22:54:03,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 22:54:03,708 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:54:03,708 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:54:03,708 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:54:03,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:54:03,708 INFO L82 PathProgramCache]: Analyzing trace with hash -653717204, now seen corresponding path program 12 times [2019-12-18 22:54:03,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:54:03,708 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088037568] [2019-12-18 22:54:03,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:54:03,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:54:03,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:54:03,870 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088037568] [2019-12-18 22:54:03,870 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:54:03,870 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 22:54:03,870 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675197846] [2019-12-18 22:54:03,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 22:54:03,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:54:03,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 22:54:03,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-12-18 22:54:03,871 INFO L87 Difference]: Start difference. First operand 20145 states and 59518 transitions. Second operand 12 states. [2019-12-18 22:54:05,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:54:05,135 INFO L93 Difference]: Finished difference Result 25400 states and 74808 transitions. [2019-12-18 22:54:05,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 22:54:05,136 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2019-12-18 22:54:05,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:54:05,168 INFO L225 Difference]: With dead ends: 25400 [2019-12-18 22:54:05,168 INFO L226 Difference]: Without dead ends: 23873 [2019-12-18 22:54:05,168 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=379, Unknown=0, NotChecked=0, Total=462 [2019-12-18 22:54:05,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23873 states. [2019-12-18 22:54:05,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23873 to 20339. [2019-12-18 22:54:05,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20339 states. [2019-12-18 22:54:05,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20339 states to 20339 states and 59977 transitions. [2019-12-18 22:54:05,488 INFO L78 Accepts]: Start accepts. Automaton has 20339 states and 59977 transitions. Word has length 55 [2019-12-18 22:54:05,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:54:05,488 INFO L462 AbstractCegarLoop]: Abstraction has 20339 states and 59977 transitions. [2019-12-18 22:54:05,489 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 22:54:05,489 INFO L276 IsEmpty]: Start isEmpty. Operand 20339 states and 59977 transitions. [2019-12-18 22:54:05,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 22:54:05,511 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:54:05,512 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:54:05,512 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:54:05,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:54:05,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1491379880, now seen corresponding path program 13 times [2019-12-18 22:54:05,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:54:05,512 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293700427] [2019-12-18 22:54:05,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:54:05,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:54:05,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:54:05,669 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293700427] [2019-12-18 22:54:05,669 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:54:05,669 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 22:54:05,670 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648972511] [2019-12-18 22:54:05,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 22:54:05,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:54:05,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 22:54:05,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 22:54:05,674 INFO L87 Difference]: Start difference. First operand 20339 states and 59977 transitions. Second operand 11 states. [2019-12-18 22:54:06,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:54:06,680 INFO L93 Difference]: Finished difference Result 35862 states and 106004 transitions. [2019-12-18 22:54:06,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-18 22:54:06,681 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2019-12-18 22:54:06,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:54:06,731 INFO L225 Difference]: With dead ends: 35862 [2019-12-18 22:54:06,731 INFO L226 Difference]: Without dead ends: 34776 [2019-12-18 22:54:06,732 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=165, Invalid=705, Unknown=0, NotChecked=0, Total=870 [2019-12-18 22:54:06,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34776 states. [2019-12-18 22:54:07,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34776 to 23120. [2019-12-18 22:54:07,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23120 states. [2019-12-18 22:54:07,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23120 states to 23120 states and 67979 transitions. [2019-12-18 22:54:07,346 INFO L78 Accepts]: Start accepts. Automaton has 23120 states and 67979 transitions. Word has length 55 [2019-12-18 22:54:07,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:54:07,346 INFO L462 AbstractCegarLoop]: Abstraction has 23120 states and 67979 transitions. [2019-12-18 22:54:07,346 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 22:54:07,346 INFO L276 IsEmpty]: Start isEmpty. Operand 23120 states and 67979 transitions. [2019-12-18 22:54:07,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 22:54:07,370 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:54:07,370 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:54:07,370 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:54:07,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:54:07,371 INFO L82 PathProgramCache]: Analyzing trace with hash 850912564, now seen corresponding path program 14 times [2019-12-18 22:54:07,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:54:07,371 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198374546] [2019-12-18 22:54:07,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:54:07,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:54:07,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:54:07,513 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198374546] [2019-12-18 22:54:07,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:54:07,514 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 22:54:07,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566760332] [2019-12-18 22:54:07,514 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 22:54:07,514 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:54:07,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 22:54:07,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 22:54:07,515 INFO L87 Difference]: Start difference. First operand 23120 states and 67979 transitions. Second operand 11 states. [2019-12-18 22:54:08,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:54:08,522 INFO L93 Difference]: Finished difference Result 35255 states and 103641 transitions. [2019-12-18 22:54:08,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-18 22:54:08,522 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2019-12-18 22:54:08,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:54:08,580 INFO L225 Difference]: With dead ends: 35255 [2019-12-18 22:54:08,581 INFO L226 Difference]: Without dead ends: 29593 [2019-12-18 22:54:08,581 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=438, Unknown=0, NotChecked=0, Total=552 [2019-12-18 22:54:08,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29593 states. [2019-12-18 22:54:08,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29593 to 19017. [2019-12-18 22:54:08,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19017 states. [2019-12-18 22:54:08,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19017 states to 19017 states and 56430 transitions. [2019-12-18 22:54:08,927 INFO L78 Accepts]: Start accepts. Automaton has 19017 states and 56430 transitions. Word has length 55 [2019-12-18 22:54:08,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:54:08,927 INFO L462 AbstractCegarLoop]: Abstraction has 19017 states and 56430 transitions. [2019-12-18 22:54:08,928 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 22:54:08,928 INFO L276 IsEmpty]: Start isEmpty. Operand 19017 states and 56430 transitions. [2019-12-18 22:54:08,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 22:54:08,945 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:54:08,945 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:54:08,945 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:54:08,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:54:08,946 INFO L82 PathProgramCache]: Analyzing trace with hash -1458558076, now seen corresponding path program 15 times [2019-12-18 22:54:08,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:54:08,946 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407349244] [2019-12-18 22:54:08,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:54:08,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:54:08,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-18 22:54:08,998 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407349244] [2019-12-18 22:54:08,998 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:54:08,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:54:08,999 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416869463] [2019-12-18 22:54:08,999 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:54:08,999 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:54:08,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:54:09,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:54:09,000 INFO L87 Difference]: Start difference. First operand 19017 states and 56430 transitions. Second operand 3 states. [2019-12-18 22:54:09,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:54:09,072 INFO L93 Difference]: Finished difference Result 19015 states and 56425 transitions. [2019-12-18 22:54:09,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:54:09,072 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-18 22:54:09,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:54:09,104 INFO L225 Difference]: With dead ends: 19015 [2019-12-18 22:54:09,104 INFO L226 Difference]: Without dead ends: 19015 [2019-12-18 22:54:09,104 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:54:09,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19015 states. [2019-12-18 22:54:09,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19015 to 16973. [2019-12-18 22:54:09,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16973 states. [2019-12-18 22:54:09,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16973 states to 16973 states and 50879 transitions. [2019-12-18 22:54:09,534 INFO L78 Accepts]: Start accepts. Automaton has 16973 states and 50879 transitions. Word has length 55 [2019-12-18 22:54:09,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:54:09,534 INFO L462 AbstractCegarLoop]: Abstraction has 16973 states and 50879 transitions. [2019-12-18 22:54:09,534 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:54:09,534 INFO L276 IsEmpty]: Start isEmpty. Operand 16973 states and 50879 transitions. [2019-12-18 22:54:09,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 22:54:09,558 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:54:09,558 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:54:09,558 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:54:09,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:54:09,559 INFO L82 PathProgramCache]: Analyzing trace with hash 379887659, now seen corresponding path program 1 times [2019-12-18 22:54:09,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:54:09,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114232590] [2019-12-18 22:54:09,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:54:09,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 22:54:09,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 22:54:09,669 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 22:54:09,669 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 22:54:09,673 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] ULTIMATE.startENTRY-->L820: Formula: (let ((.cse0 (store |v_#valid_53| 0 0))) (and (= 0 v_~x$w_buff1~0_24) (= v_~main$tmp_guard0~0_10 0) (= 0 |v_ULTIMATE.start_main_~#t2351~0.offset_15|) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t2351~0.base_19| 4)) (= v_~x$r_buff1_thd1~0_42 0) (= 0 v_~x$r_buff0_thd2~0_24) (= 0 v_~x$r_buff0_thd0~0_20) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t2351~0.base_19|) (= v_~__unbuffered_p2_EBX~0_14 0) (= 0 v_~weak$$choice0~0_5) (= v_~z~0_10 0) (= 0 v_~__unbuffered_p0_EAX~0_14) (= 0 v_~x$read_delayed_var~0.base_8) (= v_~x$w_buff1_used~0_67 0) (< 0 |v_#StackHeapBarrier_14|) (= 0 v_~weak$$choice2~0_33) (= 0 v_~x$read_delayed~0_8) (= 0 v_~x$read_delayed_var~0.offset_8) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2351~0.base_19|)) (= v_~x$flush_delayed~0_14 0) (= 0 v_~x$r_buff0_thd1~0_71) (= v_~x$r_buff1_thd2~0_16 0) (= 0 v_~x$w_buff0_used~0_110) (= |v_#NULL.offset_5| 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t2351~0.base_19| 1) |v_#valid_51|) (= v_~main$tmp_guard1~0_15 0) (= 0 v_~__unbuffered_cnt~0_22) (= v_~x$mem_tmp~0_11 0) (= v_~x~0_25 0) (= 0 v_~x$r_buff0_thd3~0_19) (= v_~y~0_10 0) (= 0 v_~__unbuffered_p2_EAX~0_14) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2351~0.base_19| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2351~0.base_19|) |v_ULTIMATE.start_main_~#t2351~0.offset_15| 0)) |v_#memory_int_21|) (= v_~x$r_buff1_thd0~0_19 0) (= 0 v_~x$w_buff0~0_29) (= 0 |v_#NULL.base_5|) (= v_~x$r_buff1_thd3~0_16 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_53|, #memory_int=|v_#memory_int_22|, #length=|v_#length_22|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_29, ULTIMATE.start_main_~#t2352~0.offset=|v_ULTIMATE.start_main_~#t2352~0.offset_16|, ~x$flush_delayed~0=v_~x$flush_delayed~0_14, #NULL.offset=|v_#NULL.offset_5|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_42, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_19, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_9|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_9|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_14, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_14, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_20, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_14, ~x$w_buff1~0=v_~x$w_buff1~0_24, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_67, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_16, ULTIMATE.start_main_~#t2353~0.base=|v_ULTIMATE.start_main_~#t2353~0.base_21|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_8, ULTIMATE.start_main_~#t2353~0.offset=|v_ULTIMATE.start_main_~#t2353~0.offset_16|, ~weak$$choice0~0=v_~weak$$choice0~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~x~0=v_~x~0_25, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_71, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_17|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_16, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ~x$mem_tmp~0=v_~x$mem_tmp~0_11, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_11|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_9|, ULTIMATE.start_main_~#t2352~0.base=|v_ULTIMATE.start_main_~#t2352~0.base_21|, ULTIMATE.start_main_~#t2351~0.offset=|v_ULTIMATE.start_main_~#t2351~0.offset_15|, ~y~0=v_~y~0_10, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_7|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_19, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_24, #NULL.base=|v_#NULL.base_5|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_110, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_11|, ULTIMATE.start_main_~#t2351~0.base=|v_ULTIMATE.start_main_~#t2351~0.base_19|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_8, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_14|, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_7|, ~z~0=v_~z~0_10, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~x$read_delayed~0=v_~x$read_delayed~0_8} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_~#t2352~0.offset, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd0~0, ~__unbuffered_p2_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_~#t2353~0.base, ~x$read_delayed_var~0.base, ULTIMATE.start_main_~#t2353~0.offset, ~weak$$choice0~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t2352~0.base, ULTIMATE.start_main_~#t2351~0.offset, ~y~0, ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_~#t2351~0.base, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-18 22:54:09,674 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L820-1-->L822: Formula: (and (not (= |v_ULTIMATE.start_main_~#t2352~0.base_13| 0)) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t2352~0.base_13| 1)) (= (select |v_#valid_37| |v_ULTIMATE.start_main_~#t2352~0.base_13|) 0) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2352~0.base_13|) (= |v_#memory_int_15| (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2352~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2352~0.base_13|) |v_ULTIMATE.start_main_~#t2352~0.offset_11| 1))) (= 0 |v_ULTIMATE.start_main_~#t2352~0.offset_11|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2352~0.base_13| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t2352~0.offset=|v_ULTIMATE.start_main_~#t2352~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2352~0.base=|v_ULTIMATE.start_main_~#t2352~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2352~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t2352~0.base] because there is no mapped edge [2019-12-18 22:54:09,674 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [785] [785] L822-1-->L824: Formula: (and (= (store |v_#valid_39| |v_ULTIMATE.start_main_~#t2353~0.base_13| 1) |v_#valid_38|) (not (= 0 |v_ULTIMATE.start_main_~#t2353~0.base_13|)) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t2353~0.base_13| 4) |v_#length_17|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2353~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2353~0.base_13|) |v_ULTIMATE.start_main_~#t2353~0.offset_11| 2)) |v_#memory_int_17|) (= (select |v_#valid_39| |v_ULTIMATE.start_main_~#t2353~0.base_13|) 0) (= 0 |v_ULTIMATE.start_main_~#t2353~0.offset_11|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2353~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t2353~0.offset=|v_ULTIMATE.start_main_~#t2353~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_17|, #length=|v_#length_17|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|, ULTIMATE.start_main_~#t2353~0.base=|v_ULTIMATE.start_main_~#t2353~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2353~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t2353~0.base] because there is no mapped edge [2019-12-18 22:54:09,675 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] P1ENTRY-->L5-3: Formula: (and (= |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out1643609346| P1Thread1of1ForFork0___VERIFIER_assert_~expression_Out1643609346) (= ~x$w_buff0~0_In1643609346 ~x$w_buff1~0_Out1643609346) (= 1 ~x$w_buff0~0_Out1643609346) (= ~x$w_buff0_used~0_In1643609346 ~x$w_buff1_used~0_Out1643609346) (= (mod ~x$w_buff1_used~0_Out1643609346 256) 0) (= P1Thread1of1ForFork0_~arg.offset_Out1643609346 |P1Thread1of1ForFork0_#in~arg.offset_In1643609346|) (= 1 ~x$w_buff0_used~0_Out1643609346) (= |P1Thread1of1ForFork0_#in~arg.base_In1643609346| P1Thread1of1ForFork0_~arg.base_Out1643609346) (= |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out1643609346| 1)) InVars {~x$w_buff0~0=~x$w_buff0~0_In1643609346, P1Thread1of1ForFork0_#in~arg.base=|P1Thread1of1ForFork0_#in~arg.base_In1643609346|, P1Thread1of1ForFork0_#in~arg.offset=|P1Thread1of1ForFork0_#in~arg.offset_In1643609346|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1643609346} OutVars{~x$w_buff0~0=~x$w_buff0~0_Out1643609346, P1Thread1of1ForFork0___VERIFIER_assert_~expression=P1Thread1of1ForFork0___VERIFIER_assert_~expression_Out1643609346, P1Thread1of1ForFork0_~arg.offset=P1Thread1of1ForFork0_~arg.offset_Out1643609346, P1Thread1of1ForFork0_~arg.base=P1Thread1of1ForFork0_~arg.base_Out1643609346, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out1643609346|, P1Thread1of1ForFork0_#in~arg.base=|P1Thread1of1ForFork0_#in~arg.base_In1643609346|, ~x$w_buff1~0=~x$w_buff1~0_Out1643609346, P1Thread1of1ForFork0_#in~arg.offset=|P1Thread1of1ForFork0_#in~arg.offset_In1643609346|, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out1643609346, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out1643609346} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression, P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-18 22:54:09,679 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L797-2-->L797-4: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In1394624046 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In1394624046 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite32_Out1394624046| ~x$w_buff1~0_In1394624046) (not .cse1)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite32_Out1394624046| ~x~0_In1394624046)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1394624046, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1394624046, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1394624046, ~x~0=~x~0_In1394624046} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out1394624046|, ~x$w_buff1~0=~x$w_buff1~0_In1394624046, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1394624046, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1394624046, ~x~0=~x~0_In1394624046} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-18 22:54:09,679 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L797-4-->L798: Formula: (= v_~x~0_19 |v_P2Thread1of1ForFork1_#t~ite32_8|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_8|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_7|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_7|, ~x~0=v_~x~0_19} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-18 22:54:09,679 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L798-->L798-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-2131556985 256))) (.cse0 (= (mod ~x$r_buff0_thd3~0_In-2131556985 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork1_#t~ite34_Out-2131556985| 0)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork1_#t~ite34_Out-2131556985| ~x$w_buff0_used~0_In-2131556985)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-2131556985, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2131556985} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out-2131556985|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-2131556985, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2131556985} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-18 22:54:09,681 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L778-->L778-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In1011880845 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In1011880845 256) 0))) (or (and (= ~x$w_buff0_used~0_In1011880845 |P1Thread1of1ForFork0_#t~ite28_Out1011880845|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |P1Thread1of1ForFork0_#t~ite28_Out1011880845|) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1011880845, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1011880845} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1011880845, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out1011880845|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1011880845} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-18 22:54:09,682 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L779-->L779-2: Formula: (let ((.cse2 (= (mod ~x$r_buff0_thd2~0_In317681431 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In317681431 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In317681431 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In317681431 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite29_Out317681431| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P1Thread1of1ForFork0_#t~ite29_Out317681431| ~x$w_buff1_used~0_In317681431) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In317681431, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In317681431, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In317681431, ~x$w_buff0_used~0=~x$w_buff0_used~0_In317681431} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In317681431, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In317681431, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In317681431, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out317681431|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In317681431} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-18 22:54:09,683 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L780-->L781: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-1751498063 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In-1751498063 256) 0))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd2~0_In-1751498063 ~x$r_buff0_thd2~0_Out-1751498063)) (and (not .cse1) (= 0 ~x$r_buff0_thd2~0_Out-1751498063) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1751498063, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1751498063} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out-1751498063|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-1751498063, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1751498063} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 22:54:09,683 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L781-->L781-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff1_used~0_In453383990 256))) (.cse3 (= 0 (mod ~x$r_buff1_thd2~0_In453383990 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In453383990 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In453383990 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite31_Out453383990| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |P1Thread1of1ForFork0_#t~ite31_Out453383990| ~x$r_buff1_thd2~0_In453383990) (or .cse0 .cse1)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In453383990, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In453383990, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In453383990, ~x$w_buff0_used~0=~x$w_buff0_used~0_In453383990} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out453383990|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In453383990, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In453383990, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In453383990, ~x$w_buff0_used~0=~x$w_buff0_used~0_In453383990} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-18 22:54:09,683 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L781-2-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= v_~x$r_buff1_thd2~0_11 |v_P1Thread1of1ForFork0_#t~ite31_8|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_7|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_11, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-18 22:54:09,685 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L743-->L743-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1741654889 256)))) (or (and (not .cse0) (= |P0Thread1of1ForFork2_#t~ite11_In1741654889| |P0Thread1of1ForFork2_#t~ite11_Out1741654889|) (= ~x$w_buff1~0_In1741654889 |P0Thread1of1ForFork2_#t~ite12_Out1741654889|)) (and (= ~x$w_buff1~0_In1741654889 |P0Thread1of1ForFork2_#t~ite11_Out1741654889|) (= |P0Thread1of1ForFork2_#t~ite11_Out1741654889| |P0Thread1of1ForFork2_#t~ite12_Out1741654889|) (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In1741654889 256) 0))) (or (= 0 (mod ~x$w_buff0_used~0_In1741654889 256)) (and (= (mod ~x$w_buff1_used~0_In1741654889 256) 0) .cse1) (and (= (mod ~x$r_buff1_thd1~0_In1741654889 256) 0) .cse1))) .cse0))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1741654889, ~x$w_buff1~0=~x$w_buff1~0_In1741654889, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1741654889, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1741654889, ~weak$$choice2~0=~weak$$choice2~0_In1741654889, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_In1741654889|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1741654889} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1741654889, ~x$w_buff1~0=~x$w_buff1~0_In1741654889, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1741654889, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1741654889, ~weak$$choice2~0=~weak$$choice2~0_In1741654889, P0Thread1of1ForFork2_#t~ite12=|P0Thread1of1ForFork2_#t~ite12_Out1741654889|, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_Out1741654889|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1741654889} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite12, P0Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-18 22:54:09,685 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L744-->L744-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1529760078 256) 0))) (or (and .cse0 (= |P0Thread1of1ForFork2_#t~ite14_Out1529760078| |P0Thread1of1ForFork2_#t~ite15_Out1529760078|) (= ~x$w_buff0_used~0_In1529760078 |P0Thread1of1ForFork2_#t~ite14_Out1529760078|) (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In1529760078 256) 0))) (or (= (mod ~x$w_buff0_used~0_In1529760078 256) 0) (and (= (mod ~x$w_buff1_used~0_In1529760078 256) 0) .cse1) (and .cse1 (= (mod ~x$r_buff1_thd1~0_In1529760078 256) 0))))) (and (not .cse0) (= |P0Thread1of1ForFork2_#t~ite14_In1529760078| |P0Thread1of1ForFork2_#t~ite14_Out1529760078|) (= ~x$w_buff0_used~0_In1529760078 |P0Thread1of1ForFork2_#t~ite15_Out1529760078|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1529760078, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1529760078, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1529760078, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_In1529760078|, ~weak$$choice2~0=~weak$$choice2~0_In1529760078, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1529760078} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1529760078, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1529760078, P0Thread1of1ForFork2_#t~ite15=|P0Thread1of1ForFork2_#t~ite15_Out1529760078|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1529760078, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_Out1529760078|, ~weak$$choice2~0=~weak$$choice2~0_In1529760078, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1529760078} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite15, P0Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-18 22:54:09,686 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [803] [803] L745-->L745-8: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff0_used~0_In1056208701 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd1~0_In1056208701 256))) (.cse6 (= 0 (mod ~x$r_buff0_thd1~0_In1056208701 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In1056208701 256))) (.cse4 (= 0 (mod ~weak$$choice2~0_In1056208701 256))) (.cse5 (= |P0Thread1of1ForFork2_#t~ite18_Out1056208701| |P0Thread1of1ForFork2_#t~ite17_Out1056208701|))) (or (let ((.cse0 (not .cse6))) (and (= |P0Thread1of1ForFork2_#t~ite16_Out1056208701| |P0Thread1of1ForFork2_#t~ite17_Out1056208701|) (or .cse0 (not .cse1)) (or .cse0 (not .cse2)) (not .cse3) .cse4 (= 0 |P0Thread1of1ForFork2_#t~ite16_Out1056208701|) .cse5)) (and (or (and (= |P0Thread1of1ForFork2_#t~ite17_In1056208701| |P0Thread1of1ForFork2_#t~ite17_Out1056208701|) (not .cse4) (= |P0Thread1of1ForFork2_#t~ite18_Out1056208701| ~x$w_buff1_used~0_In1056208701)) (and (= ~x$w_buff1_used~0_In1056208701 |P0Thread1of1ForFork2_#t~ite17_Out1056208701|) (or .cse3 (and .cse1 .cse6) (and .cse6 .cse2)) .cse4 .cse5)) (= |P0Thread1of1ForFork2_#t~ite16_In1056208701| |P0Thread1of1ForFork2_#t~ite16_Out1056208701|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1056208701, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_In1056208701|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1056208701, P0Thread1of1ForFork2_#t~ite16=|P0Thread1of1ForFork2_#t~ite16_In1056208701|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1056208701, ~weak$$choice2~0=~weak$$choice2~0_In1056208701, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1056208701} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1056208701, P0Thread1of1ForFork2_#t~ite18=|P0Thread1of1ForFork2_#t~ite18_Out1056208701|, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_Out1056208701|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1056208701, P0Thread1of1ForFork2_#t~ite16=|P0Thread1of1ForFork2_#t~ite16_Out1056208701|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1056208701, ~weak$$choice2~0=~weak$$choice2~0_In1056208701, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1056208701} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17, P0Thread1of1ForFork2_#t~ite16] because there is no mapped edge [2019-12-18 22:54:09,687 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L746-->L747: Formula: (and (not (= (mod v_~weak$$choice2~0_19 256) 0)) (= v_~x$r_buff0_thd1~0_44 v_~x$r_buff0_thd1~0_43)) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_44, ~weak$$choice2~0=v_~weak$$choice2~0_19} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_8|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_43, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_7|, ~weak$$choice2~0=v_~weak$$choice2~0_19, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_7|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-18 22:54:09,687 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [802] [802] L747-->L747-8: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff1_thd1~0_In858209538 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In858209538 256))) (.cse4 (= (mod ~x$w_buff1_used~0_In858209538 256) 0)) (.cse6 (= 0 (mod ~x$r_buff0_thd1~0_In858209538 256))) (.cse5 (= |P0Thread1of1ForFork2_#t~ite24_Out858209538| |P0Thread1of1ForFork2_#t~ite23_Out858209538|)) (.cse1 (= (mod ~weak$$choice2~0_In858209538 256) 0))) (or (let ((.cse2 (not .cse6))) (and (not .cse0) .cse1 (or .cse2 (not .cse3)) (= 0 |P0Thread1of1ForFork2_#t~ite22_Out858209538|) (or (not .cse4) .cse2) (= |P0Thread1of1ForFork2_#t~ite23_Out858209538| |P0Thread1of1ForFork2_#t~ite22_Out858209538|) .cse5)) (and (= |P0Thread1of1ForFork2_#t~ite22_In858209538| |P0Thread1of1ForFork2_#t~ite22_Out858209538|) (or (and (or (and .cse3 .cse6) .cse0 (and .cse4 .cse6)) .cse1 (= ~x$r_buff1_thd1~0_In858209538 |P0Thread1of1ForFork2_#t~ite23_Out858209538|) .cse5) (and (not .cse1) (= |P0Thread1of1ForFork2_#t~ite23_In858209538| |P0Thread1of1ForFork2_#t~ite23_Out858209538|) (= ~x$r_buff1_thd1~0_In858209538 |P0Thread1of1ForFork2_#t~ite24_Out858209538|)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In858209538, ~x$w_buff1_used~0=~x$w_buff1_used~0_In858209538, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In858209538, ~weak$$choice2~0=~weak$$choice2~0_In858209538, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_In858209538|, P0Thread1of1ForFork2_#t~ite22=|P0Thread1of1ForFork2_#t~ite22_In858209538|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In858209538} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In858209538, ~x$w_buff1_used~0=~x$w_buff1_used~0_In858209538, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In858209538, P0Thread1of1ForFork2_#t~ite24=|P0Thread1of1ForFork2_#t~ite24_Out858209538|, ~weak$$choice2~0=~weak$$choice2~0_In858209538, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_Out858209538|, P0Thread1of1ForFork2_#t~ite22=|P0Thread1of1ForFork2_#t~ite22_Out858209538|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In858209538} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23, P0Thread1of1ForFork2_#t~ite22] because there is no mapped edge [2019-12-18 22:54:09,688 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L749-->L757: Formula: (and (= 0 v_~x$flush_delayed~0_7) (not (= 0 (mod v_~x$flush_delayed~0_8 256))) (= v_~x$mem_tmp~0_5 v_~x~0_18) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~x$mem_tmp~0=v_~x$mem_tmp~0_5} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_7|, ~x$flush_delayed~0=v_~x$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~x$mem_tmp~0=v_~x$mem_tmp~0_5, ~x~0=v_~x~0_18} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-18 22:54:09,688 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L799-->L799-2: Formula: (let ((.cse3 (= (mod ~x$r_buff1_thd3~0_In-865205910 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-865205910 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-865205910 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In-865205910 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite35_Out-865205910| ~x$w_buff1_used~0_In-865205910) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork1_#t~ite35_Out-865205910| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-865205910, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-865205910, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-865205910, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-865205910} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out-865205910|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-865205910, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-865205910, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-865205910, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-865205910} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-18 22:54:09,689 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L800-->L800-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In1267970265 256))) (.cse0 (= (mod ~x$r_buff0_thd3~0_In1267970265 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite36_Out1267970265| 0) (not .cse1)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork1_#t~ite36_Out1267970265| ~x$r_buff0_thd3~0_In1267970265)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1267970265, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1267970265} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out1267970265|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1267970265, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1267970265} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-18 22:54:09,690 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L801-->L801-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In1249718649 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In1249718649 256))) (.cse3 (= (mod ~x$r_buff0_thd3~0_In1249718649 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In1249718649 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite37_Out1249718649| ~x$r_buff1_thd3~0_In1249718649) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork1_#t~ite37_Out1249718649| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1249718649, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1249718649, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1249718649, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1249718649} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out1249718649|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1249718649, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1249718649, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1249718649, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1249718649} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 22:54:09,690 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L801-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd3~0_12 |v_P2Thread1of1ForFork1_#t~ite37_8|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_7|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_12, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-18 22:54:09,690 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L824-1-->L830: Formula: (and (= v_~__unbuffered_cnt~0_9 3) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 22:54:09,691 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L830-2-->L830-4: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In367760140 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In367760140 256)))) (or (and (= |ULTIMATE.start_main_#t~ite41_Out367760140| ~x$w_buff1~0_In367760140) (not .cse0) (not .cse1)) (and (= ~x~0_In367760140 |ULTIMATE.start_main_#t~ite41_Out367760140|) (or .cse1 .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In367760140, ~x$w_buff1_used~0=~x$w_buff1_used~0_In367760140, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In367760140, ~x~0=~x~0_In367760140} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out367760140|, ~x$w_buff1~0=~x$w_buff1~0_In367760140, ~x$w_buff1_used~0=~x$w_buff1_used~0_In367760140, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In367760140, ~x~0=~x~0_In367760140} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-18 22:54:09,691 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L830-4-->L831: Formula: (= v_~x~0_14 |v_ULTIMATE.start_main_#t~ite41_8|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_8|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_7|, ~x~0=v_~x~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42, ~x~0] because there is no mapped edge [2019-12-18 22:54:09,691 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L831-->L831-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In700115278 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd0~0_In700115278 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out700115278| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite43_Out700115278| ~x$w_buff0_used~0_In700115278)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In700115278, ~x$w_buff0_used~0=~x$w_buff0_used~0_In700115278} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In700115278, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out700115278|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In700115278} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-18 22:54:09,692 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L832-->L832-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In-702295741 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-702295741 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In-702295741 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In-702295741 256)))) (or (and (= ~x$w_buff1_used~0_In-702295741 |ULTIMATE.start_main_#t~ite44_Out-702295741|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite44_Out-702295741| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-702295741, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-702295741, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-702295741, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-702295741} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-702295741, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-702295741, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-702295741, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-702295741|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-702295741} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 22:54:09,693 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L833-->L833-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-1348194528 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-1348194528 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite45_Out-1348194528|) (not .cse0) (not .cse1)) (and (= ~x$r_buff0_thd0~0_In-1348194528 |ULTIMATE.start_main_#t~ite45_Out-1348194528|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1348194528, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1348194528} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1348194528, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1348194528|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1348194528} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 22:54:09,694 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L834-->L834-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1573431409 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In-1573431409 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In-1573431409 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-1573431409 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff1_thd0~0_In-1573431409 |ULTIMATE.start_main_#t~ite46_Out-1573431409|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |ULTIMATE.start_main_#t~ite46_Out-1573431409|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1573431409, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1573431409, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1573431409, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1573431409} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1573431409, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-1573431409|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1573431409, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1573431409, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1573431409} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-18 22:54:09,694 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L834-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p2_EAX~0_8 1) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_~main$tmp_guard1~0_9 0) (= v_~__unbuffered_p0_EAX~0_8 0) (= v_~x$r_buff1_thd0~0_13 |v_ULTIMATE.start_main_#t~ite46_11|) (= v_~__unbuffered_p2_EBX~0_8 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10| (mod v_~main$tmp_guard1~0_9 256))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_8, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_11|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_8, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_10|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_13, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 22:54:09,801 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 10:54:09 BasicIcfg [2019-12-18 22:54:09,802 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 22:54:09,805 INFO L168 Benchmark]: Toolchain (without parser) took 116491.69 ms. Allocated memory was 144.7 MB in the beginning and 2.4 GB in the end (delta: 2.3 GB). Free memory was 101.2 MB in the beginning and 963.7 MB in the end (delta: -862.6 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-12-18 22:54:09,806 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-18 22:54:09,806 INFO L168 Benchmark]: CACSL2BoogieTranslator took 844.60 ms. Allocated memory was 144.7 MB in the beginning and 202.4 MB in the end (delta: 57.7 MB). Free memory was 100.7 MB in the beginning and 155.8 MB in the end (delta: -55.0 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. [2019-12-18 22:54:09,807 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.15 ms. Allocated memory is still 202.4 MB. Free memory was 155.8 MB in the beginning and 153.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 22:54:09,807 INFO L168 Benchmark]: Boogie Preprocessor took 60.34 ms. Allocated memory is still 202.4 MB. Free memory was 153.1 MB in the beginning and 151.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 22:54:09,807 INFO L168 Benchmark]: RCFGBuilder took 847.13 ms. Allocated memory is still 202.4 MB. Free memory was 151.1 MB in the beginning and 104.0 MB in the end (delta: 47.0 MB). Peak memory consumption was 47.0 MB. Max. memory is 7.1 GB. [2019-12-18 22:54:09,808 INFO L168 Benchmark]: TraceAbstraction took 114668.44 ms. Allocated memory was 202.4 MB in the beginning and 2.4 GB in the end (delta: 2.2 GB). Free memory was 104.0 MB in the beginning and 963.7 MB in the end (delta: -859.7 MB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2019-12-18 22:54:09,810 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.18 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 844.60 ms. Allocated memory was 144.7 MB in the beginning and 202.4 MB in the end (delta: 57.7 MB). Free memory was 100.7 MB in the beginning and 155.8 MB in the end (delta: -55.0 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 66.15 ms. Allocated memory is still 202.4 MB. Free memory was 155.8 MB in the beginning and 153.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 60.34 ms. Allocated memory is still 202.4 MB. Free memory was 153.1 MB in the beginning and 151.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 847.13 ms. Allocated memory is still 202.4 MB. Free memory was 151.1 MB in the beginning and 104.0 MB in the end (delta: 47.0 MB). Peak memory consumption was 47.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 114668.44 ms. Allocated memory was 202.4 MB in the beginning and 2.4 GB in the end (delta: 2.2 GB). Free memory was 104.0 MB in the beginning and 963.7 MB in the end (delta: -859.7 MB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.2s, 164 ProgramPointsBefore, 82 ProgramPointsAfterwards, 195 TransitionsBefore, 87 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 8 FixpointIterations, 33 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 25 ConcurrentYvCompositions, 30 ChoiceCompositions, 6629 VarBasedMoverChecksPositive, 194 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 75034 CheckedPairsTotal, 108 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L820] FCALL, FORK 0 pthread_create(&t2351, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L822] FCALL, FORK 0 pthread_create(&t2352, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L767] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L768] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L769] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L770] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L771] 2 x$r_buff0_thd2 = (_Bool)1 [L774] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L824] FCALL, FORK 0 pthread_create(&t2353, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L791] 3 __unbuffered_p2_EAX = y [L794] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L797] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L732] 1 z = 1 [L737] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L738] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L739] 1 x$flush_delayed = weak$$choice2 [L740] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L741] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L777] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L778] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L779] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L741] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L742] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L742] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L743] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L744] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L745] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L747] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L748] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L798] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L799] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L800] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L830] 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L831] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L832] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L833] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 155 locations, 2 error locations. Result: UNSAFE, OverallTime: 114.3s, OverallIterations: 33, TraceHistogramMax: 1, AutomataDifference: 53.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7629 SDtfs, 12404 SDslu, 33248 SDs, 0 SdLazy, 31262 SolverSat, 670 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 27.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 760 GetRequests, 72 SyntacticMatches, 41 SemanticMatches, 647 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6986 ImplicationChecksByTransitivity, 12.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=111273occurred 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.6s AutomataMinimizationTime, 32 MinimizatonAttempts, 273727 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.4s InterpolantComputationTime, 1522 NumberOfCodeBlocks, 1522 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 1434 ConstructedInterpolants, 0 QuantifiedInterpolants, 377578 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 32 InterpolantComputations, 32 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...