/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-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe002_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 22:09:45,134 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 22:09:45,137 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 22:09:45,155 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 22:09:45,156 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 22:09:45,157 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 22:09:45,159 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 22:09:45,160 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 22:09:45,166 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 22:09:45,167 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 22:09:45,168 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 22:09:45,169 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 22:09:45,169 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 22:09:45,173 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 22:09:45,174 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 22:09:45,175 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 22:09:45,176 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 22:09:45,177 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 22:09:45,179 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 22:09:45,181 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 22:09:45,182 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 22:09:45,183 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 22:09:45,184 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 22:09:45,185 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 22:09:45,187 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 22:09:45,188 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 22:09:45,188 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 22:09:45,189 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 22:09:45,189 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 22:09:45,190 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 22:09:45,190 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 22:09:45,191 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 22:09:45,191 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 22:09:45,192 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 22:09:45,193 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 22:09:45,193 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 22:09:45,194 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 22:09:45,194 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 22:09:45,194 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 22:09:45,195 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 22:09:45,196 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 22:09:45,197 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-MCR.epf [2019-12-27 22:09:45,210 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 22:09:45,211 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 22:09:45,212 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 22:09:45,212 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 22:09:45,212 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 22:09:45,213 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 22:09:45,213 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 22:09:45,213 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 22:09:45,213 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 22:09:45,213 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 22:09:45,213 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 22:09:45,214 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 22:09:45,214 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 22:09:45,214 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 22:09:45,214 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 22:09:45,214 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 22:09:45,215 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 22:09:45,215 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 22:09:45,215 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 22:09:45,215 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 22:09:45,216 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 22:09:45,216 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 22:09:45,216 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 22:09:45,216 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 22:09:45,216 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 22:09:45,216 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 22:09:45,217 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 22:09:45,217 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 22:09:45,217 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 22:09:45,217 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 22:09:45,217 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 22:09:45,218 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 22:09:45,491 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 22:09:45,513 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 22:09:45,516 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 22:09:45,518 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 22:09:45,519 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 22:09:45,520 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe002_pso.oepc.i [2019-12-27 22:09:45,592 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a96efe8b/391646634c0448a994fc703e578b83b5/FLAG43a7f1722 [2019-12-27 22:09:46,193 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 22:09:46,194 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe002_pso.oepc.i [2019-12-27 22:09:46,210 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a96efe8b/391646634c0448a994fc703e578b83b5/FLAG43a7f1722 [2019-12-27 22:09:46,499 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a96efe8b/391646634c0448a994fc703e578b83b5 [2019-12-27 22:09:46,507 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 22:09:46,509 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 22:09:46,510 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 22:09:46,510 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 22:09:46,513 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 22:09:46,514 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 10:09:46" (1/1) ... [2019-12-27 22:09:46,517 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a53435a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:09:46, skipping insertion in model container [2019-12-27 22:09:46,517 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 10:09:46" (1/1) ... [2019-12-27 22:09:46,524 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 22:09:46,574 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 22:09:47,129 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 22:09:47,143 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 22:09:47,239 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 22:09:47,323 INFO L208 MainTranslator]: Completed translation [2019-12-27 22:09:47,324 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:09:47 WrapperNode [2019-12-27 22:09:47,324 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 22:09:47,325 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 22:09:47,325 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 22:09:47,325 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 22:09:47,334 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:09:47" (1/1) ... [2019-12-27 22:09:47,355 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:09:47" (1/1) ... [2019-12-27 22:09:47,386 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 22:09:47,387 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 22:09:47,387 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 22:09:47,387 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 22:09:47,397 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:09:47" (1/1) ... [2019-12-27 22:09:47,398 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:09:47" (1/1) ... [2019-12-27 22:09:47,403 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:09:47" (1/1) ... [2019-12-27 22:09:47,403 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:09:47" (1/1) ... [2019-12-27 22:09:47,426 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:09:47" (1/1) ... [2019-12-27 22:09:47,436 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:09:47" (1/1) ... [2019-12-27 22:09:47,441 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:09:47" (1/1) ... [2019-12-27 22:09:47,446 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 22:09:47,455 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 22:09:47,456 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 22:09:47,456 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 22:09:47,457 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:09:47" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 22:09:47,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 22:09:47,515 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 22:09:47,515 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 22:09:47,516 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 22:09:47,516 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 22:09:47,517 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 22:09:47,517 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 22:09:47,517 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 22:09:47,517 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 22:09:47,518 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 22:09:47,518 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 22:09:47,518 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 22:09:47,518 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 22:09:47,520 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 22:09:48,280 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 22:09:48,281 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 22:09:48,282 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 10:09:48 BoogieIcfgContainer [2019-12-27 22:09:48,282 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 22:09:48,284 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 22:09:48,284 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 22:09:48,295 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 22:09:48,296 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 10:09:46" (1/3) ... [2019-12-27 22:09:48,297 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33eeb6d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 10:09:48, skipping insertion in model container [2019-12-27 22:09:48,297 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:09:47" (2/3) ... [2019-12-27 22:09:48,297 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33eeb6d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 10:09:48, skipping insertion in model container [2019-12-27 22:09:48,297 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 10:09:48" (3/3) ... [2019-12-27 22:09:48,300 INFO L109 eAbstractionObserver]: Analyzing ICFG safe002_pso.oepc.i [2019-12-27 22:09:48,312 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 22:09:48,312 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 22:09:48,320 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 22:09:48,322 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 22:09:48,362 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,363 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,363 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,363 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,364 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,364 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,364 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,364 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,365 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,365 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,366 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,366 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,366 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,366 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,367 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,367 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,367 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,368 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,368 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,368 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,368 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,369 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,369 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,373 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,374 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,374 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,374 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,375 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,375 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,375 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,375 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,376 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,376 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,376 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,377 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,377 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,378 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,379 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,381 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,381 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,381 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,382 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,382 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,382 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,383 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,384 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,384 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,384 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,384 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,385 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,386 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,386 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,386 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,387 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,387 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,387 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,387 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,388 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,388 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,388 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,388 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,389 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,389 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,389 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,390 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,390 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,390 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,390 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,391 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,391 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,391 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,391 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,392 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,392 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,392 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,392 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,393 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,393 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,393 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,394 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,394 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,395 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,395 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,396 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,396 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,396 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,397 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,397 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,397 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,397 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,415 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,415 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,415 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,416 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,419 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,419 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,419 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,420 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,424 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,425 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,426 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,426 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,437 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,437 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,438 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,438 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,438 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,438 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,438 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,439 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,439 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,439 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,439 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,439 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,440 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,440 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,440 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,440 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,440 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,440 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,441 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,441 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,441 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,441 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,442 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,444 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,444 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,445 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,445 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,445 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,445 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,445 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,446 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,446 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,446 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,446 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,447 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,447 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,447 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,447 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,447 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,448 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,448 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,448 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,448 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,449 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,449 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,449 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,449 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,449 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,453 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,453 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,454 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,454 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,454 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,454 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,454 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,455 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,455 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,455 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,455 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,455 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,458 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,458 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,459 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,459 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,459 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,459 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,459 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,459 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,460 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,460 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,468 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,468 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,468 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,468 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,468 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,469 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,469 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,469 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,469 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,469 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,469 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,470 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,470 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,470 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,470 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,470 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,471 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,471 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,471 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,471 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,471 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,471 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,472 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,472 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,472 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,472 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,472 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:09:48,488 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 22:09:48,511 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 22:09:48,511 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 22:09:48,511 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 22:09:48,511 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 22:09:48,512 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 22:09:48,512 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 22:09:48,512 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 22:09:48,512 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 22:09:48,535 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 163 places, 194 transitions [2019-12-27 22:09:48,536 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-27 22:09:48,642 INFO L132 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-27 22:09:48,643 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 22:09:48,665 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 191 events. 41/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 445 event pairs. 0/148 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 22:09:48,687 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-27 22:09:48,758 INFO L132 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-27 22:09:48,758 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 22:09:48,766 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 191 events. 41/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 445 event pairs. 0/148 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 22:09:48,785 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-27 22:09:48,787 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 22:09:52,771 WARN L192 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-27 22:09:52,876 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-27 22:09:52,894 INFO L206 etLargeBlockEncoding]: Checked pairs total: 75395 [2019-12-27 22:09:52,894 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-27 22:09:52,898 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 84 places, 93 transitions [2019-12-27 22:10:05,824 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 89162 states. [2019-12-27 22:10:05,826 INFO L276 IsEmpty]: Start isEmpty. Operand 89162 states. [2019-12-27 22:10:05,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 22:10:05,832 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:10:05,833 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 22:10:05,833 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-27 22:10:05,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:10:05,838 INFO L82 PathProgramCache]: Analyzing trace with hash 795562218, now seen corresponding path program 1 times [2019-12-27 22:10:05,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:10:05,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425946115] [2019-12-27 22:10:05,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:10:05,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:10:06,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:10:06,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425946115] [2019-12-27 22:10:06,091 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:10:06,091 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 22:10:06,092 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [417007414] [2019-12-27 22:10:06,092 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:10:06,101 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:10:06,116 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 22:10:06,116 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:10:06,120 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:10:06,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:10:06,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:10:06,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:10:06,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:10:06,139 INFO L87 Difference]: Start difference. First operand 89162 states. Second operand 3 states. [2019-12-27 22:10:08,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:10:08,452 INFO L93 Difference]: Finished difference Result 87552 states and 377777 transitions. [2019-12-27 22:10:08,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:10:08,454 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 22:10:08,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:10:09,025 INFO L225 Difference]: With dead ends: 87552 [2019-12-27 22:10:09,025 INFO L226 Difference]: Without dead ends: 82092 [2019-12-27 22:10:09,029 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:10:13,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82092 states. [2019-12-27 22:10:15,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82092 to 82092. [2019-12-27 22:10:15,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82092 states. [2019-12-27 22:10:19,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82092 states to 82092 states and 353697 transitions. [2019-12-27 22:10:19,437 INFO L78 Accepts]: Start accepts. Automaton has 82092 states and 353697 transitions. Word has length 5 [2019-12-27 22:10:19,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:10:19,438 INFO L462 AbstractCegarLoop]: Abstraction has 82092 states and 353697 transitions. [2019-12-27 22:10:19,438 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:10:19,438 INFO L276 IsEmpty]: Start isEmpty. Operand 82092 states and 353697 transitions. [2019-12-27 22:10:19,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 22:10:19,454 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:10:19,454 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:10:19,455 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-27 22:10:19,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:10:19,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1486977711, now seen corresponding path program 1 times [2019-12-27 22:10:19,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:10:19,456 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114816259] [2019-12-27 22:10:19,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:10:19,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:10:19,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:10:19,589 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114816259] [2019-12-27 22:10:19,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:10:19,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:10:19,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [86191350] [2019-12-27 22:10:19,589 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:10:19,590 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:10:19,595 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 22:10:19,595 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:10:19,595 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:10:19,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:10:19,597 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:10:19,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:10:19,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:10:19,598 INFO L87 Difference]: Start difference. First operand 82092 states and 353697 transitions. Second operand 3 states. [2019-12-27 22:10:20,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:10:20,001 INFO L93 Difference]: Finished difference Result 21487 states and 74397 transitions. [2019-12-27 22:10:20,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:10:20,002 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 22:10:20,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:10:20,085 INFO L225 Difference]: With dead ends: 21487 [2019-12-27 22:10:20,086 INFO L226 Difference]: Without dead ends: 21487 [2019-12-27 22:10:20,086 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:10:20,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21487 states. [2019-12-27 22:10:20,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21487 to 21487. [2019-12-27 22:10:20,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21487 states. [2019-12-27 22:10:20,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21487 states to 21487 states and 74397 transitions. [2019-12-27 22:10:20,678 INFO L78 Accepts]: Start accepts. Automaton has 21487 states and 74397 transitions. Word has length 13 [2019-12-27 22:10:20,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:10:20,679 INFO L462 AbstractCegarLoop]: Abstraction has 21487 states and 74397 transitions. [2019-12-27 22:10:20,679 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:10:20,679 INFO L276 IsEmpty]: Start isEmpty. Operand 21487 states and 74397 transitions. [2019-12-27 22:10:20,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 22:10:20,681 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:10:20,681 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:10:20,681 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-27 22:10:20,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:10:20,682 INFO L82 PathProgramCache]: Analyzing trace with hash -726251993, now seen corresponding path program 1 times [2019-12-27 22:10:20,682 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:10:20,683 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882780366] [2019-12-27 22:10:20,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:10:20,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:10:20,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:10:20,781 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882780366] [2019-12-27 22:10:20,781 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:10:20,781 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:10:20,781 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1474228578] [2019-12-27 22:10:20,781 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:10:20,784 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:10:20,788 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 22:10:20,789 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:10:20,789 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:10:20,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:10:20,789 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:10:20,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:10:20,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:10:20,790 INFO L87 Difference]: Start difference. First operand 21487 states and 74397 transitions. Second operand 4 states. [2019-12-27 22:10:21,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:10:21,866 INFO L93 Difference]: Finished difference Result 31642 states and 105483 transitions. [2019-12-27 22:10:21,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:10:21,866 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 22:10:21,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:10:21,992 INFO L225 Difference]: With dead ends: 31642 [2019-12-27 22:10:21,992 INFO L226 Difference]: Without dead ends: 31628 [2019-12-27 22:10:21,992 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:10:22,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31628 states. [2019-12-27 22:10:22,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31628 to 28614. [2019-12-27 22:10:22,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28614 states. [2019-12-27 22:10:23,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28614 states to 28614 states and 96383 transitions. [2019-12-27 22:10:23,010 INFO L78 Accepts]: Start accepts. Automaton has 28614 states and 96383 transitions. Word has length 13 [2019-12-27 22:10:23,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:10:23,011 INFO L462 AbstractCegarLoop]: Abstraction has 28614 states and 96383 transitions. [2019-12-27 22:10:23,011 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:10:23,011 INFO L276 IsEmpty]: Start isEmpty. Operand 28614 states and 96383 transitions. [2019-12-27 22:10:23,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 22:10:23,013 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:10:23,013 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:10:23,014 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-27 22:10:23,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:10:23,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1448024626, now seen corresponding path program 1 times [2019-12-27 22:10:23,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:10:23,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079851872] [2019-12-27 22:10:23,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:10:23,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:10:23,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:10:23,120 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079851872] [2019-12-27 22:10:23,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:10:23,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:10:23,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [292395614] [2019-12-27 22:10:23,120 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:10:23,122 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:10:23,127 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 22:10:23,127 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:10:23,214 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 22:10:23,214 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 22:10:23,214 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:10:23,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 22:10:23,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 22:10:23,215 INFO L87 Difference]: Start difference. First operand 28614 states and 96383 transitions. Second operand 7 states. [2019-12-27 22:10:23,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:10:23,941 INFO L93 Difference]: Finished difference Result 41448 states and 137006 transitions. [2019-12-27 22:10:23,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 22:10:23,943 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2019-12-27 22:10:23,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:10:25,731 INFO L225 Difference]: With dead ends: 41448 [2019-12-27 22:10:25,732 INFO L226 Difference]: Without dead ends: 41430 [2019-12-27 22:10:25,733 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 22:10:25,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41430 states. [2019-12-27 22:10:26,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41430 to 32619. [2019-12-27 22:10:26,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32619 states. [2019-12-27 22:10:26,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32619 states to 32619 states and 109205 transitions. [2019-12-27 22:10:26,440 INFO L78 Accepts]: Start accepts. Automaton has 32619 states and 109205 transitions. Word has length 14 [2019-12-27 22:10:26,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:10:26,441 INFO L462 AbstractCegarLoop]: Abstraction has 32619 states and 109205 transitions. [2019-12-27 22:10:26,441 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 22:10:26,441 INFO L276 IsEmpty]: Start isEmpty. Operand 32619 states and 109205 transitions. [2019-12-27 22:10:26,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 22:10:26,452 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:10:26,452 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:10:26,452 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-27 22:10:26,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:10:26,453 INFO L82 PathProgramCache]: Analyzing trace with hash -84735485, now seen corresponding path program 1 times [2019-12-27 22:10:26,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:10:26,453 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143822351] [2019-12-27 22:10:26,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:10:26,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:10:26,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:10:26,545 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143822351] [2019-12-27 22:10:26,545 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:10:26,545 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 22:10:26,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1471716408] [2019-12-27 22:10:26,546 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:10:26,550 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:10:26,563 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 58 states and 92 transitions. [2019-12-27 22:10:26,563 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:10:26,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:10:26,715 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 22:10:26,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 22:10:26,715 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:10:26,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 22:10:26,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-27 22:10:26,716 INFO L87 Difference]: Start difference. First operand 32619 states and 109205 transitions. Second operand 9 states. [2019-12-27 22:10:29,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:10:29,108 INFO L93 Difference]: Finished difference Result 95957 states and 313890 transitions. [2019-12-27 22:10:29,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 22:10:29,109 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2019-12-27 22:10:29,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:10:29,342 INFO L225 Difference]: With dead ends: 95957 [2019-12-27 22:10:29,343 INFO L226 Difference]: Without dead ends: 95920 [2019-12-27 22:10:29,343 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2019-12-27 22:10:29,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95920 states. [2019-12-27 22:10:30,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95920 to 45667. [2019-12-27 22:10:30,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45667 states. [2019-12-27 22:10:30,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45667 states to 45667 states and 152523 transitions. [2019-12-27 22:10:30,917 INFO L78 Accepts]: Start accepts. Automaton has 45667 states and 152523 transitions. Word has length 22 [2019-12-27 22:10:30,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:10:30,918 INFO L462 AbstractCegarLoop]: Abstraction has 45667 states and 152523 transitions. [2019-12-27 22:10:30,918 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 22:10:30,918 INFO L276 IsEmpty]: Start isEmpty. Operand 45667 states and 152523 transitions. [2019-12-27 22:10:30,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 22:10:30,932 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:10:30,932 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:10:30,932 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-27 22:10:30,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:10:30,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1284284063, now seen corresponding path program 2 times [2019-12-27 22:10:30,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:10:30,933 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962986384] [2019-12-27 22:10:30,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:10:30,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:10:31,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:10:31,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962986384] [2019-12-27 22:10:31,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:10:31,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 22:10:31,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [788525789] [2019-12-27 22:10:31,008 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:10:31,012 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:10:31,020 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 39 states and 54 transitions. [2019-12-27 22:10:31,021 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:10:31,021 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:10:31,021 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 22:10:31,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:10:31,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 22:10:31,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:10:31,022 INFO L87 Difference]: Start difference. First operand 45667 states and 152523 transitions. Second operand 6 states. [2019-12-27 22:10:32,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:10:32,027 INFO L93 Difference]: Finished difference Result 70268 states and 228147 transitions. [2019-12-27 22:10:32,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 22:10:32,028 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 22:10:32,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:10:32,185 INFO L225 Difference]: With dead ends: 70268 [2019-12-27 22:10:32,185 INFO L226 Difference]: Without dead ends: 70238 [2019-12-27 22:10:32,186 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 22:10:32,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70238 states. [2019-12-27 22:10:33,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70238 to 43394. [2019-12-27 22:10:33,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43394 states. [2019-12-27 22:10:33,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43394 states to 43394 states and 144865 transitions. [2019-12-27 22:10:33,468 INFO L78 Accepts]: Start accepts. Automaton has 43394 states and 144865 transitions. Word has length 22 [2019-12-27 22:10:33,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:10:33,468 INFO L462 AbstractCegarLoop]: Abstraction has 43394 states and 144865 transitions. [2019-12-27 22:10:33,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 22:10:33,468 INFO L276 IsEmpty]: Start isEmpty. Operand 43394 states and 144865 transitions. [2019-12-27 22:10:33,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 22:10:33,483 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:10:33,483 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:10:33,483 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-27 22:10:33,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:10:33,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1211743988, now seen corresponding path program 1 times [2019-12-27 22:10:33,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:10:33,484 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196283990] [2019-12-27 22:10:33,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:10:33,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:10:33,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:10:33,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196283990] [2019-12-27 22:10:33,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:10:33,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:10:33,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [447162602] [2019-12-27 22:10:33,547 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:10:33,552 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:10:33,557 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 22:10:33,557 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:10:33,558 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:10:33,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:10:33,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:10:33,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:10:33,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:10:33,559 INFO L87 Difference]: Start difference. First operand 43394 states and 144865 transitions. Second operand 4 states. [2019-12-27 22:10:33,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:10:33,656 INFO L93 Difference]: Finished difference Result 17171 states and 53607 transitions. [2019-12-27 22:10:33,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 22:10:33,657 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 22:10:33,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:10:33,690 INFO L225 Difference]: With dead ends: 17171 [2019-12-27 22:10:33,690 INFO L226 Difference]: Without dead ends: 17171 [2019-12-27 22:10:33,691 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:10:33,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17171 states. [2019-12-27 22:10:33,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17171 to 17057. [2019-12-27 22:10:33,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17057 states. [2019-12-27 22:10:33,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17057 states to 17057 states and 53270 transitions. [2019-12-27 22:10:33,951 INFO L78 Accepts]: Start accepts. Automaton has 17057 states and 53270 transitions. Word has length 25 [2019-12-27 22:10:33,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:10:33,952 INFO L462 AbstractCegarLoop]: Abstraction has 17057 states and 53270 transitions. [2019-12-27 22:10:33,952 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:10:33,952 INFO L276 IsEmpty]: Start isEmpty. Operand 17057 states and 53270 transitions. [2019-12-27 22:10:33,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 22:10:33,976 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:10:33,977 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:10:33,977 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-27 22:10:33,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:10:33,977 INFO L82 PathProgramCache]: Analyzing trace with hash 261453908, now seen corresponding path program 1 times [2019-12-27 22:10:33,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:10:33,978 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346957539] [2019-12-27 22:10:33,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:10:34,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:10:34,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-27 22:10:34,043 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346957539] [2019-12-27 22:10:34,043 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:10:34,044 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 22:10:34,044 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [304435511] [2019-12-27 22:10:34,044 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:10:34,051 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:10:34,082 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 92 states and 143 transitions. [2019-12-27 22:10:34,083 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:10:34,083 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:10:34,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:10:34,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:10:34,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:10:34,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:10:34,085 INFO L87 Difference]: Start difference. First operand 17057 states and 53270 transitions. Second operand 3 states. [2019-12-27 22:10:34,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:10:34,158 INFO L93 Difference]: Finished difference Result 17056 states and 53268 transitions. [2019-12-27 22:10:34,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:10:34,158 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 22:10:34,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:10:34,183 INFO L225 Difference]: With dead ends: 17056 [2019-12-27 22:10:34,184 INFO L226 Difference]: Without dead ends: 17056 [2019-12-27 22:10:34,184 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:10:34,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17056 states. [2019-12-27 22:10:34,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17056 to 17056. [2019-12-27 22:10:34,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17056 states. [2019-12-27 22:10:34,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17056 states to 17056 states and 53268 transitions. [2019-12-27 22:10:34,544 INFO L78 Accepts]: Start accepts. Automaton has 17056 states and 53268 transitions. Word has length 39 [2019-12-27 22:10:34,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:10:34,545 INFO L462 AbstractCegarLoop]: Abstraction has 17056 states and 53268 transitions. [2019-12-27 22:10:34,545 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:10:34,545 INFO L276 IsEmpty]: Start isEmpty. Operand 17056 states and 53268 transitions. [2019-12-27 22:10:34,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 22:10:34,578 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:10:34,578 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:10:34,578 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-27 22:10:34,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:10:34,579 INFO L82 PathProgramCache]: Analyzing trace with hash 1879938010, now seen corresponding path program 1 times [2019-12-27 22:10:34,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:10:34,580 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310453548] [2019-12-27 22:10:34,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:10:34,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:10:34,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:10:34,644 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310453548] [2019-12-27 22:10:34,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:10:34,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 22:10:34,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1795379316] [2019-12-27 22:10:34,645 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:10:34,654 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:10:34,716 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 102 states and 162 transitions. [2019-12-27 22:10:34,716 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:10:34,720 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 22:10:34,720 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:10:34,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:10:34,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:10:34,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:10:34,721 INFO L87 Difference]: Start difference. First operand 17056 states and 53268 transitions. Second operand 5 states. [2019-12-27 22:10:34,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:10:34,816 INFO L93 Difference]: Finished difference Result 15547 states and 49413 transitions. [2019-12-27 22:10:34,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:10:34,817 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 22:10:34,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:10:34,847 INFO L225 Difference]: With dead ends: 15547 [2019-12-27 22:10:34,847 INFO L226 Difference]: Without dead ends: 15547 [2019-12-27 22:10:34,848 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-27 22:10:34,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15547 states. [2019-12-27 22:10:35,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15547 to 14745. [2019-12-27 22:10:35,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14745 states. [2019-12-27 22:10:35,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14745 states to 14745 states and 47130 transitions. [2019-12-27 22:10:35,096 INFO L78 Accepts]: Start accepts. Automaton has 14745 states and 47130 transitions. Word has length 40 [2019-12-27 22:10:35,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:10:35,096 INFO L462 AbstractCegarLoop]: Abstraction has 14745 states and 47130 transitions. [2019-12-27 22:10:35,097 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:10:35,097 INFO L276 IsEmpty]: Start isEmpty. Operand 14745 states and 47130 transitions. [2019-12-27 22:10:35,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 22:10:35,121 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:10:35,121 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-27 22:10:35,121 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-27 22:10:35,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:10:35,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1466334831, now seen corresponding path program 1 times [2019-12-27 22:10:35,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:10:35,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030914939] [2019-12-27 22:10:35,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:10:35,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:10:35,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:10:35,182 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030914939] [2019-12-27 22:10:35,182 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:10:35,182 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:10:35,182 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1376137213] [2019-12-27 22:10:35,182 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:10:35,199 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:10:35,444 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 233 states and 464 transitions. [2019-12-27 22:10:35,444 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:10:35,471 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 22:10:35,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:10:35,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:10:35,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:10:35,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:10:35,472 INFO L87 Difference]: Start difference. First operand 14745 states and 47130 transitions. Second operand 4 states. [2019-12-27 22:10:35,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:10:35,644 INFO L93 Difference]: Finished difference Result 19067 states and 60812 transitions. [2019-12-27 22:10:35,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:10:35,645 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-12-27 22:10:35,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:10:35,687 INFO L225 Difference]: With dead ends: 19067 [2019-12-27 22:10:35,688 INFO L226 Difference]: Without dead ends: 19067 [2019-12-27 22:10:35,688 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:10:35,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19067 states. [2019-12-27 22:10:36,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19067 to 12453. [2019-12-27 22:10:36,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12453 states. [2019-12-27 22:10:36,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12453 states to 12453 states and 39920 transitions. [2019-12-27 22:10:36,160 INFO L78 Accepts]: Start accepts. Automaton has 12453 states and 39920 transitions. Word has length 54 [2019-12-27 22:10:36,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:10:36,161 INFO L462 AbstractCegarLoop]: Abstraction has 12453 states and 39920 transitions. [2019-12-27 22:10:36,161 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:10:36,161 INFO L276 IsEmpty]: Start isEmpty. Operand 12453 states and 39920 transitions. [2019-12-27 22:10:36,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 22:10:36,176 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:10:36,177 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-27 22:10:36,177 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-27 22:10:36,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:10:36,177 INFO L82 PathProgramCache]: Analyzing trace with hash 81383116, now seen corresponding path program 1 times [2019-12-27 22:10:36,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:10:36,178 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604639169] [2019-12-27 22:10:36,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:10:36,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:10:36,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:10:36,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604639169] [2019-12-27 22:10:36,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:10:36,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:10:36,253 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [742004096] [2019-12-27 22:10:36,253 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:10:36,270 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:10:36,599 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 328 states and 708 transitions. [2019-12-27 22:10:36,599 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:10:36,601 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:10:36,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:10:36,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:10:36,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:10:36,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:10:36,602 INFO L87 Difference]: Start difference. First operand 12453 states and 39920 transitions. Second operand 4 states. [2019-12-27 22:10:36,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:10:36,733 INFO L93 Difference]: Finished difference Result 23822 states and 76579 transitions. [2019-12-27 22:10:36,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 22:10:36,733 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-12-27 22:10:36,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:10:36,758 INFO L225 Difference]: With dead ends: 23822 [2019-12-27 22:10:36,758 INFO L226 Difference]: Without dead ends: 11678 [2019-12-27 22:10:36,759 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:10:36,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11678 states. [2019-12-27 22:10:36,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11678 to 11678. [2019-12-27 22:10:36,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11678 states. [2019-12-27 22:10:37,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11678 states to 11678 states and 37549 transitions. [2019-12-27 22:10:37,019 INFO L78 Accepts]: Start accepts. Automaton has 11678 states and 37549 transitions. Word has length 54 [2019-12-27 22:10:37,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:10:37,019 INFO L462 AbstractCegarLoop]: Abstraction has 11678 states and 37549 transitions. [2019-12-27 22:10:37,019 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:10:37,019 INFO L276 IsEmpty]: Start isEmpty. Operand 11678 states and 37549 transitions. [2019-12-27 22:10:37,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 22:10:37,034 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:10:37,034 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-27 22:10:37,034 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-27 22:10:37,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:10:37,035 INFO L82 PathProgramCache]: Analyzing trace with hash -886395566, now seen corresponding path program 2 times [2019-12-27 22:10:37,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:10:37,035 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811545754] [2019-12-27 22:10:37,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:10:37,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:10:37,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:10:37,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811545754] [2019-12-27 22:10:37,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:10:37,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:10:37,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [253654822] [2019-12-27 22:10:37,115 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:10:37,131 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:10:37,457 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 295 states and 622 transitions. [2019-12-27 22:10:37,457 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:10:37,506 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 22:10:37,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 22:10:37,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:10:37,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 22:10:37,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:10:37,507 INFO L87 Difference]: Start difference. First operand 11678 states and 37549 transitions. Second operand 6 states. [2019-12-27 22:10:37,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:10:37,644 INFO L93 Difference]: Finished difference Result 33223 states and 107349 transitions. [2019-12-27 22:10:37,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:10:37,645 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-12-27 22:10:37,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:10:37,659 INFO L225 Difference]: With dead ends: 33223 [2019-12-27 22:10:37,659 INFO L226 Difference]: Without dead ends: 6909 [2019-12-27 22:10:37,659 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-27 22:10:37,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6909 states. [2019-12-27 22:10:37,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6909 to 6909. [2019-12-27 22:10:37,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6909 states. [2019-12-27 22:10:37,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6909 states to 6909 states and 22371 transitions. [2019-12-27 22:10:37,772 INFO L78 Accepts]: Start accepts. Automaton has 6909 states and 22371 transitions. Word has length 54 [2019-12-27 22:10:37,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:10:37,772 INFO L462 AbstractCegarLoop]: Abstraction has 6909 states and 22371 transitions. [2019-12-27 22:10:37,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 22:10:37,772 INFO L276 IsEmpty]: Start isEmpty. Operand 6909 states and 22371 transitions. [2019-12-27 22:10:37,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 22:10:37,780 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:10:37,780 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-27 22:10:37,780 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-27 22:10:37,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:10:37,780 INFO L82 PathProgramCache]: Analyzing trace with hash 139987658, now seen corresponding path program 3 times [2019-12-27 22:10:37,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:10:37,781 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109761230] [2019-12-27 22:10:37,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:10:37,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:10:37,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-27 22:10:37,864 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109761230] [2019-12-27 22:10:37,864 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:10:37,864 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 22:10:37,864 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2133901526] [2019-12-27 22:10:37,865 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:10:37,881 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:10:38,085 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 217 states and 425 transitions. [2019-12-27 22:10:38,086 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:10:38,180 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 17 times. [2019-12-27 22:10:38,180 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 22:10:38,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:10:38,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 22:10:38,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 22:10:38,181 INFO L87 Difference]: Start difference. First operand 6909 states and 22371 transitions. Second operand 8 states. [2019-12-27 22:10:38,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:10:38,478 INFO L93 Difference]: Finished difference Result 11531 states and 37278 transitions. [2019-12-27 22:10:38,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 22:10:38,479 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2019-12-27 22:10:38,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:10:38,493 INFO L225 Difference]: With dead ends: 11531 [2019-12-27 22:10:38,494 INFO L226 Difference]: Without dead ends: 8881 [2019-12-27 22:10:38,494 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 9 SyntacticMatches, 9 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-27 22:10:38,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8881 states. [2019-12-27 22:10:38,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8881 to 8116. [2019-12-27 22:10:38,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8116 states. [2019-12-27 22:10:38,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8116 states to 8116 states and 26358 transitions. [2019-12-27 22:10:38,631 INFO L78 Accepts]: Start accepts. Automaton has 8116 states and 26358 transitions. Word has length 54 [2019-12-27 22:10:38,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:10:38,631 INFO L462 AbstractCegarLoop]: Abstraction has 8116 states and 26358 transitions. [2019-12-27 22:10:38,631 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 22:10:38,631 INFO L276 IsEmpty]: Start isEmpty. Operand 8116 states and 26358 transitions. [2019-12-27 22:10:38,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 22:10:38,642 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:10:38,642 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-27 22:10:38,642 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-27 22:10:38,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:10:38,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1645888394, now seen corresponding path program 4 times [2019-12-27 22:10:38,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:10:38,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416119554] [2019-12-27 22:10:38,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:10:38,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:10:38,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:10:38,724 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416119554] [2019-12-27 22:10:38,724 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:10:38,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 22:10:38,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1863428726] [2019-12-27 22:10:38,724 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:10:38,758 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:10:38,973 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 235 states and 464 transitions. [2019-12-27 22:10:38,974 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:10:39,110 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 13 times. [2019-12-27 22:10:39,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 22:10:39,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:10:39,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 22:10:39,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-27 22:10:39,111 INFO L87 Difference]: Start difference. First operand 8116 states and 26358 transitions. Second operand 11 states. [2019-12-27 22:10:40,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:10:40,413 INFO L93 Difference]: Finished difference Result 17718 states and 56640 transitions. [2019-12-27 22:10:40,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 22:10:40,413 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 54 [2019-12-27 22:10:40,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:10:40,436 INFO L225 Difference]: With dead ends: 17718 [2019-12-27 22:10:40,436 INFO L226 Difference]: Without dead ends: 13078 [2019-12-27 22:10:40,437 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 8 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=398, Unknown=0, NotChecked=0, Total=506 [2019-12-27 22:10:40,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13078 states. [2019-12-27 22:10:40,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13078 to 9638. [2019-12-27 22:10:40,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9638 states. [2019-12-27 22:10:40,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9638 states to 9638 states and 31057 transitions. [2019-12-27 22:10:40,615 INFO L78 Accepts]: Start accepts. Automaton has 9638 states and 31057 transitions. Word has length 54 [2019-12-27 22:10:40,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:10:40,615 INFO L462 AbstractCegarLoop]: Abstraction has 9638 states and 31057 transitions. [2019-12-27 22:10:40,615 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 22:10:40,615 INFO L276 IsEmpty]: Start isEmpty. Operand 9638 states and 31057 transitions. [2019-12-27 22:10:40,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 22:10:40,628 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:10:40,628 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-27 22:10:40,629 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-27 22:10:40,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:10:40,629 INFO L82 PathProgramCache]: Analyzing trace with hash -1656812138, now seen corresponding path program 5 times [2019-12-27 22:10:40,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:10:40,630 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684014107] [2019-12-27 22:10:40,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:10:40,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:10:40,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:10:40,720 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684014107] [2019-12-27 22:10:40,721 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:10:40,721 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 22:10:40,721 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [887250299] [2019-12-27 22:10:40,721 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:10:40,736 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:10:40,905 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 191 states and 358 transitions. [2019-12-27 22:10:40,905 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:10:41,208 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 24 times. [2019-12-27 22:10:41,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 22:10:41,209 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:10:41,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 22:10:41,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-27 22:10:41,209 INFO L87 Difference]: Start difference. First operand 9638 states and 31057 transitions. Second operand 10 states. [2019-12-27 22:10:43,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:10:43,307 INFO L93 Difference]: Finished difference Result 45814 states and 142264 transitions. [2019-12-27 22:10:43,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 22:10:43,307 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2019-12-27 22:10:43,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:10:43,367 INFO L225 Difference]: With dead ends: 45814 [2019-12-27 22:10:43,368 INFO L226 Difference]: Without dead ends: 34428 [2019-12-27 22:10:43,368 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 11 SyntacticMatches, 12 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=212, Invalid=718, Unknown=0, NotChecked=0, Total=930 [2019-12-27 22:10:43,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34428 states. [2019-12-27 22:10:43,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34428 to 11386. [2019-12-27 22:10:43,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11386 states. [2019-12-27 22:10:43,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11386 states to 11386 states and 36608 transitions. [2019-12-27 22:10:43,859 INFO L78 Accepts]: Start accepts. Automaton has 11386 states and 36608 transitions. Word has length 54 [2019-12-27 22:10:43,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:10:43,859 INFO L462 AbstractCegarLoop]: Abstraction has 11386 states and 36608 transitions. [2019-12-27 22:10:43,859 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 22:10:43,859 INFO L276 IsEmpty]: Start isEmpty. Operand 11386 states and 36608 transitions. [2019-12-27 22:10:43,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 22:10:43,871 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:10:43,871 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-27 22:10:43,871 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-27 22:10:43,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:10:43,871 INFO L82 PathProgramCache]: Analyzing trace with hash -434377068, now seen corresponding path program 6 times [2019-12-27 22:10:43,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:10:43,872 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446801770] [2019-12-27 22:10:43,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:10:43,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:10:43,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:10:43,994 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446801770] [2019-12-27 22:10:43,994 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:10:43,994 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 22:10:43,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [452422359] [2019-12-27 22:10:43,994 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:10:44,010 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:10:44,151 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 214 states and 403 transitions. [2019-12-27 22:10:44,152 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:10:44,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:10:44,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:10:44,393 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 25 times. [2019-12-27 22:10:44,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 22:10:44,394 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:10:44,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 22:10:44,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-12-27 22:10:44,394 INFO L87 Difference]: Start difference. First operand 11386 states and 36608 transitions. Second operand 13 states. [2019-12-27 22:10:47,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:10:47,248 INFO L93 Difference]: Finished difference Result 45595 states and 140484 transitions. [2019-12-27 22:10:47,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 22:10:47,248 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 54 [2019-12-27 22:10:47,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:10:47,323 INFO L225 Difference]: With dead ends: 45595 [2019-12-27 22:10:47,324 INFO L226 Difference]: Without dead ends: 45511 [2019-12-27 22:10:47,324 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 20 SyntacticMatches, 11 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=217, Invalid=713, Unknown=0, NotChecked=0, Total=930 [2019-12-27 22:10:47,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45511 states. [2019-12-27 22:10:47,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45511 to 15102. [2019-12-27 22:10:47,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15102 states. [2019-12-27 22:10:47,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15102 states to 15102 states and 47525 transitions. [2019-12-27 22:10:47,989 INFO L78 Accepts]: Start accepts. Automaton has 15102 states and 47525 transitions. Word has length 54 [2019-12-27 22:10:47,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:10:47,989 INFO L462 AbstractCegarLoop]: Abstraction has 15102 states and 47525 transitions. [2019-12-27 22:10:47,989 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 22:10:47,990 INFO L276 IsEmpty]: Start isEmpty. Operand 15102 states and 47525 transitions. [2019-12-27 22:10:48,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 22:10:48,006 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:10:48,006 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-27 22:10:48,006 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-27 22:10:48,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:10:48,006 INFO L82 PathProgramCache]: Analyzing trace with hash -458785952, now seen corresponding path program 7 times [2019-12-27 22:10:48,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:10:48,007 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817684922] [2019-12-27 22:10:48,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:10:48,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:10:48,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:10:48,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817684922] [2019-12-27 22:10:48,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:10:48,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 22:10:48,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1542169072] [2019-12-27 22:10:48,108 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:10:48,122 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:10:48,273 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 232 states and 408 transitions. [2019-12-27 22:10:48,274 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:10:48,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:10:48,494 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 13 times. [2019-12-27 22:10:48,494 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 22:10:48,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:10:48,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 22:10:48,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-12-27 22:10:48,495 INFO L87 Difference]: Start difference. First operand 15102 states and 47525 transitions. Second operand 11 states. [2019-12-27 22:10:50,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:10:50,322 INFO L93 Difference]: Finished difference Result 27392 states and 84039 transitions. [2019-12-27 22:10:50,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 22:10:50,322 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 54 [2019-12-27 22:10:50,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:10:50,364 INFO L225 Difference]: With dead ends: 27392 [2019-12-27 22:10:50,364 INFO L226 Difference]: Without dead ends: 27282 [2019-12-27 22:10:50,365 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 13 SyntacticMatches, 8 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2019-12-27 22:10:50,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27282 states. [2019-12-27 22:10:50,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27282 to 20082. [2019-12-27 22:10:50,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20082 states. [2019-12-27 22:10:50,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20082 states to 20082 states and 62583 transitions. [2019-12-27 22:10:50,750 INFO L78 Accepts]: Start accepts. Automaton has 20082 states and 62583 transitions. Word has length 54 [2019-12-27 22:10:50,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:10:50,751 INFO L462 AbstractCegarLoop]: Abstraction has 20082 states and 62583 transitions. [2019-12-27 22:10:50,751 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 22:10:50,751 INFO L276 IsEmpty]: Start isEmpty. Operand 20082 states and 62583 transitions. [2019-12-27 22:10:50,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 22:10:50,772 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:10:50,772 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-27 22:10:50,772 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-27 22:10:50,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:10:50,772 INFO L82 PathProgramCache]: Analyzing trace with hash -2051129792, now seen corresponding path program 8 times [2019-12-27 22:10:50,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:10:50,773 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881969209] [2019-12-27 22:10:50,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:10:50,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:10:50,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:10:50,834 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881969209] [2019-12-27 22:10:50,834 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:10:50,834 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:10:50,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [34975005] [2019-12-27 22:10:50,835 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:10:50,849 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:10:51,174 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 198 states and 335 transitions. [2019-12-27 22:10:51,174 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:10:51,185 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 22:10:51,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:10:51,186 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:10:51,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:10:51,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:10:51,186 INFO L87 Difference]: Start difference. First operand 20082 states and 62583 transitions. Second operand 4 states. [2019-12-27 22:10:51,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:10:51,454 INFO L93 Difference]: Finished difference Result 19276 states and 58903 transitions. [2019-12-27 22:10:51,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:10:51,455 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-12-27 22:10:51,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:10:51,484 INFO L225 Difference]: With dead ends: 19276 [2019-12-27 22:10:51,484 INFO L226 Difference]: Without dead ends: 19276 [2019-12-27 22:10:51,484 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:10:51,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19276 states. [2019-12-27 22:10:51,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19276 to 14152. [2019-12-27 22:10:51,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14152 states. [2019-12-27 22:10:51,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14152 states to 14152 states and 43541 transitions. [2019-12-27 22:10:51,741 INFO L78 Accepts]: Start accepts. Automaton has 14152 states and 43541 transitions. Word has length 54 [2019-12-27 22:10:51,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:10:51,741 INFO L462 AbstractCegarLoop]: Abstraction has 14152 states and 43541 transitions. [2019-12-27 22:10:51,741 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:10:51,741 INFO L276 IsEmpty]: Start isEmpty. Operand 14152 states and 43541 transitions. [2019-12-27 22:10:51,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 22:10:51,756 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:10:51,756 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:10:51,756 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-27 22:10:51,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:10:51,757 INFO L82 PathProgramCache]: Analyzing trace with hash -318791943, now seen corresponding path program 1 times [2019-12-27 22:10:51,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:10:51,758 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144832619] [2019-12-27 22:10:51,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:10:51,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:10:52,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:10:52,248 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144832619] [2019-12-27 22:10:52,248 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:10:52,248 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 22:10:52,248 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1933408992] [2019-12-27 22:10:52,248 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:10:52,263 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:10:52,447 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 213 states and 414 transitions. [2019-12-27 22:10:52,448 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:10:53,096 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 24 times. [2019-12-27 22:10:53,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-12-27 22:10:53,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:10:53,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-12-27 22:10:53,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=524, Unknown=0, NotChecked=0, Total=600 [2019-12-27 22:10:53,098 INFO L87 Difference]: Start difference. First operand 14152 states and 43541 transitions. Second operand 25 states. [2019-12-27 22:10:59,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:10:59,724 INFO L93 Difference]: Finished difference Result 22570 states and 68146 transitions. [2019-12-27 22:10:59,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-12-27 22:10:59,725 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 55 [2019-12-27 22:10:59,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:10:59,752 INFO L225 Difference]: With dead ends: 22570 [2019-12-27 22:10:59,752 INFO L226 Difference]: Without dead ends: 18564 [2019-12-27 22:10:59,753 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 8 SyntacticMatches, 11 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 989 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=600, Invalid=3060, Unknown=0, NotChecked=0, Total=3660 [2019-12-27 22:10:59,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18564 states. [2019-12-27 22:10:59,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18564 to 14822. [2019-12-27 22:10:59,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14822 states. [2019-12-27 22:10:59,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14822 states to 14822 states and 45261 transitions. [2019-12-27 22:10:59,995 INFO L78 Accepts]: Start accepts. Automaton has 14822 states and 45261 transitions. Word has length 55 [2019-12-27 22:10:59,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:10:59,995 INFO L462 AbstractCegarLoop]: Abstraction has 14822 states and 45261 transitions. [2019-12-27 22:10:59,995 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-12-27 22:10:59,995 INFO L276 IsEmpty]: Start isEmpty. Operand 14822 states and 45261 transitions. [2019-12-27 22:11:00,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 22:11:00,012 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:11:00,012 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-27 22:11:00,012 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-27 22:11:00,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:11:00,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1040235271, now seen corresponding path program 2 times [2019-12-27 22:11:00,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:11:00,013 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643942769] [2019-12-27 22:11:00,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:11:00,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:11:00,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:11:00,457 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643942769] [2019-12-27 22:11:00,457 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:11:00,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 22:11:00,458 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1595924594] [2019-12-27 22:11:00,458 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:11:00,469 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:11:00,690 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 220 states and 427 transitions. [2019-12-27 22:11:00,690 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:11:01,510 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 33 times. [2019-12-27 22:11:01,510 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-12-27 22:11:01,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:11:01,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-12-27 22:11:01,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=521, Unknown=0, NotChecked=0, Total=600 [2019-12-27 22:11:01,512 INFO L87 Difference]: Start difference. First operand 14822 states and 45261 transitions. Second operand 25 states. [2019-12-27 22:11:07,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:11:07,959 INFO L93 Difference]: Finished difference Result 31709 states and 95098 transitions. [2019-12-27 22:11:07,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-12-27 22:11:07,960 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 55 [2019-12-27 22:11:07,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:11:07,996 INFO L225 Difference]: With dead ends: 31709 [2019-12-27 22:11:07,996 INFO L226 Difference]: Without dead ends: 25001 [2019-12-27 22:11:07,998 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 13 SyntacticMatches, 14 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1406 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=705, Invalid=4125, Unknown=0, NotChecked=0, Total=4830 [2019-12-27 22:11:08,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25001 states. [2019-12-27 22:11:08,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25001 to 15052. [2019-12-27 22:11:08,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15052 states. [2019-12-27 22:11:08,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15052 states to 15052 states and 45637 transitions. [2019-12-27 22:11:08,319 INFO L78 Accepts]: Start accepts. Automaton has 15052 states and 45637 transitions. Word has length 55 [2019-12-27 22:11:08,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:11:08,319 INFO L462 AbstractCegarLoop]: Abstraction has 15052 states and 45637 transitions. [2019-12-27 22:11:08,319 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-12-27 22:11:08,319 INFO L276 IsEmpty]: Start isEmpty. Operand 15052 states and 45637 transitions. [2019-12-27 22:11:08,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 22:11:08,338 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:11:08,338 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-27 22:11:08,338 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-27 22:11:08,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:11:08,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1381666515, now seen corresponding path program 3 times [2019-12-27 22:11:08,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:11:08,339 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588720685] [2019-12-27 22:11:08,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:11:08,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:11:09,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:11:09,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588720685] [2019-12-27 22:11:09,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:11:09,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-27 22:11:09,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [894110705] [2019-12-27 22:11:09,008 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:11:09,020 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:11:09,247 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 236 states and 475 transitions. [2019-12-27 22:11:09,247 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:11:10,233 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 40 times. [2019-12-27 22:11:10,233 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-12-27 22:11:10,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:11:10,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-12-27 22:11:10,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=617, Unknown=0, NotChecked=0, Total=702 [2019-12-27 22:11:10,234 INFO L87 Difference]: Start difference. First operand 15052 states and 45637 transitions. Second operand 27 states. [2019-12-27 22:11:15,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:11:15,376 INFO L93 Difference]: Finished difference Result 28323 states and 84474 transitions. [2019-12-27 22:11:15,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-12-27 22:11:15,376 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 55 [2019-12-27 22:11:15,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:11:15,411 INFO L225 Difference]: With dead ends: 28323 [2019-12-27 22:11:15,412 INFO L226 Difference]: Without dead ends: 25332 [2019-12-27 22:11:15,413 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 16 SyntacticMatches, 19 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1369 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=701, Invalid=3855, Unknown=0, NotChecked=0, Total=4556 [2019-12-27 22:11:15,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25332 states. [2019-12-27 22:11:15,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25332 to 15122. [2019-12-27 22:11:15,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15122 states. [2019-12-27 22:11:15,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15122 states to 15122 states and 45812 transitions. [2019-12-27 22:11:15,715 INFO L78 Accepts]: Start accepts. Automaton has 15122 states and 45812 transitions. Word has length 55 [2019-12-27 22:11:15,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:11:15,715 INFO L462 AbstractCegarLoop]: Abstraction has 15122 states and 45812 transitions. [2019-12-27 22:11:15,715 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-12-27 22:11:15,715 INFO L276 IsEmpty]: Start isEmpty. Operand 15122 states and 45812 transitions. [2019-12-27 22:11:15,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 22:11:15,732 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:11:15,732 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-27 22:11:15,732 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-27 22:11:15,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:11:15,732 INFO L82 PathProgramCache]: Analyzing trace with hash -1219687005, now seen corresponding path program 4 times [2019-12-27 22:11:15,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:11:15,733 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423676333] [2019-12-27 22:11:15,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:11:15,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:11:16,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:11:16,240 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423676333] [2019-12-27 22:11:16,240 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:11:16,240 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 22:11:16,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [567661962] [2019-12-27 22:11:16,240 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:11:16,247 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:11:16,390 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 224 states and 441 transitions. [2019-12-27 22:11:16,390 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:11:16,698 WARN L192 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-12-27 22:11:17,522 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 43 times. [2019-12-27 22:11:17,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-12-27 22:11:17,523 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:11:17,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-12-27 22:11:17,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=661, Unknown=0, NotChecked=0, Total=756 [2019-12-27 22:11:17,524 INFO L87 Difference]: Start difference. First operand 15122 states and 45812 transitions. Second operand 28 states. [2019-12-27 22:11:25,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:11:25,216 INFO L93 Difference]: Finished difference Result 36431 states and 108850 transitions. [2019-12-27 22:11:25,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-12-27 22:11:25,217 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 55 [2019-12-27 22:11:25,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:11:25,266 INFO L225 Difference]: With dead ends: 36431 [2019-12-27 22:11:25,266 INFO L226 Difference]: Without dead ends: 33713 [2019-12-27 22:11:25,268 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 15 SyntacticMatches, 20 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2423 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1096, Invalid=6560, Unknown=0, NotChecked=0, Total=7656 [2019-12-27 22:11:25,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33713 states. [2019-12-27 22:11:25,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33713 to 15218. [2019-12-27 22:11:25,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15218 states. [2019-12-27 22:11:25,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15218 states to 15218 states and 46088 transitions. [2019-12-27 22:11:25,829 INFO L78 Accepts]: Start accepts. Automaton has 15218 states and 46088 transitions. Word has length 55 [2019-12-27 22:11:25,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:11:25,829 INFO L462 AbstractCegarLoop]: Abstraction has 15218 states and 46088 transitions. [2019-12-27 22:11:25,829 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-12-27 22:11:25,829 INFO L276 IsEmpty]: Start isEmpty. Operand 15218 states and 46088 transitions. [2019-12-27 22:11:25,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 22:11:25,846 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:11:25,846 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-27 22:11:25,846 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-27 22:11:25,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:11:25,846 INFO L82 PathProgramCache]: Analyzing trace with hash -975824335, now seen corresponding path program 5 times [2019-12-27 22:11:25,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:11:25,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901052073] [2019-12-27 22:11:25,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:11:25,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:11:26,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:11:26,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901052073] [2019-12-27 22:11:26,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:11:26,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 22:11:26,291 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [410886900] [2019-12-27 22:11:26,291 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:11:26,297 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:11:26,440 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 202 states and 386 transitions. [2019-12-27 22:11:26,440 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:11:27,612 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 37 times. [2019-12-27 22:11:27,612 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-12-27 22:11:27,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:11:27,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-12-27 22:11:27,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=671, Unknown=0, NotChecked=0, Total=756 [2019-12-27 22:11:27,613 INFO L87 Difference]: Start difference. First operand 15218 states and 46088 transitions. Second operand 28 states. [2019-12-27 22:11:42,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:11:42,468 INFO L93 Difference]: Finished difference Result 44912 states and 132435 transitions. [2019-12-27 22:11:42,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 161 states. [2019-12-27 22:11:42,468 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 55 [2019-12-27 22:11:42,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:11:42,533 INFO L225 Difference]: With dead ends: 44912 [2019-12-27 22:11:42,533 INFO L226 Difference]: Without dead ends: 42265 [2019-12-27 22:11:42,541 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 20 SyntacticMatches, 15 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11313 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=3100, Invalid=27350, Unknown=0, NotChecked=0, Total=30450 [2019-12-27 22:11:42,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42265 states. [2019-12-27 22:11:43,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42265 to 20681. [2019-12-27 22:11:43,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20681 states. [2019-12-27 22:11:43,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20681 states to 20681 states and 62329 transitions. [2019-12-27 22:11:43,147 INFO L78 Accepts]: Start accepts. Automaton has 20681 states and 62329 transitions. Word has length 55 [2019-12-27 22:11:43,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:11:43,147 INFO L462 AbstractCegarLoop]: Abstraction has 20681 states and 62329 transitions. [2019-12-27 22:11:43,147 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-12-27 22:11:43,147 INFO L276 IsEmpty]: Start isEmpty. Operand 20681 states and 62329 transitions. [2019-12-27 22:11:43,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 22:11:43,171 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:11:43,171 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-27 22:11:43,172 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-27 22:11:43,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:11:43,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1048892077, now seen corresponding path program 6 times [2019-12-27 22:11:43,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:11:43,173 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053781438] [2019-12-27 22:11:43,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:11:43,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:11:43,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:11:43,334 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053781438] [2019-12-27 22:11:43,334 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:11:43,334 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 22:11:43,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1704938380] [2019-12-27 22:11:43,336 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:11:43,346 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:11:43,456 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 175 states and 323 transitions. [2019-12-27 22:11:43,456 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:11:43,602 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 22:11:43,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 22:11:43,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:11:43,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 22:11:43,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-12-27 22:11:43,604 INFO L87 Difference]: Start difference. First operand 20681 states and 62329 transitions. Second operand 13 states. [2019-12-27 22:11:45,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:11:45,007 INFO L93 Difference]: Finished difference Result 29884 states and 89248 transitions. [2019-12-27 22:11:45,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 22:11:45,008 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 55 [2019-12-27 22:11:45,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:11:45,039 INFO L225 Difference]: With dead ends: 29884 [2019-12-27 22:11:45,039 INFO L226 Difference]: Without dead ends: 22189 [2019-12-27 22:11:45,040 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2019-12-27 22:11:45,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22189 states. [2019-12-27 22:11:45,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22189 to 20797. [2019-12-27 22:11:45,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20797 states. [2019-12-27 22:11:45,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20797 states to 20797 states and 62609 transitions. [2019-12-27 22:11:45,351 INFO L78 Accepts]: Start accepts. Automaton has 20797 states and 62609 transitions. Word has length 55 [2019-12-27 22:11:45,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:11:45,352 INFO L462 AbstractCegarLoop]: Abstraction has 20797 states and 62609 transitions. [2019-12-27 22:11:45,352 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 22:11:45,352 INFO L276 IsEmpty]: Start isEmpty. Operand 20797 states and 62609 transitions. [2019-12-27 22:11:45,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 22:11:45,373 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:11:45,373 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-27 22:11:45,373 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-27 22:11:45,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:11:45,373 INFO L82 PathProgramCache]: Analyzing trace with hash -228588437, now seen corresponding path program 7 times [2019-12-27 22:11:45,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:11:45,374 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444180810] [2019-12-27 22:11:45,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:11:45,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:11:45,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:11:45,519 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444180810] [2019-12-27 22:11:45,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:11:45,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 22:11:45,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1596689431] [2019-12-27 22:11:45,520 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:11:45,530 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:11:45,692 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 205 states and 399 transitions. [2019-12-27 22:11:45,693 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:11:45,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:11:45,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:11:46,043 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 25 times. [2019-12-27 22:11:46,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 22:11:46,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:11:46,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 22:11:46,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2019-12-27 22:11:46,044 INFO L87 Difference]: Start difference. First operand 20797 states and 62609 transitions. Second operand 16 states. [2019-12-27 22:11:49,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:11:49,655 INFO L93 Difference]: Finished difference Result 46737 states and 136515 transitions. [2019-12-27 22:11:49,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-27 22:11:49,656 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 55 [2019-12-27 22:11:49,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:11:49,724 INFO L225 Difference]: With dead ends: 46737 [2019-12-27 22:11:49,724 INFO L226 Difference]: Without dead ends: 46533 [2019-12-27 22:11:49,725 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 14 SyntacticMatches, 11 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=241, Invalid=1019, Unknown=0, NotChecked=0, Total=1260 [2019-12-27 22:11:49,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46533 states. [2019-12-27 22:11:50,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46533 to 22738. [2019-12-27 22:11:50,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22738 states. [2019-12-27 22:11:50,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22738 states to 22738 states and 68014 transitions. [2019-12-27 22:11:50,246 INFO L78 Accepts]: Start accepts. Automaton has 22738 states and 68014 transitions. Word has length 55 [2019-12-27 22:11:50,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:11:50,246 INFO L462 AbstractCegarLoop]: Abstraction has 22738 states and 68014 transitions. [2019-12-27 22:11:50,246 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 22:11:50,246 INFO L276 IsEmpty]: Start isEmpty. Operand 22738 states and 68014 transitions. [2019-12-27 22:11:50,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 22:11:50,270 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:11:50,271 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-27 22:11:50,271 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-27 22:11:50,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:11:50,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1440625269, now seen corresponding path program 8 times [2019-12-27 22:11:50,272 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:11:50,272 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706323718] [2019-12-27 22:11:50,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:11:50,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:11:50,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:11:50,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706323718] [2019-12-27 22:11:50,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:11:50,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 22:11:50,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1399703970] [2019-12-27 22:11:50,479 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:11:50,488 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:11:50,586 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 154 states and 269 transitions. [2019-12-27 22:11:50,586 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:11:51,018 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 30 times. [2019-12-27 22:11:51,018 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 22:11:51,018 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:11:51,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 22:11:51,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2019-12-27 22:11:51,019 INFO L87 Difference]: Start difference. First operand 22738 states and 68014 transitions. Second operand 17 states. [2019-12-27 22:11:54,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:11:54,376 INFO L93 Difference]: Finished difference Result 44154 states and 129512 transitions. [2019-12-27 22:11:54,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-12-27 22:11:54,377 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 55 [2019-12-27 22:11:54,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:11:54,426 INFO L225 Difference]: With dead ends: 44154 [2019-12-27 22:11:54,426 INFO L226 Difference]: Without dead ends: 36481 [2019-12-27 22:11:54,427 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 13 SyntacticMatches, 13 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 381 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=281, Invalid=1441, Unknown=0, NotChecked=0, Total=1722 [2019-12-27 22:11:54,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36481 states. [2019-12-27 22:11:54,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36481 to 22591. [2019-12-27 22:11:54,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22591 states. [2019-12-27 22:11:54,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22591 states to 22591 states and 67561 transitions. [2019-12-27 22:11:54,859 INFO L78 Accepts]: Start accepts. Automaton has 22591 states and 67561 transitions. Word has length 55 [2019-12-27 22:11:54,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:11:54,859 INFO L462 AbstractCegarLoop]: Abstraction has 22591 states and 67561 transitions. [2019-12-27 22:11:54,859 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 22:11:54,859 INFO L276 IsEmpty]: Start isEmpty. Operand 22591 states and 67561 transitions. [2019-12-27 22:11:54,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 22:11:54,891 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:11:54,891 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-27 22:11:54,891 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-27 22:11:54,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:11:54,891 INFO L82 PathProgramCache]: Analyzing trace with hash 331505035, now seen corresponding path program 9 times [2019-12-27 22:11:54,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:11:54,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841519655] [2019-12-27 22:11:54,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:11:54,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:11:54,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:11:54,941 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841519655] [2019-12-27 22:11:54,941 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:11:54,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:11:54,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1650798822] [2019-12-27 22:11:54,942 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:11:54,951 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:11:55,078 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 136 states and 227 transitions. [2019-12-27 22:11:55,078 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:11:55,079 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:11:55,079 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:11:55,079 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:11:55,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:11:55,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:11:55,080 INFO L87 Difference]: Start difference. First operand 22591 states and 67561 transitions. Second operand 3 states. [2019-12-27 22:11:55,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:11:55,170 INFO L93 Difference]: Finished difference Result 22591 states and 67559 transitions. [2019-12-27 22:11:55,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:11:55,171 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-27 22:11:55,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:11:55,203 INFO L225 Difference]: With dead ends: 22591 [2019-12-27 22:11:55,203 INFO L226 Difference]: Without dead ends: 22591 [2019-12-27 22:11:55,203 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-27 22:11:55,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22591 states. [2019-12-27 22:11:55,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22591 to 21305. [2019-12-27 22:11:55,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21305 states. [2019-12-27 22:11:55,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21305 states to 21305 states and 64205 transitions. [2019-12-27 22:11:55,568 INFO L78 Accepts]: Start accepts. Automaton has 21305 states and 64205 transitions. Word has length 55 [2019-12-27 22:11:55,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:11:55,568 INFO L462 AbstractCegarLoop]: Abstraction has 21305 states and 64205 transitions. [2019-12-27 22:11:55,568 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:11:55,568 INFO L276 IsEmpty]: Start isEmpty. Operand 21305 states and 64205 transitions. [2019-12-27 22:11:55,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 22:11:55,596 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:11:55,596 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-27 22:11:55,596 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-27 22:11:55,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:11:55,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1217498149, now seen corresponding path program 1 times [2019-12-27 22:11:55,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:11:55,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591810392] [2019-12-27 22:11:55,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:11:55,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:11:55,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:11:55,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591810392] [2019-12-27 22:11:55,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:11:55,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 22:11:55,758 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [915955053] [2019-12-27 22:11:55,758 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:11:55,768 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:11:55,971 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 206 states and 400 transitions. [2019-12-27 22:11:55,971 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:11:56,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:11:56,179 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 21 times. [2019-12-27 22:11:56,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 22:11:56,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:11:56,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 22:11:56,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-12-27 22:11:56,180 INFO L87 Difference]: Start difference. First operand 21305 states and 64205 transitions. Second operand 15 states. [2019-12-27 22:11:57,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:11:57,923 INFO L93 Difference]: Finished difference Result 23747 states and 70889 transitions. [2019-12-27 22:11:57,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 22:11:57,924 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 56 [2019-12-27 22:11:57,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:11:57,958 INFO L225 Difference]: With dead ends: 23747 [2019-12-27 22:11:57,958 INFO L226 Difference]: Without dead ends: 22933 [2019-12-27 22:11:57,958 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 10 SyntacticMatches, 8 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2019-12-27 22:11:58,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22933 states. [2019-12-27 22:11:58,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22933 to 21269. [2019-12-27 22:11:58,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21269 states. [2019-12-27 22:11:58,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21269 states to 21269 states and 64121 transitions. [2019-12-27 22:11:58,304 INFO L78 Accepts]: Start accepts. Automaton has 21269 states and 64121 transitions. Word has length 56 [2019-12-27 22:11:58,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:11:58,304 INFO L462 AbstractCegarLoop]: Abstraction has 21269 states and 64121 transitions. [2019-12-27 22:11:58,304 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 22:11:58,304 INFO L276 IsEmpty]: Start isEmpty. Operand 21269 states and 64121 transitions. [2019-12-27 22:11:58,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 22:11:58,330 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:11:58,330 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-27 22:11:58,330 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-27 22:11:58,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:11:58,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1182373687, now seen corresponding path program 2 times [2019-12-27 22:11:58,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:11:58,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015267487] [2019-12-27 22:11:58,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:11:58,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:11:58,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:11:58,490 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015267487] [2019-12-27 22:11:58,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:11:58,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 22:11:58,490 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [791035744] [2019-12-27 22:11:58,491 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:11:58,512 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:11:58,763 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 206 states and 402 transitions. [2019-12-27 22:11:58,764 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:11:59,239 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 20 times. [2019-12-27 22:11:59,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-27 22:11:59,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:11:59,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-27 22:11:59,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2019-12-27 22:11:59,240 INFO L87 Difference]: Start difference. First operand 21269 states and 64121 transitions. Second operand 20 states. [2019-12-27 22:12:03,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:12:03,223 INFO L93 Difference]: Finished difference Result 37958 states and 112662 transitions. [2019-12-27 22:12:03,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-12-27 22:12:03,224 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 56 [2019-12-27 22:12:03,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:12:03,280 INFO L225 Difference]: With dead ends: 37958 [2019-12-27 22:12:03,280 INFO L226 Difference]: Without dead ends: 37648 [2019-12-27 22:12:03,281 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 8 SyntacticMatches, 5 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1744 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=885, Invalid=5121, Unknown=0, NotChecked=0, Total=6006 [2019-12-27 22:12:03,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37648 states. [2019-12-27 22:12:03,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37648 to 21355. [2019-12-27 22:12:03,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21355 states. [2019-12-27 22:12:03,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21355 states to 21355 states and 64289 transitions. [2019-12-27 22:12:03,877 INFO L78 Accepts]: Start accepts. Automaton has 21355 states and 64289 transitions. Word has length 56 [2019-12-27 22:12:03,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:12:03,878 INFO L462 AbstractCegarLoop]: Abstraction has 21355 states and 64289 transitions. [2019-12-27 22:12:03,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-27 22:12:03,878 INFO L276 IsEmpty]: Start isEmpty. Operand 21355 states and 64289 transitions. [2019-12-27 22:12:03,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 22:12:03,900 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:12:03,900 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-27 22:12:03,901 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-27 22:12:03,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:12:03,901 INFO L82 PathProgramCache]: Analyzing trace with hash 1747486899, now seen corresponding path program 3 times [2019-12-27 22:12:03,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:12:03,902 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963194126] [2019-12-27 22:12:03,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:12:03,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 22:12:03,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 22:12:04,048 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 22:12:04,048 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 22:12:04,052 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [808] [808] ULTIMATE.startENTRY-->L816: Formula: (let ((.cse0 (store |v_#valid_68| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= v_~main$tmp_guard0~0_10 0) (= 0 v_~x$read_delayed_var~0.offset_6) (= v_~x$r_buff1_thd1~0_43 0) (= 0 v_~x$w_buff0_used~0_108) (= v_~main$tmp_guard1~0_18 0) (= 0 v_~x$r_buff0_thd3~0_21) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t1831~0.base_27| 4) |v_#length_23|) (= 0 v_~x$w_buff1~0_25) (= 0 v_~x$r_buff0_thd0~0_22) (= |v_#valid_66| (store .cse0 |v_ULTIMATE.start_main_~#t1831~0.base_27| 1)) (= |v_#NULL.offset_3| 0) (= v_~x~0_26 0) (< 0 |v_#StackHeapBarrier_19|) (= v_~y~0_19 0) (= v_~x$r_buff1_thd0~0_26 0) (= 0 v_~weak$$choice2~0_32) (= (select .cse0 |v_ULTIMATE.start_main_~#t1831~0.base_27|) 0) (= v_~x$w_buff1_used~0_67 0) (= 0 v_~x$w_buff0~0_25) (= 0 v_~x$read_delayed~0_6) (= 0 v_~__unbuffered_p2_EAX~0_15) (= 0 v_~weak$$choice0~0_7) (= v_~x$flush_delayed~0_14 0) (= |v_#memory_int_21| (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1831~0.base_27| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1831~0.base_27|) |v_ULTIMATE.start_main_~#t1831~0.offset_19| 0))) (= 0 v_~x$r_buff0_thd1~0_74) (= v_~x$r_buff1_thd3~0_18 0) (= 0 v_~__unbuffered_p0_EAX~0_16) (= 0 |v_#NULL.base_3|) (= 0 v_~x$r_buff0_thd2~0_28) (= v_~x$mem_tmp~0_11 0) (= 0 v_~__unbuffered_cnt~0_22) (= v_~x$r_buff1_thd2~0_20 0) (= v_~__unbuffered_p0_EBX~0_16 0) (= |v_ULTIMATE.start_main_~#t1831~0.offset_19| 0) (< |v_#StackHeapBarrier_19| |v_ULTIMATE.start_main_~#t1831~0.base_27|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_19|, #valid=|v_#valid_68|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_25, ~x$flush_delayed~0=v_~x$flush_delayed~0_14, #NULL.offset=|v_#NULL.offset_3|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_43, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_21, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_10|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_10|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, ULTIMATE.start_main_~#t1832~0.base=|v_ULTIMATE.start_main_~#t1832~0.base_25|, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_15, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_22, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_16, ~x$w_buff1~0=v_~x$w_buff1~0_25, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_67, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_20, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_19|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~x~0=v_~x~0_26, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_74, ULTIMATE.start_main_~#t1831~0.offset=|v_ULTIMATE.start_main_~#t1831~0.offset_19|, ULTIMATE.start_main_~#t1833~0.base=|v_ULTIMATE.start_main_~#t1833~0.base_21|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_23|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_18, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~x$mem_tmp~0=v_~x$mem_tmp~0_11, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_12|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_10|, ~y~0=v_~y~0_19, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_8|, ULTIMATE.start_main_~#t1832~0.offset=|v_ULTIMATE.start_main_~#t1832~0.offset_19|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_26, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_28, #NULL.base=|v_#NULL.base_3|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_108, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_12|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_~#t1833~0.offset=|v_ULTIMATE.start_main_~#t1833~0.offset_14|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_16|, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~weak$$choice2~0=v_~weak$$choice2~0_32, ULTIMATE.start_main_~#t1831~0.base=|v_ULTIMATE.start_main_~#t1831~0.base_27|, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ULTIMATE.start_main_~#t1831~0.offset, ULTIMATE.start_main_~#t1833~0.base, #NULL.offset, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$r_buff0_thd3~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t1832~0.base, #length, ~__unbuffered_p2_EAX~0, ~y~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet40, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_~#t1832~0.offset, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_~#t1833~0.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet38, #memory_int, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~x~0, ULTIMATE.start_main_~#t1831~0.base, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 22:12:04,053 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L816-1-->L818: Formula: (and (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1832~0.base_10| 4)) (not (= |v_ULTIMATE.start_main_~#t1832~0.base_10| 0)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1832~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1832~0.base_10|) |v_ULTIMATE.start_main_~#t1832~0.offset_10| 1)) |v_#memory_int_15|) (= (store |v_#valid_38| |v_ULTIMATE.start_main_~#t1832~0.base_10| 1) |v_#valid_37|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1832~0.base_10|) (= 0 |v_ULTIMATE.start_main_~#t1832~0.offset_10|) (= (select |v_#valid_38| |v_ULTIMATE.start_main_~#t1832~0.base_10|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t1832~0.offset=|v_ULTIMATE.start_main_~#t1832~0.offset_10|, ULTIMATE.start_main_~#t1832~0.base=|v_ULTIMATE.start_main_~#t1832~0.base_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1832~0.offset, ULTIMATE.start_main_~#t1832~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-27 22:12:04,054 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L818-1-->L820: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t1833~0.base_10|)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1833~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1833~0.base_10|) |v_ULTIMATE.start_main_~#t1833~0.offset_9| 2)) |v_#memory_int_11|) (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t1833~0.base_10| 1)) (= |v_ULTIMATE.start_main_~#t1833~0.offset_9| 0) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1833~0.base_10|) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t1833~0.base_10|)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1833~0.base_10| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t1833~0.offset=|v_ULTIMATE.start_main_~#t1833~0.offset_9|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t1833~0.base=|v_ULTIMATE.start_main_~#t1833~0.base_10|, #length=|v_#length_13|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1833~0.offset, #valid, #memory_int, ULTIMATE.start_main_~#t1833~0.base, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-27 22:12:04,055 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [673] [673] L5-->L773: Formula: (and (= v_~x$r_buff1_thd0~0_10 v_~x$r_buff0_thd0~0_14) (not (= 0 v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_6)) (= v_~x$r_buff1_thd2~0_10 v_~x$r_buff0_thd2~0_16) (= 1 v_~y~0_7) (= v_~x$r_buff1_thd3~0_10 v_~x$r_buff0_thd3~0_14) (= 1 v_~x$r_buff0_thd2~0_15) (= v_~x$r_buff1_thd1~0_19 v_~x$r_buff0_thd1~0_35)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_14, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_35, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_6, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_14, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_16} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_14, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_35, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_6, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_10, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_10, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_19, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_14, ~y~0=v_~y~0_7, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_15, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_10} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 22:12:04,061 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L793-2-->L793-4: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In-1884629798 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In-1884629798 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite32_Out-1884629798| ~x$w_buff1~0_In-1884629798) (not .cse0) (not .cse1)) (and (= |P2Thread1of1ForFork1_#t~ite32_Out-1884629798| ~x~0_In-1884629798) (or .cse0 .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1884629798, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1884629798, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1884629798, ~x~0=~x~0_In-1884629798} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out-1884629798|, ~x$w_buff1~0=~x$w_buff1~0_In-1884629798, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1884629798, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1884629798, ~x~0=~x~0_In-1884629798} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-27 22:12:04,062 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L774-->L774-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In1761184808 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1761184808 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork0_#t~ite28_Out1761184808|) (not .cse1)) (and (= ~x$w_buff0_used~0_In1761184808 |P1Thread1of1ForFork0_#t~ite28_Out1761184808|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1761184808, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1761184808} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1761184808, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out1761184808|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1761184808} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-27 22:12:04,062 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L793-4-->L794: 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-27 22:12:04,063 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L794-->L794-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1290233648 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In-1290233648 256)))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite34_Out-1290233648|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~x$w_buff0_used~0_In-1290233648 |P2Thread1of1ForFork1_#t~ite34_Out-1290233648|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1290233648, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1290233648} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out-1290233648|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1290233648, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1290233648} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 22:12:04,065 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L775-->L775-2: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd2~0_In-2091257984 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In-2091257984 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-2091257984 256))) (.cse3 (= (mod ~x$r_buff0_thd2~0_In-2091257984 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite29_Out-2091257984|)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In-2091257984 |P1Thread1of1ForFork0_#t~ite29_Out-2091257984|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-2091257984, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-2091257984, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2091257984, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2091257984} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-2091257984, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-2091257984, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2091257984, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-2091257984|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2091257984} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 22:12:04,068 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L776-->L777: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In-452837322 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-452837322 256) 0))) (or (and (not .cse0) (not .cse1) (= ~x$r_buff0_thd2~0_Out-452837322 0)) (and (= ~x$r_buff0_thd2~0_Out-452837322 ~x$r_buff0_thd2~0_In-452837322) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-452837322, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-452837322} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out-452837322|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-452837322, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-452837322} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 22:12:04,068 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L777-->L777-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In-1634322896 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1634322896 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-1634322896 256))) (.cse3 (= 0 (mod ~x$r_buff1_thd2~0_In-1634322896 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite31_Out-1634322896| ~x$r_buff1_thd2~0_In-1634322896) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork0_#t~ite31_Out-1634322896|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1634322896, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1634322896, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1634322896, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1634322896} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out-1634322896|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1634322896, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1634322896, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1634322896, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1634322896} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 22:12:04,068 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L777-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_16 |v_P1Thread1of1ForFork0_#t~ite31_8|) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_7|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_16, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, 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-27 22:12:04,069 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L795-->L795-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In1117971012 256))) (.cse0 (= (mod ~x$r_buff0_thd3~0_In1117971012 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In1117971012 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd3~0_In1117971012 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite35_Out1117971012| ~x$w_buff1_used~0_In1117971012) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork1_#t~ite35_Out1117971012| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1117971012, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1117971012, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1117971012, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1117971012} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out1117971012|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1117971012, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1117971012, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1117971012, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1117971012} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 22:12:04,070 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L796-->L796-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In623920816 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In623920816 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite36_Out623920816| 0) (not .cse0) (not .cse1)) (and (= |P2Thread1of1ForFork1_#t~ite36_Out623920816| ~x$r_buff0_thd3~0_In623920816) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In623920816, ~x$w_buff0_used~0=~x$w_buff0_used~0_In623920816} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out623920816|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In623920816, ~x$w_buff0_used~0=~x$w_buff0_used~0_In623920816} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 22:12:04,073 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [787] [787] L739-->L739-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1770528149 256)))) (or (and (not .cse0) (= |P0Thread1of1ForFork2_#t~ite11_In-1770528149| |P0Thread1of1ForFork2_#t~ite11_Out-1770528149|) (= ~x$w_buff1~0_In-1770528149 |P0Thread1of1ForFork2_#t~ite12_Out-1770528149|)) (and (= |P0Thread1of1ForFork2_#t~ite12_Out-1770528149| |P0Thread1of1ForFork2_#t~ite11_Out-1770528149|) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-1770528149 256)))) (or (and (= 0 (mod ~x$w_buff1_used~0_In-1770528149 256)) .cse1) (and (= (mod ~x$r_buff1_thd1~0_In-1770528149 256) 0) .cse1) (= (mod ~x$w_buff0_used~0_In-1770528149 256) 0))) (= ~x$w_buff1~0_In-1770528149 |P0Thread1of1ForFork2_#t~ite11_Out-1770528149|) .cse0))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1770528149, ~x$w_buff1~0=~x$w_buff1~0_In-1770528149, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1770528149, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1770528149, ~weak$$choice2~0=~weak$$choice2~0_In-1770528149, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_In-1770528149|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1770528149} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1770528149, ~x$w_buff1~0=~x$w_buff1~0_In-1770528149, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1770528149, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1770528149, ~weak$$choice2~0=~weak$$choice2~0_In-1770528149, P0Thread1of1ForFork2_#t~ite12=|P0Thread1of1ForFork2_#t~ite12_Out-1770528149|, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_Out-1770528149|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1770528149} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite12, P0Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 22:12:04,074 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L740-->L740-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In680347267 256)))) (or (and (not .cse0) (= ~x$w_buff0_used~0_In680347267 |P0Thread1of1ForFork2_#t~ite15_Out680347267|) (= |P0Thread1of1ForFork2_#t~ite14_In680347267| |P0Thread1of1ForFork2_#t~ite14_Out680347267|)) (and (= |P0Thread1of1ForFork2_#t~ite15_Out680347267| |P0Thread1of1ForFork2_#t~ite14_Out680347267|) .cse0 (= ~x$w_buff0_used~0_In680347267 |P0Thread1of1ForFork2_#t~ite14_Out680347267|) (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In680347267 256) 0))) (or (and .cse1 (= (mod ~x$w_buff1_used~0_In680347267 256) 0)) (and .cse1 (= 0 (mod ~x$r_buff1_thd1~0_In680347267 256))) (= 0 (mod ~x$w_buff0_used~0_In680347267 256))))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In680347267, ~x$w_buff1_used~0=~x$w_buff1_used~0_In680347267, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In680347267, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_In680347267|, ~weak$$choice2~0=~weak$$choice2~0_In680347267, ~x$w_buff0_used~0=~x$w_buff0_used~0_In680347267} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In680347267, ~x$w_buff1_used~0=~x$w_buff1_used~0_In680347267, P0Thread1of1ForFork2_#t~ite15=|P0Thread1of1ForFork2_#t~ite15_Out680347267|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In680347267, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_Out680347267|, ~weak$$choice2~0=~weak$$choice2~0_In680347267, ~x$w_buff0_used~0=~x$w_buff0_used~0_In680347267} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite15, P0Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 22:12:04,075 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L742-->L743: Formula: (and (= v_~x$r_buff0_thd1~0_54 v_~x$r_buff0_thd1~0_53) (not (= 0 (mod v_~weak$$choice2~0_20 256)))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_54, ~weak$$choice2~0=v_~weak$$choice2~0_20} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_10|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_53, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_9|, ~weak$$choice2~0=v_~weak$$choice2~0_20, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_8|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-27 22:12:04,076 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L743-->L743-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In2080582026 256) 0))) (or (and (= |P0Thread1of1ForFork2_#t~ite23_In2080582026| |P0Thread1of1ForFork2_#t~ite23_Out2080582026|) (= ~x$r_buff1_thd1~0_In2080582026 |P0Thread1of1ForFork2_#t~ite24_Out2080582026|) (not .cse0)) (and (= ~x$r_buff1_thd1~0_In2080582026 |P0Thread1of1ForFork2_#t~ite23_Out2080582026|) (= |P0Thread1of1ForFork2_#t~ite23_Out2080582026| |P0Thread1of1ForFork2_#t~ite24_Out2080582026|) .cse0 (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In2080582026 256)))) (or (and (= (mod ~x$r_buff1_thd1~0_In2080582026 256) 0) .cse1) (= 0 (mod ~x$w_buff0_used~0_In2080582026 256)) (and (= 0 (mod ~x$w_buff1_used~0_In2080582026 256)) .cse1)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In2080582026, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2080582026, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In2080582026, ~weak$$choice2~0=~weak$$choice2~0_In2080582026, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_In2080582026|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2080582026} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In2080582026, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2080582026, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In2080582026, P0Thread1of1ForFork2_#t~ite24=|P0Thread1of1ForFork2_#t~ite24_Out2080582026|, ~weak$$choice2~0=~weak$$choice2~0_In2080582026, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_Out2080582026|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2080582026} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23] because there is no mapped edge [2019-12-27 22:12:04,077 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L745-->L753: Formula: (and (= 0 v_~x$flush_delayed~0_6) (= v_~x$mem_tmp~0_4 v_~x~0_15) (= v_~__unbuffered_cnt~0_9 (+ v_~__unbuffered_cnt~0_10 1)) (not (= 0 (mod v_~x$flush_delayed~0_7 256)))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~x$mem_tmp~0=v_~x$mem_tmp~0_4} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_7|, ~x$flush_delayed~0=v_~x$flush_delayed~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ~x$mem_tmp~0=v_~x$mem_tmp~0_4, ~x~0=v_~x~0_15} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-27 22:12:04,077 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L797-->L797-2: Formula: (let ((.cse2 (= (mod ~x$r_buff1_thd3~0_In-1903731298 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In-1903731298 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In-1903731298 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1903731298 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork1_#t~ite37_Out-1903731298|)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite37_Out-1903731298| ~x$r_buff1_thd3~0_In-1903731298)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1903731298, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1903731298, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1903731298, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1903731298} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out-1903731298|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1903731298, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1903731298, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1903731298, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1903731298} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 22:12:04,078 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L797-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= v_~__unbuffered_cnt~0_14 (+ v_~__unbuffered_cnt~0_15 1)) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd3~0_14 |v_P2Thread1of1ForFork1_#t~ite37_8|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} 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_14, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, 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-27 22:12:04,078 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L820-1-->L826: Formula: (and (= v_~main$tmp_guard0~0_4 1) (= 3 v_~__unbuffered_cnt~0_11)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~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-27 22:12:04,079 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [737] [737] L826-2-->L826-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite42_Out-1526877072| |ULTIMATE.start_main_#t~ite41_Out-1526877072|)) (.cse2 (= (mod ~x$r_buff1_thd0~0_In-1526877072 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In-1526877072 256) 0))) (or (and .cse0 (= ~x$w_buff1~0_In-1526877072 |ULTIMATE.start_main_#t~ite41_Out-1526877072|) (not .cse1) (not .cse2)) (and .cse0 (= |ULTIMATE.start_main_#t~ite41_Out-1526877072| ~x~0_In-1526877072) (or .cse2 .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1526877072, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1526877072, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1526877072, ~x~0=~x~0_In-1526877072} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-1526877072|, ~x$w_buff1~0=~x$w_buff1~0_In-1526877072, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1526877072, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1526877072, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-1526877072|, ~x~0=~x~0_In-1526877072} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 22:12:04,081 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L827-->L827-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In1661161792 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In1661161792 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite43_Out1661161792| ~x$w_buff0_used~0_In1661161792)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite43_Out1661161792| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1661161792, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1661161792} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1661161792, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1661161792|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1661161792} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 22:12:04,082 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L828-->L828-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In-1552290743 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-1552290743 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1552290743 256))) (.cse1 (= (mod ~x$r_buff1_thd0~0_In-1552290743 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite44_Out-1552290743| ~x$w_buff1_used~0_In-1552290743)) (and (= |ULTIMATE.start_main_#t~ite44_Out-1552290743| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1552290743, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1552290743, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1552290743, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1552290743} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1552290743, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1552290743, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1552290743, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1552290743|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1552290743} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 22:12:04,083 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L829-->L829-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In507695809 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd0~0_In507695809 256) 0))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd0~0_In507695809 |ULTIMATE.start_main_#t~ite45_Out507695809|)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite45_Out507695809| 0) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In507695809, ~x$w_buff0_used~0=~x$w_buff0_used~0_In507695809} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In507695809, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out507695809|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In507695809} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 22:12:04,084 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L830-->L830-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In1984531680 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In1984531680 256))) (.cse3 (= (mod ~x$r_buff1_thd0~0_In1984531680 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In1984531680 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite46_Out1984531680|)) (and (or .cse1 .cse0) (= ~x$r_buff1_thd0~0_In1984531680 |ULTIMATE.start_main_#t~ite46_Out1984531680|) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1984531680, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1984531680, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1984531680, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1984531680} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1984531680, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out1984531680|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1984531680, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1984531680, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1984531680} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-27 22:12:04,085 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] L830-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p2_EAX~0_8 1) (= v_~main$tmp_guard1~0_9 0) (= v_~__unbuffered_p0_EBX~0_9 0) (= v_~__unbuffered_p0_EAX~0_9 2) (= (mod v_~main$tmp_guard1~0_9 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_~x$r_buff1_thd0~0_18 |v_ULTIMATE.start_main_#t~ite46_13|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= v_~y~0_13 2)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_9, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_13|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~y~0=v_~y~0_13} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_9, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_12|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~y~0=v_~y~0_13, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_18, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} 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-27 22:12:04,219 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 10:12:04 BasicIcfg [2019-12-27 22:12:04,220 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 22:12:04,223 INFO L168 Benchmark]: Toolchain (without parser) took 137714.86 ms. Allocated memory was 146.3 MB in the beginning and 2.3 GB in the end (delta: 2.2 GB). Free memory was 101.4 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 705.8 MB. Max. memory is 7.1 GB. [2019-12-27 22:12:04,224 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 146.3 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 22:12:04,224 INFO L168 Benchmark]: CACSL2BoogieTranslator took 814.56 ms. Allocated memory was 146.3 MB in the beginning and 202.9 MB in the end (delta: 56.6 MB). Free memory was 101.0 MB in the beginning and 156.7 MB in the end (delta: -55.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. [2019-12-27 22:12:04,229 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.75 ms. Allocated memory is still 202.9 MB. Free memory was 156.7 MB in the beginning and 154.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 22:12:04,230 INFO L168 Benchmark]: Boogie Preprocessor took 59.52 ms. Allocated memory is still 202.9 MB. Free memory was 154.1 MB in the beginning and 151.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 22:12:04,230 INFO L168 Benchmark]: RCFGBuilder took 827.28 ms. Allocated memory is still 202.9 MB. Free memory was 151.5 MB in the beginning and 104.8 MB in the end (delta: 46.7 MB). Peak memory consumption was 46.7 MB. Max. memory is 7.1 GB. [2019-12-27 22:12:04,231 INFO L168 Benchmark]: TraceAbstraction took 135935.72 ms. Allocated memory was 202.9 MB in the beginning and 2.3 GB in the end (delta: 2.1 GB). Free memory was 104.8 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 652.6 MB. Max. memory is 7.1 GB. [2019-12-27 22:12:04,236 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 146.3 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 814.56 ms. Allocated memory was 146.3 MB in the beginning and 202.9 MB in the end (delta: 56.6 MB). Free memory was 101.0 MB in the beginning and 156.7 MB in the end (delta: -55.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 61.75 ms. Allocated memory is still 202.9 MB. Free memory was 156.7 MB in the beginning and 154.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 59.52 ms. Allocated memory is still 202.9 MB. Free memory was 154.1 MB in the beginning and 151.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 827.28 ms. Allocated memory is still 202.9 MB. Free memory was 151.5 MB in the beginning and 104.8 MB in the end (delta: 46.7 MB). Peak memory consumption was 46.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 135935.72 ms. Allocated memory was 202.9 MB in the beginning and 2.3 GB in the end (delta: 2.1 GB). Free memory was 104.8 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 652.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.3s, 163 ProgramPointsBefore, 84 ProgramPointsAfterwards, 194 TransitionsBefore, 93 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 8 FixpointIterations, 32 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 36 ConcurrentYvCompositions, 26 ChoiceCompositions, 6473 VarBasedMoverChecksPositive, 209 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 75395 CheckedPairsTotal, 112 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L816] FCALL, FORK 0 pthread_create(&t1831, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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] [L818] FCALL, FORK 0 pthread_create(&t1832, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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] [L758] 2 x$w_buff1 = x$w_buff0 [L759] 2 x$w_buff0 = 1 [L760] 2 x$w_buff1_used = x$w_buff0_used [L761] 2 x$w_buff0_used = (_Bool)1 [L773] 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_p0_EBX=0, __unbuffered_p2_EAX=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] [L820] FCALL, FORK 0 pthread_create(&t1833, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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] [L787] 3 __unbuffered_p2_EAX = y [L790] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, 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=2] [L793] 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_p0_EBX=0, __unbuffered_p2_EAX=1, 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=2] [L773] 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) [L730] 1 __unbuffered_p0_EAX = y [L733] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L734] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L735] 1 x$flush_delayed = weak$$choice2 [L736] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=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=2] [L774] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L737] 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=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=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=2] [L737] 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) [L775] 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 [L794] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L795] 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 [L796] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L738] 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=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? 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=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L738] 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)) [L739] 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)) [L740] 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)) [L741] EXPR 1 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)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? 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))=0, 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_buff1=0, x$w_buff1_used=0, y=2] [L741] 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)) [L743] 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)) [L744] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=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_buff1=0, x$w_buff1_used=0, y=2] [L826] EXPR 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=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=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=2] [L826] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L827] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L828] 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 [L829] 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, 154 locations, 2 error locations. Result: UNSAFE, OverallTime: 135.5s, OverallIterations: 30, TraceHistogramMax: 1, AutomataDifference: 76.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6003 SDtfs, 16152 SDslu, 28344 SDs, 0 SdLazy, 40276 SolverSat, 1509 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 40.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1176 GetRequests, 200 SyntacticMatches, 170 SemanticMatches, 806 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20688 ImplicationChecksByTransitivity, 26.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=89162occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 23.9s AutomataMinimizationTime, 29 MinimizatonAttempts, 288732 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 1342 NumberOfCodeBlocks, 1342 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 1257 ConstructedInterpolants, 0 QuantifiedInterpolants, 280162 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 29 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...