/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi000_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 17:39:28,149 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 17:39:28,152 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 17:39:28,164 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 17:39:28,164 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 17:39:28,165 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 17:39:28,167 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 17:39:28,169 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 17:39:28,170 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 17:39:28,171 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 17:39:28,172 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 17:39:28,174 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 17:39:28,174 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 17:39:28,175 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 17:39:28,176 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 17:39:28,177 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 17:39:28,178 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 17:39:28,179 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 17:39:28,181 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 17:39:28,183 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 17:39:28,184 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 17:39:28,186 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 17:39:28,187 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 17:39:28,188 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 17:39:28,190 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 17:39:28,190 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 17:39:28,191 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 17:39:28,192 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 17:39:28,192 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 17:39:28,193 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 17:39:28,193 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 17:39:28,194 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 17:39:28,195 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 17:39:28,196 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 17:39:28,197 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 17:39:28,197 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 17:39:28,198 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 17:39:28,198 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 17:39:28,198 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 17:39:28,199 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 17:39:28,200 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 17:39:28,200 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf [2019-12-27 17:39:28,215 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 17:39:28,215 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 17:39:28,217 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 17:39:28,217 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 17:39:28,217 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 17:39:28,217 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 17:39:28,218 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 17:39:28,218 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 17:39:28,218 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 17:39:28,218 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 17:39:28,218 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 17:39:28,219 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 17:39:28,219 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 17:39:28,219 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 17:39:28,219 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 17:39:28,219 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 17:39:28,220 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 17:39:28,220 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 17:39:28,220 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 17:39:28,220 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 17:39:28,220 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 17:39:28,221 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 17:39:28,221 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 17:39:28,221 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 17:39:28,221 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 17:39:28,221 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 17:39:28,222 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 17:39:28,222 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 17:39:28,222 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 17:39:28,222 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 17:39:28,222 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 17:39:28,505 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 17:39:28,521 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 17:39:28,525 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 17:39:28,526 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 17:39:28,527 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 17:39:28,529 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi000_power.opt.i [2019-12-27 17:39:28,594 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1098ea329/6a34b68f185b4f09879ac36726a5ea85/FLAG5f7b37449 [2019-12-27 17:39:29,130 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 17:39:29,131 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi000_power.opt.i [2019-12-27 17:39:29,146 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1098ea329/6a34b68f185b4f09879ac36726a5ea85/FLAG5f7b37449 [2019-12-27 17:39:29,399 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1098ea329/6a34b68f185b4f09879ac36726a5ea85 [2019-12-27 17:39:29,412 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 17:39:29,415 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 17:39:29,417 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 17:39:29,418 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 17:39:29,421 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 17:39:29,422 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:39:29" (1/1) ... [2019-12-27 17:39:29,426 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2651ab3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:39:29, skipping insertion in model container [2019-12-27 17:39:29,426 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:39:29" (1/1) ... [2019-12-27 17:39:29,436 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 17:39:29,503 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 17:39:30,026 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 17:39:30,039 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 17:39:30,142 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 17:39:30,221 INFO L208 MainTranslator]: Completed translation [2019-12-27 17:39:30,222 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:39:30 WrapperNode [2019-12-27 17:39:30,222 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 17:39:30,222 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 17:39:30,223 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 17:39:30,223 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 17:39:30,232 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:39:30" (1/1) ... [2019-12-27 17:39:30,254 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:39:30" (1/1) ... [2019-12-27 17:39:30,307 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 17:39:30,308 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 17:39:30,308 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 17:39:30,308 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 17:39:30,317 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:39:30" (1/1) ... [2019-12-27 17:39:30,317 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:39:30" (1/1) ... [2019-12-27 17:39:30,322 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:39:30" (1/1) ... [2019-12-27 17:39:30,323 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:39:30" (1/1) ... [2019-12-27 17:39:30,332 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:39:30" (1/1) ... [2019-12-27 17:39:30,337 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:39:30" (1/1) ... [2019-12-27 17:39:30,340 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:39:30" (1/1) ... [2019-12-27 17:39:30,345 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 17:39:30,346 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 17:39:30,346 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 17:39:30,346 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 17:39:30,347 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:39:30" (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 17:39:30,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 17:39:30,410 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 17:39:30,410 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 17:39:30,410 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 17:39:30,410 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 17:39:30,410 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 17:39:30,411 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 17:39:30,411 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 17:39:30,411 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 17:39:30,411 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 17:39:30,411 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 17:39:30,413 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 17:39:31,138 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 17:39:31,138 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 17:39:31,139 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:39:31 BoogieIcfgContainer [2019-12-27 17:39:31,140 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 17:39:31,141 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 17:39:31,141 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 17:39:31,146 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 17:39:31,146 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 05:39:29" (1/3) ... [2019-12-27 17:39:31,148 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1865d4f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:39:31, skipping insertion in model container [2019-12-27 17:39:31,148 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:39:30" (2/3) ... [2019-12-27 17:39:31,149 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1865d4f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:39:31, skipping insertion in model container [2019-12-27 17:39:31,149 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:39:31" (3/3) ... [2019-12-27 17:39:31,153 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi000_power.opt.i [2019-12-27 17:39:31,165 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 17:39:31,165 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 17:39:31,177 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 17:39:31,179 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 17:39:31,229 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:31,229 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:31,229 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:31,230 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:31,230 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:31,230 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:31,230 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:31,231 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:31,231 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:31,231 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:31,231 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:31,231 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:31,232 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:31,232 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:31,232 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:31,232 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:31,232 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:31,232 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:31,233 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:31,233 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:31,233 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:31,234 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:31,234 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:31,234 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:31,235 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:31,235 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:31,235 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:31,235 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:31,236 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:31,236 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:31,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:31,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:31,237 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:31,238 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:31,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:31,238 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:31,238 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:31,239 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:31,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:31,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:31,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:31,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:31,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:31,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:31,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:31,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:31,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:31,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:31,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:31,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:31,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:31,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:31,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:31,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:31,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:31,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:31,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:31,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:31,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:31,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:31,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:31,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:31,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:31,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:31,250 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:31,250 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:31,250 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:31,250 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:31,251 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:31,251 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:31,251 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:31,252 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:31,252 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:31,252 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:31,255 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:31,255 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:31,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:31,256 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:31,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:31,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:31,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:31,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:31,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:31,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:31,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:31,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:39:31,274 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 17:39:31,295 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 17:39:31,296 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 17:39:31,296 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 17:39:31,296 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 17:39:31,296 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 17:39:31,296 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 17:39:31,297 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 17:39:31,297 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 17:39:31,315 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-12-27 17:39:31,317 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-27 17:39:31,445 INFO L132 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-27 17:39:31,445 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 17:39:31,461 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 254 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 17:39:31,477 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-27 17:39:31,563 INFO L132 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-27 17:39:31,564 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 17:39:31,572 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 254 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 17:39:31,584 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10378 [2019-12-27 17:39:31,586 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 17:39:35,710 WARN L192 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-27 17:39:35,816 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-27 17:39:35,839 INFO L206 etLargeBlockEncoding]: Checked pairs total: 50487 [2019-12-27 17:39:35,840 INFO L214 etLargeBlockEncoding]: Total number of compositions: 98 [2019-12-27 17:39:35,843 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 81 places, 94 transitions [2019-12-27 17:39:36,336 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 9480 states. [2019-12-27 17:39:36,339 INFO L276 IsEmpty]: Start isEmpty. Operand 9480 states. [2019-12-27 17:39:36,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 17:39:36,345 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:39:36,346 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 17:39:36,346 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:39:36,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:39:36,353 INFO L82 PathProgramCache]: Analyzing trace with hash 692929394, now seen corresponding path program 1 times [2019-12-27 17:39:36,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:39:36,363 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414397587] [2019-12-27 17:39:36,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:39:36,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:39:36,614 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 17:39:36,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414397587] [2019-12-27 17:39:36,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:39:36,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 17:39:36,618 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1083674338] [2019-12-27 17:39:36,620 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:39:36,625 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:39:36,641 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 17:39:36,641 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:39:36,645 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:39:36,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:39:36,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:39:36,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:39:36,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:39:36,663 INFO L87 Difference]: Start difference. First operand 9480 states. Second operand 3 states. [2019-12-27 17:39:36,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:39:36,919 INFO L93 Difference]: Finished difference Result 9416 states and 31128 transitions. [2019-12-27 17:39:36,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:39:36,921 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 17:39:36,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:39:37,063 INFO L225 Difference]: With dead ends: 9416 [2019-12-27 17:39:37,063 INFO L226 Difference]: Without dead ends: 9234 [2019-12-27 17:39:37,064 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 17:39:37,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9234 states. [2019-12-27 17:39:37,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9234 to 9234. [2019-12-27 17:39:37,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9234 states. [2019-12-27 17:39:37,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9234 states to 9234 states and 30568 transitions. [2019-12-27 17:39:37,624 INFO L78 Accepts]: Start accepts. Automaton has 9234 states and 30568 transitions. Word has length 5 [2019-12-27 17:39:37,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:39:37,624 INFO L462 AbstractCegarLoop]: Abstraction has 9234 states and 30568 transitions. [2019-12-27 17:39:37,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:39:37,624 INFO L276 IsEmpty]: Start isEmpty. Operand 9234 states and 30568 transitions. [2019-12-27 17:39:37,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 17:39:37,627 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:39:37,627 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:39:37,628 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:39:37,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:39:37,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1820083367, now seen corresponding path program 1 times [2019-12-27 17:39:37,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:39:37,629 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759445405] [2019-12-27 17:39:37,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:39:37,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:39:37,753 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 17:39:37,755 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759445405] [2019-12-27 17:39:37,755 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:39:37,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:39:37,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [551599997] [2019-12-27 17:39:37,756 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:39:37,758 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:39:37,767 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 35 transitions. [2019-12-27 17:39:37,768 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:39:37,769 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:39:37,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 17:39:37,770 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:39:37,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 17:39:37,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:39:37,771 INFO L87 Difference]: Start difference. First operand 9234 states and 30568 transitions. Second operand 4 states. [2019-12-27 17:39:38,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:39:38,197 INFO L93 Difference]: Finished difference Result 14362 states and 45554 transitions. [2019-12-27 17:39:38,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:39:38,197 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 17:39:38,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:39:38,296 INFO L225 Difference]: With dead ends: 14362 [2019-12-27 17:39:38,296 INFO L226 Difference]: Without dead ends: 14355 [2019-12-27 17:39:38,297 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 17:39:38,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14355 states. [2019-12-27 17:39:39,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14355 to 13038. [2019-12-27 17:39:39,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13038 states. [2019-12-27 17:39:39,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13038 states to 13038 states and 41962 transitions. [2019-12-27 17:39:39,412 INFO L78 Accepts]: Start accepts. Automaton has 13038 states and 41962 transitions. Word has length 11 [2019-12-27 17:39:39,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:39:39,412 INFO L462 AbstractCegarLoop]: Abstraction has 13038 states and 41962 transitions. [2019-12-27 17:39:39,412 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 17:39:39,412 INFO L276 IsEmpty]: Start isEmpty. Operand 13038 states and 41962 transitions. [2019-12-27 17:39:39,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 17:39:39,420 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:39:39,420 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:39:39,420 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:39:39,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:39:39,421 INFO L82 PathProgramCache]: Analyzing trace with hash 417951775, now seen corresponding path program 1 times [2019-12-27 17:39:39,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:39:39,422 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339232217] [2019-12-27 17:39:39,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:39:39,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:39:39,488 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 17:39:39,488 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339232217] [2019-12-27 17:39:39,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:39:39,489 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:39:39,489 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1511745839] [2019-12-27 17:39:39,489 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:39:39,490 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:39:39,492 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 17:39:39,492 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:39:39,493 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:39:39,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:39:39,493 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:39:39,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:39:39,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:39:39,494 INFO L87 Difference]: Start difference. First operand 13038 states and 41962 transitions. Second operand 3 states. [2019-12-27 17:39:39,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:39:39,509 INFO L93 Difference]: Finished difference Result 1778 states and 4038 transitions. [2019-12-27 17:39:39,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:39:39,510 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-27 17:39:39,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:39:39,515 INFO L225 Difference]: With dead ends: 1778 [2019-12-27 17:39:39,515 INFO L226 Difference]: Without dead ends: 1778 [2019-12-27 17:39:39,515 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 17:39:39,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1778 states. [2019-12-27 17:39:39,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1778 to 1778. [2019-12-27 17:39:39,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1778 states. [2019-12-27 17:39:39,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1778 states to 1778 states and 4038 transitions. [2019-12-27 17:39:39,554 INFO L78 Accepts]: Start accepts. Automaton has 1778 states and 4038 transitions. Word has length 11 [2019-12-27 17:39:39,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:39:39,554 INFO L462 AbstractCegarLoop]: Abstraction has 1778 states and 4038 transitions. [2019-12-27 17:39:39,555 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:39:39,555 INFO L276 IsEmpty]: Start isEmpty. Operand 1778 states and 4038 transitions. [2019-12-27 17:39:39,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 17:39:39,556 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:39:39,556 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] [2019-12-27 17:39:39,557 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:39:39,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:39:39,557 INFO L82 PathProgramCache]: Analyzing trace with hash -1954901459, now seen corresponding path program 1 times [2019-12-27 17:39:39,557 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:39:39,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690451317] [2019-12-27 17:39:39,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:39:39,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:39:39,624 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 17:39:39,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690451317] [2019-12-27 17:39:39,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:39:39,625 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:39:39,625 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1268915342] [2019-12-27 17:39:39,627 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:39:39,631 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:39:39,641 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 48 states and 71 transitions. [2019-12-27 17:39:39,641 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:39:39,687 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:39:39,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:39:39,687 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:39:39,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:39:39,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:39:39,688 INFO L87 Difference]: Start difference. First operand 1778 states and 4038 transitions. Second operand 5 states. [2019-12-27 17:39:39,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:39:39,708 INFO L93 Difference]: Finished difference Result 371 states and 689 transitions. [2019-12-27 17:39:39,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 17:39:39,708 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-12-27 17:39:39,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:39:39,710 INFO L225 Difference]: With dead ends: 371 [2019-12-27 17:39:39,710 INFO L226 Difference]: Without dead ends: 371 [2019-12-27 17:39:39,710 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 17:39:39,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2019-12-27 17:39:39,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 336. [2019-12-27 17:39:39,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-12-27 17:39:39,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 624 transitions. [2019-12-27 17:39:39,717 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 624 transitions. Word has length 23 [2019-12-27 17:39:39,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:39:39,718 INFO L462 AbstractCegarLoop]: Abstraction has 336 states and 624 transitions. [2019-12-27 17:39:39,718 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:39:39,718 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 624 transitions. [2019-12-27 17:39:39,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 17:39:39,720 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:39:39,720 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] [2019-12-27 17:39:39,720 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:39:39,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:39:39,721 INFO L82 PathProgramCache]: Analyzing trace with hash 798988436, now seen corresponding path program 1 times [2019-12-27 17:39:39,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:39:39,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322777994] [2019-12-27 17:39:39,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:39:39,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:39:39,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:39:39,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322777994] [2019-12-27 17:39:39,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:39:39,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:39:39,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [223080105] [2019-12-27 17:39:39,859 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:39:39,878 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:39:39,910 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 76 states and 98 transitions. [2019-12-27 17:39:39,911 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:39:39,912 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:39:39,913 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:39:39,913 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:39:39,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:39:39,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:39:39,913 INFO L87 Difference]: Start difference. First operand 336 states and 624 transitions. Second operand 3 states. [2019-12-27 17:39:39,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:39:39,964 INFO L93 Difference]: Finished difference Result 345 states and 638 transitions. [2019-12-27 17:39:39,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:39:39,965 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 17:39:39,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:39:39,966 INFO L225 Difference]: With dead ends: 345 [2019-12-27 17:39:39,966 INFO L226 Difference]: Without dead ends: 345 [2019-12-27 17:39:39,966 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:39:39,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2019-12-27 17:39:39,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 341. [2019-12-27 17:39:39,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2019-12-27 17:39:39,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 634 transitions. [2019-12-27 17:39:39,973 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 634 transitions. Word has length 52 [2019-12-27 17:39:39,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:39:39,974 INFO L462 AbstractCegarLoop]: Abstraction has 341 states and 634 transitions. [2019-12-27 17:39:39,974 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:39:39,974 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 634 transitions. [2019-12-27 17:39:39,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 17:39:39,976 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:39:39,976 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] [2019-12-27 17:39:39,976 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:39:39,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:39:39,976 INFO L82 PathProgramCache]: Analyzing trace with hash 112676449, now seen corresponding path program 1 times [2019-12-27 17:39:39,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:39:39,977 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439954884] [2019-12-27 17:39:39,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:39:39,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:39:40,033 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 17:39:40,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439954884] [2019-12-27 17:39:40,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:39:40,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:39:40,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [646338757] [2019-12-27 17:39:40,035 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:39:40,048 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:39:40,169 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 76 states and 98 transitions. [2019-12-27 17:39:40,170 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:39:40,170 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:39:40,171 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:39:40,171 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:39:40,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:39:40,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:39:40,172 INFO L87 Difference]: Start difference. First operand 341 states and 634 transitions. Second operand 3 states. [2019-12-27 17:39:40,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:39:40,219 INFO L93 Difference]: Finished difference Result 345 states and 628 transitions. [2019-12-27 17:39:40,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:39:40,220 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 17:39:40,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:39:40,221 INFO L225 Difference]: With dead ends: 345 [2019-12-27 17:39:40,221 INFO L226 Difference]: Without dead ends: 345 [2019-12-27 17:39:40,222 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:39:40,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2019-12-27 17:39:40,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 341. [2019-12-27 17:39:40,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2019-12-27 17:39:40,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 624 transitions. [2019-12-27 17:39:40,229 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 624 transitions. Word has length 52 [2019-12-27 17:39:40,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:39:40,230 INFO L462 AbstractCegarLoop]: Abstraction has 341 states and 624 transitions. [2019-12-27 17:39:40,230 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:39:40,230 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 624 transitions. [2019-12-27 17:39:40,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 17:39:40,231 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:39:40,232 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] [2019-12-27 17:39:40,232 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:39:40,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:39:40,232 INFO L82 PathProgramCache]: Analyzing trace with hash 107384222, now seen corresponding path program 1 times [2019-12-27 17:39:40,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:39:40,233 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606833116] [2019-12-27 17:39:40,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:39:40,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:39:40,314 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 17:39:40,314 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606833116] [2019-12-27 17:39:40,315 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:39:40,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:39:40,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [75266254] [2019-12-27 17:39:40,315 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:39:40,331 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:39:40,365 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 76 states and 98 transitions. [2019-12-27 17:39:40,365 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:39:40,366 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:39:40,366 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:39:40,366 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:39:40,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:39:40,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:39:40,367 INFO L87 Difference]: Start difference. First operand 341 states and 624 transitions. Second operand 3 states. [2019-12-27 17:39:40,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:39:40,382 INFO L93 Difference]: Finished difference Result 328 states and 585 transitions. [2019-12-27 17:39:40,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:39:40,382 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 17:39:40,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:39:40,383 INFO L225 Difference]: With dead ends: 328 [2019-12-27 17:39:40,384 INFO L226 Difference]: Without dead ends: 328 [2019-12-27 17:39:40,384 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:39:40,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2019-12-27 17:39:40,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2019-12-27 17:39:40,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-12-27 17:39:40,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 585 transitions. [2019-12-27 17:39:40,391 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 585 transitions. Word has length 52 [2019-12-27 17:39:40,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:39:40,391 INFO L462 AbstractCegarLoop]: Abstraction has 328 states and 585 transitions. [2019-12-27 17:39:40,391 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:39:40,391 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 585 transitions. [2019-12-27 17:39:40,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 17:39:40,392 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:39:40,393 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] [2019-12-27 17:39:40,393 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:39:40,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:39:40,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1649755206, now seen corresponding path program 1 times [2019-12-27 17:39:40,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:39:40,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44662484] [2019-12-27 17:39:40,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:39:40,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:39:40,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 17:39:40,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44662484] [2019-12-27 17:39:40,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:39:40,489 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 17:39:40,490 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1766201497] [2019-12-27 17:39:40,490 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:39:40,504 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:39:40,536 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 84 states and 113 transitions. [2019-12-27 17:39:40,536 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:39:40,537 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:39:40,537 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:39:40,537 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:39:40,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:39:40,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:39:40,538 INFO L87 Difference]: Start difference. First operand 328 states and 585 transitions. Second operand 5 states. [2019-12-27 17:39:40,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:39:40,740 INFO L93 Difference]: Finished difference Result 459 states and 819 transitions. [2019-12-27 17:39:40,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 17:39:40,740 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-12-27 17:39:40,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:39:40,742 INFO L225 Difference]: With dead ends: 459 [2019-12-27 17:39:40,743 INFO L226 Difference]: Without dead ends: 459 [2019-12-27 17:39:40,743 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:39:40,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2019-12-27 17:39:40,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 363. [2019-12-27 17:39:40,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2019-12-27 17:39:40,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 652 transitions. [2019-12-27 17:39:40,751 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 652 transitions. Word has length 53 [2019-12-27 17:39:40,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:39:40,751 INFO L462 AbstractCegarLoop]: Abstraction has 363 states and 652 transitions. [2019-12-27 17:39:40,751 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:39:40,752 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 652 transitions. [2019-12-27 17:39:40,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 17:39:40,753 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:39:40,753 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] [2019-12-27 17:39:40,753 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:39:40,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:39:40,754 INFO L82 PathProgramCache]: Analyzing trace with hash 1934699814, now seen corresponding path program 2 times [2019-12-27 17:39:40,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:39:40,755 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605629311] [2019-12-27 17:39:40,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:39:40,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:39:40,922 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 17:39:40,924 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605629311] [2019-12-27 17:39:40,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:39:40,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 17:39:40,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1196304463] [2019-12-27 17:39:40,925 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:39:40,940 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:39:40,976 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 82 states and 109 transitions. [2019-12-27 17:39:40,976 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:39:41,003 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 17:39:41,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 17:39:41,004 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:39:41,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 17:39:41,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:39:41,004 INFO L87 Difference]: Start difference. First operand 363 states and 652 transitions. Second operand 7 states. [2019-12-27 17:39:41,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:39:41,367 INFO L93 Difference]: Finished difference Result 502 states and 893 transitions. [2019-12-27 17:39:41,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 17:39:41,368 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-27 17:39:41,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:39:41,370 INFO L225 Difference]: With dead ends: 502 [2019-12-27 17:39:41,371 INFO L226 Difference]: Without dead ends: 502 [2019-12-27 17:39:41,373 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-12-27 17:39:41,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2019-12-27 17:39:41,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 377. [2019-12-27 17:39:41,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2019-12-27 17:39:41,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 678 transitions. [2019-12-27 17:39:41,385 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 678 transitions. Word has length 53 [2019-12-27 17:39:41,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:39:41,386 INFO L462 AbstractCegarLoop]: Abstraction has 377 states and 678 transitions. [2019-12-27 17:39:41,386 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 17:39:41,386 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 678 transitions. [2019-12-27 17:39:41,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 17:39:41,392 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:39:41,392 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] [2019-12-27 17:39:41,392 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:39:41,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:39:41,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1416640772, now seen corresponding path program 3 times [2019-12-27 17:39:41,393 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:39:41,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377369697] [2019-12-27 17:39:41,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:39:41,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:39:41,543 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 17:39:41,543 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377369697] [2019-12-27 17:39:41,543 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:39:41,543 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 17:39:41,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1500894369] [2019-12-27 17:39:41,545 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:39:41,558 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:39:41,596 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 87 states and 119 transitions. [2019-12-27 17:39:41,597 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:39:41,602 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:39:41,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:39:41,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:39:41,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:39:41,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:39:41,603 INFO L87 Difference]: Start difference. First operand 377 states and 678 transitions. Second operand 5 states. [2019-12-27 17:39:41,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:39:41,661 INFO L93 Difference]: Finished difference Result 642 states and 1143 transitions. [2019-12-27 17:39:41,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:39:41,661 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-12-27 17:39:41,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:39:41,662 INFO L225 Difference]: With dead ends: 642 [2019-12-27 17:39:41,663 INFO L226 Difference]: Without dead ends: 286 [2019-12-27 17:39:41,664 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:39:41,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2019-12-27 17:39:41,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 286. [2019-12-27 17:39:41,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2019-12-27 17:39:41,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 500 transitions. [2019-12-27 17:39:41,669 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 500 transitions. Word has length 53 [2019-12-27 17:39:41,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:39:41,670 INFO L462 AbstractCegarLoop]: Abstraction has 286 states and 500 transitions. [2019-12-27 17:39:41,670 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:39:41,670 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 500 transitions. [2019-12-27 17:39:41,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 17:39:41,671 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:39:41,671 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] [2019-12-27 17:39:41,671 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:39:41,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:39:41,671 INFO L82 PathProgramCache]: Analyzing trace with hash -167824730, now seen corresponding path program 4 times [2019-12-27 17:39:41,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:39:41,673 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013094777] [2019-12-27 17:39:41,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:39:41,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:39:41,997 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 17:39:41,998 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013094777] [2019-12-27 17:39:41,998 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:39:41,998 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 17:39:41,998 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1261490349] [2019-12-27 17:39:41,998 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:39:42,012 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:39:42,046 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 87 states and 115 transitions. [2019-12-27 17:39:42,046 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:39:42,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:39:42,208 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 17:39:42,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 17:39:42,209 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:39:42,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 17:39:42,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-12-27 17:39:42,209 INFO L87 Difference]: Start difference. First operand 286 states and 500 transitions. Second operand 13 states. [2019-12-27 17:39:43,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:39:43,016 INFO L93 Difference]: Finished difference Result 376 states and 620 transitions. [2019-12-27 17:39:43,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 17:39:43,017 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 53 [2019-12-27 17:39:43,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:39:43,021 INFO L225 Difference]: With dead ends: 376 [2019-12-27 17:39:43,021 INFO L226 Difference]: Without dead ends: 376 [2019-12-27 17:39:43,022 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 5 SyntacticMatches, 5 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-27 17:39:43,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2019-12-27 17:39:43,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 227. [2019-12-27 17:39:43,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-12-27 17:39:43,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 374 transitions. [2019-12-27 17:39:43,029 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 374 transitions. Word has length 53 [2019-12-27 17:39:43,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:39:43,029 INFO L462 AbstractCegarLoop]: Abstraction has 227 states and 374 transitions. [2019-12-27 17:39:43,029 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 17:39:43,029 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 374 transitions. [2019-12-27 17:39:43,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 17:39:43,030 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:39:43,030 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] [2019-12-27 17:39:43,031 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:39:43,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:39:43,031 INFO L82 PathProgramCache]: Analyzing trace with hash 175082296, now seen corresponding path program 5 times [2019-12-27 17:39:43,032 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:39:43,032 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791460394] [2019-12-27 17:39:43,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:39:43,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:39:43,086 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 17:39:43,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791460394] [2019-12-27 17:39:43,086 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:39:43,086 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:39:43,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1357178673] [2019-12-27 17:39:43,087 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:39:43,101 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:39:43,135 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 85 states and 105 transitions. [2019-12-27 17:39:43,136 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:39:43,136 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:39:43,136 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:39:43,137 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:39:43,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:39:43,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:39:43,137 INFO L87 Difference]: Start difference. First operand 227 states and 374 transitions. Second operand 3 states. [2019-12-27 17:39:43,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:39:43,184 INFO L93 Difference]: Finished difference Result 226 states and 372 transitions. [2019-12-27 17:39:43,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:39:43,185 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-27 17:39:43,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:39:43,185 INFO L225 Difference]: With dead ends: 226 [2019-12-27 17:39:43,186 INFO L226 Difference]: Without dead ends: 226 [2019-12-27 17:39:43,186 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 17:39:43,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-12-27 17:39:43,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 183. [2019-12-27 17:39:43,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-12-27 17:39:43,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 299 transitions. [2019-12-27 17:39:43,190 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 299 transitions. Word has length 53 [2019-12-27 17:39:43,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:39:43,190 INFO L462 AbstractCegarLoop]: Abstraction has 183 states and 299 transitions. [2019-12-27 17:39:43,191 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:39:43,191 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 299 transitions. [2019-12-27 17:39:43,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 17:39:43,191 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:39:43,191 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 17:39:43,192 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:39:43,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:39:43,192 INFO L82 PathProgramCache]: Analyzing trace with hash -1455781027, now seen corresponding path program 1 times [2019-12-27 17:39:43,193 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:39:43,193 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126527470] [2019-12-27 17:39:43,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:39:43,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 17:39:43,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 17:39:43,340 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 17:39:43,340 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 17:39:43,345 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] ULTIMATE.startENTRY-->L787: Formula: (let ((.cse0 (store |v_#valid_48| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= 0 v_~x~0_169) (= 0 v_~x$read_delayed_var~0.offset_6) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1587~0.base_19| 4)) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1587~0.base_19|)) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1587~0.base_19| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1587~0.base_19|) |v_ULTIMATE.start_main_~#t1587~0.offset_14| 0)) |v_#memory_int_17|) (= |v_#NULL.offset_7| 0) (= v_~x$r_buff1_thd2~0_98 0) (= 0 v_~__unbuffered_cnt~0_67) (= v_~main$tmp_guard1~0_21 0) (= 0 v_~x$w_buff1_used~0_304) (= v_~x$r_buff0_thd0~0_295 0) (= 0 v_~x$r_buff0_thd2~0_162) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t1587~0.base_19|) (< 0 |v_#StackHeapBarrier_15|) (= 0 v_~x$read_delayed~0_6) (= v_~y~0_104 0) (= 0 |v_ULTIMATE.start_main_~#t1587~0.offset_14|) (= v_~__unbuffered_p1_EBX~0_62 0) (= v_~x$mem_tmp~0_16 0) (= v_~x$flush_delayed~0_31 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1587~0.base_19| 1) |v_#valid_46|) (= 0 v_~weak$$choice2~0_83) (= 0 v_~weak$$choice0~0_11) (= 0 v_~__unbuffered_p1_EAX~0_62) (= 0 |v_#NULL.base_7|) (= 0 v_~x$w_buff1~0_172) (= v_~main$tmp_guard0~0_26 0) (= v_~x$r_buff1_thd1~0_135 0) (= v_~x$r_buff0_thd1~0_120 0) (= 0 v_~x$w_buff0~0_199) (= v_~x$r_buff1_thd0~0_177 0) (= 0 v_~x$w_buff0_used~0_556))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_199, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_30|, ULTIMATE.start_main_~#t1587~0.offset=|v_ULTIMATE.start_main_~#t1587~0.offset_14|, ~x$flush_delayed~0=v_~x$flush_delayed~0_31, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_25|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_135, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_29|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_32|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_25|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_30|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_62, #length=|v_#length_17|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_295, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_31|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_30|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_15|, ~x$w_buff1~0=v_~x$w_buff1~0_172, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_23|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_304, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_98, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_34|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_32|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_26|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, ~weak$$choice0~0=v_~weak$$choice0~0_11, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_36|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67, ~x~0=v_~x~0_169, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_120, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_19|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_27|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_32|, ~x$mem_tmp~0=v_~x$mem_tmp~0_16, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_37|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_30|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_28|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_34|, ULTIMATE.start_main_~#t1588~0.base=|v_ULTIMATE.start_main_~#t1588~0.base_17|, ~y~0=v_~y~0_104, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_62, ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_37|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_15|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_23|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_32|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_26|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_177, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_162, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_23|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_28|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_556, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_28|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t1588~0.offset=|v_ULTIMATE.start_main_~#t1588~0.offset_14|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_23|, ULTIMATE.start_main_~#t1587~0.base=|v_ULTIMATE.start_main_~#t1587~0.base_19|, ~weak$$choice2~0=v_~weak$$choice2~0_83, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_~#t1587~0.offset, ~x$flush_delayed~0, #NULL.offset, ULTIMATE.start_main_#t~ite26, ~x$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~__unbuffered_p1_EAX~0, #length, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~nondet15, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_~#t1588~0.base, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t1588~0.offset, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_~#t1587~0.base, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 17:39:43,346 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [684] [684] L787-1-->L789: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t1588~0.base_10|)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1588~0.base_10| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1588~0.base_10|) |v_ULTIMATE.start_main_~#t1588~0.offset_9| 1))) (= |v_ULTIMATE.start_main_~#t1588~0.offset_9| 0) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t1588~0.base_10| 4)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1588~0.base_10|) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1588~0.base_10| 1)) (= (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1588~0.base_10|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t1588~0.offset=|v_ULTIMATE.start_main_~#t1588~0.offset_9|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_3|, ULTIMATE.start_main_~#t1588~0.base=|v_ULTIMATE.start_main_~#t1588~0.base_10|, #length=|v_#length_9|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t1588~0.offset, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_~#t1588~0.base, #length] because there is no mapped edge [2019-12-27 17:39:43,347 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L4-->L764: Formula: (and (= ~y~0_Out1702203544 1) (= ~x$r_buff1_thd2~0_Out1702203544 ~x$r_buff0_thd2~0_In1702203544) (= ~x$r_buff1_thd0~0_Out1702203544 ~x$r_buff0_thd0~0_In1702203544) (= 1 ~x$r_buff0_thd2~0_Out1702203544) (= ~__unbuffered_p1_EAX~0_Out1702203544 ~y~0_Out1702203544) (not (= 0 P1Thread1of1ForFork1___VERIFIER_assert_~expression_In1702203544)) (= ~y~0_Out1702203544 ~__unbuffered_p1_EBX~0_Out1702203544) (= ~x$r_buff0_thd1~0_In1702203544 ~x$r_buff1_thd1~0_Out1702203544)) InVars {P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_In1702203544, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1702203544, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1702203544, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1702203544} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_In1702203544, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1702203544, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1702203544, ~__unbuffered_p1_EBX~0=~__unbuffered_p1_EBX~0_Out1702203544, ~__unbuffered_p1_EAX~0=~__unbuffered_p1_EAX~0_Out1702203544, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_Out1702203544, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_Out1702203544, ~y~0=~y~0_Out1702203544, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out1702203544, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out1702203544} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~0, ~__unbuffered_p1_EAX~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 17:39:43,350 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L730-2-->L730-4: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd1~0_In-170750713 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In-170750713 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite3_Out-170750713| ~x$w_buff1~0_In-170750713) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~x~0_In-170750713 |P0Thread1of1ForFork0_#t~ite3_Out-170750713|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-170750713, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-170750713, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-170750713, ~x~0=~x~0_In-170750713} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out-170750713|, ~x$w_buff1~0=~x$w_buff1~0_In-170750713, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-170750713, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-170750713, ~x~0=~x~0_In-170750713} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3] because there is no mapped edge [2019-12-27 17:39:43,350 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [587] [587] L730-4-->L731: Formula: (= v_~x~0_20 |v_P0Thread1of1ForFork0_#t~ite3_16|) InVars {P0Thread1of1ForFork0_#t~ite3=|v_P0Thread1of1ForFork0_#t~ite3_16|} OutVars{P0Thread1of1ForFork0_#t~ite3=|v_P0Thread1of1ForFork0_#t~ite3_15|, P0Thread1of1ForFork0_#t~ite4=|v_P0Thread1of1ForFork0_#t~ite4_7|, ~x~0=v_~x~0_20} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4, ~x~0] because there is no mapped edge [2019-12-27 17:39:43,351 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L731-->L731-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In96281875 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In96281875 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out96281875| ~x$w_buff0_used~0_In96281875) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out96281875|) (not .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In96281875, ~x$w_buff0_used~0=~x$w_buff0_used~0_In96281875} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out96281875|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In96281875, ~x$w_buff0_used~0=~x$w_buff0_used~0_In96281875} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 17:39:43,351 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L732-->L732-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1218845148 256))) (.cse0 (= (mod ~x$r_buff1_thd1~0_In-1218845148 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In-1218845148 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd1~0_In-1218845148 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite6_Out-1218845148| ~x$w_buff1_used~0_In-1218845148) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P0Thread1of1ForFork0_#t~ite6_Out-1218845148| 0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1218845148, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1218845148, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1218845148, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1218845148} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1218845148|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1218845148, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1218845148, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1218845148, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1218845148} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 17:39:43,353 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L733-->L733-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1110526345 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-1110526345 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite7_Out-1110526345| ~x$r_buff0_thd1~0_In-1110526345)) (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork0_#t~ite7_Out-1110526345| 0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1110526345, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1110526345} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1110526345, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1110526345|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1110526345} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-27 17:39:43,354 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L765-->L765-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In611823373 256))) (.cse1 (= (mod ~x$r_buff0_thd2~0_In611823373 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite11_Out611823373|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In611823373 |P1Thread1of1ForFork1_#t~ite11_Out611823373|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In611823373, ~x$w_buff0_used~0=~x$w_buff0_used~0_In611823373} OutVars{P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out611823373|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In611823373, ~x$w_buff0_used~0=~x$w_buff0_used~0_In611823373} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 17:39:43,354 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [650] [650] L766-->L766-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In-601415535 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-601415535 256))) (.cse3 (= 0 (mod ~x$r_buff1_thd2~0_In-601415535 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In-601415535 256) 0))) (or (and (= ~x$w_buff1_used~0_In-601415535 |P1Thread1of1ForFork1_#t~ite12_Out-601415535|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite12_Out-601415535|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-601415535, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-601415535, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-601415535, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-601415535} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-601415535, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-601415535, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-601415535|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-601415535, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-601415535} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 17:39:43,355 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [644] [644] L767-->L768: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-608898024 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-608898024 256)))) (or (and (= ~x$r_buff0_thd2~0_In-608898024 ~x$r_buff0_thd2~0_Out-608898024) (or .cse0 .cse1)) (and (not .cse1) (= ~x$r_buff0_thd2~0_Out-608898024 0) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-608898024, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-608898024} OutVars{P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-608898024|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-608898024, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-608898024} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 17:39:43,355 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [662] [662] L768-->L768-2: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd2~0_In-1079368268 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In-1079368268 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-1079368268 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In-1079368268 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite14_Out-1079368268| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~x$r_buff1_thd2~0_In-1079368268 |P1Thread1of1ForFork1_#t~ite14_Out-1079368268|) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1079368268, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1079368268, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1079368268, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1079368268} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1079368268, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1079368268, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1079368268, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-1079368268|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1079368268} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 17:39:43,355 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [665] [665] L768-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_38 1) v_~__unbuffered_cnt~0_37) (= v_~x$r_buff1_thd2~0_46 |v_P1Thread1of1ForFork1_#t~ite14_34|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_34|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_46, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_37, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_33|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 17:39:43,356 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] L734-->L734-2: Formula: (let ((.cse2 (= (mod ~x$w_buff0_used~0_In-1856801370 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd1~0_In-1856801370 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In-1856801370 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd1~0_In-1856801370 256) 0))) (or (and (= ~x$r_buff1_thd1~0_In-1856801370 |P0Thread1of1ForFork0_#t~ite8_Out-1856801370|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-1856801370|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1856801370, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1856801370, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1856801370, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1856801370} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1856801370, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1856801370|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1856801370, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1856801370, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1856801370} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 17:39:43,356 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L734-2-->P0EXIT: Formula: (and (= v_~x$r_buff1_thd1~0_94 |v_P0Thread1of1ForFork0_#t~ite8_34|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_49 1) v_~__unbuffered_cnt~0_48) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_33|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_94} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-27 17:39:43,357 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [591] [591] L789-1-->L795: Formula: (and (= 2 v_~__unbuffered_cnt~0_15) (= v_~main$tmp_guard0~0_8 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 17:39:43,357 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [645] [645] L795-2-->L795-4: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In-1350176483 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1350176483 256)))) (or (and (or .cse0 .cse1) (= ~x~0_In-1350176483 |ULTIMATE.start_main_#t~ite17_Out-1350176483|)) (and (= |ULTIMATE.start_main_#t~ite17_Out-1350176483| ~x$w_buff1~0_In-1350176483) (not .cse1) (not .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1350176483, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1350176483, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1350176483, ~x~0=~x~0_In-1350176483} OutVars{ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out-1350176483|, ~x$w_buff1~0=~x$w_buff1~0_In-1350176483, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1350176483, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1350176483, ~x~0=~x~0_In-1350176483} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17] because there is no mapped edge [2019-12-27 17:39:43,358 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [624] [624] L795-4-->L796: Formula: (= v_~x~0_42 |v_ULTIMATE.start_main_#t~ite17_11|) InVars {ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_11|} OutVars{ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_10|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_6|, ~x~0=v_~x~0_42} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18, ~x~0] because there is no mapped edge [2019-12-27 17:39:43,358 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [656] [656] L796-->L796-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In655182603 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In655182603 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite19_Out655182603| 0)) (and (= |ULTIMATE.start_main_#t~ite19_Out655182603| ~x$w_buff0_used~0_In655182603) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In655182603, ~x$w_buff0_used~0=~x$w_buff0_used~0_In655182603} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In655182603, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out655182603|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In655182603} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-27 17:39:43,359 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L797-->L797-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In-39465672 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In-39465672 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-39465672 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-39465672 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite20_Out-39465672| ~x$w_buff1_used~0_In-39465672)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |ULTIMATE.start_main_#t~ite20_Out-39465672| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-39465672, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-39465672, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-39465672, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-39465672} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-39465672, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-39465672, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-39465672|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-39465672, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-39465672} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 17:39:43,359 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L798-->L798-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In778118595 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd0~0_In778118595 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite21_Out778118595| 0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite21_Out778118595| ~x$r_buff0_thd0~0_In778118595) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In778118595, ~x$w_buff0_used~0=~x$w_buff0_used~0_In778118595} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In778118595, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out778118595|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In778118595} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 17:39:43,360 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [655] [655] L799-->L799-2: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In-156001259 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-156001259 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In-156001259 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In-156001259 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite22_Out-156001259| 0)) (and (= ~x$r_buff1_thd0~0_In-156001259 |ULTIMATE.start_main_#t~ite22_Out-156001259|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-156001259, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-156001259, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-156001259, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-156001259} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-156001259, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-156001259, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-156001259, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-156001259|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-156001259} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 17:39:43,363 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L811-->L812: Formula: (and (not (= (mod v_~weak$$choice2~0_40 256) 0)) (= v_~x$r_buff0_thd0~0_150 v_~x$r_buff0_thd0~0_151)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_151, ~weak$$choice2~0=v_~weak$$choice2~0_40} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_150, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_14|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_11|, ~weak$$choice2~0=v_~weak$$choice2~0_40} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-27 17:39:43,364 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [673] [673] L814-->L817-1: Formula: (and (= v_~x$mem_tmp~0_10 v_~x~0_111) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7| (mod v_~main$tmp_guard1~0_11 256)) (not (= 0 (mod v_~x$flush_delayed~0_20 256))) (= v_~x$flush_delayed~0_19 0)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_20, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_11, ~x$mem_tmp~0=v_~x$mem_tmp~0_10} OutVars{~x$flush_delayed~0=v_~x$flush_delayed~0_19, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_11, ~x$mem_tmp~0=v_~x$mem_tmp~0_10, ~x~0=v_~x~0_111, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_16|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[~x$flush_delayed~0, ~x~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 17:39:43,365 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [670] [670] L817-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 17:39:43,492 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 05:39:43 BasicIcfg [2019-12-27 17:39:43,492 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 17:39:43,495 INFO L168 Benchmark]: Toolchain (without parser) took 14080.30 ms. Allocated memory was 134.2 MB in the beginning and 670.6 MB in the end (delta: 536.3 MB). Free memory was 97.9 MB in the beginning and 417.3 MB in the end (delta: -319.4 MB). Peak memory consumption was 217.0 MB. Max. memory is 7.1 GB. [2019-12-27 17:39:43,495 INFO L168 Benchmark]: CDTParser took 0.47 ms. Allocated memory is still 134.2 MB. Free memory is still 117.0 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-27 17:39:43,496 INFO L168 Benchmark]: CACSL2BoogieTranslator took 804.72 ms. Allocated memory was 134.2 MB in the beginning and 199.2 MB in the end (delta: 65.0 MB). Free memory was 97.5 MB in the beginning and 152.9 MB in the end (delta: -55.4 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. [2019-12-27 17:39:43,497 INFO L168 Benchmark]: Boogie Procedure Inliner took 84.97 ms. Allocated memory is still 199.2 MB. Free memory was 152.9 MB in the beginning and 150.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-27 17:39:43,497 INFO L168 Benchmark]: Boogie Preprocessor took 37.68 ms. Allocated memory is still 199.2 MB. Free memory was 150.8 MB in the beginning and 147.6 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. [2019-12-27 17:39:43,498 INFO L168 Benchmark]: RCFGBuilder took 794.05 ms. Allocated memory is still 199.2 MB. Free memory was 147.6 MB in the beginning and 103.7 MB in the end (delta: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 7.1 GB. [2019-12-27 17:39:43,499 INFO L168 Benchmark]: TraceAbstraction took 12351.50 ms. Allocated memory was 199.2 MB in the beginning and 670.6 MB in the end (delta: 471.3 MB). Free memory was 103.7 MB in the beginning and 417.3 MB in the end (delta: -313.6 MB). Peak memory consumption was 157.8 MB. Max. memory is 7.1 GB. [2019-12-27 17:39:43,503 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.47 ms. Allocated memory is still 134.2 MB. Free memory is still 117.0 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 804.72 ms. Allocated memory was 134.2 MB in the beginning and 199.2 MB in the end (delta: 65.0 MB). Free memory was 97.5 MB in the beginning and 152.9 MB in the end (delta: -55.4 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 84.97 ms. Allocated memory is still 199.2 MB. Free memory was 152.9 MB in the beginning and 150.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.68 ms. Allocated memory is still 199.2 MB. Free memory was 150.8 MB in the beginning and 147.6 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 794.05 ms. Allocated memory is still 199.2 MB. Free memory was 147.6 MB in the beginning and 103.7 MB in the end (delta: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12351.50 ms. Allocated memory was 199.2 MB in the beginning and 670.6 MB in the end (delta: 471.3 MB). Free memory was 103.7 MB in the beginning and 417.3 MB in the end (delta: -313.6 MB). Peak memory consumption was 157.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.5s, 147 ProgramPointsBefore, 81 ProgramPointsAfterwards, 181 TransitionsBefore, 94 TransitionsAfterwards, 10378 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 24 ChoiceCompositions, 3783 VarBasedMoverChecksPositive, 170 VarBasedMoverChecksNegative, 19 SemBasedMoverChecksPositive, 202 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.2s, 0 MoverChecksTotal, 50487 CheckedPairsTotal, 98 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L787] FCALL, FORK 0 pthread_create(&t1587, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L789] FCALL, FORK 0 pthread_create(&t1588, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L744] 2 x$w_buff1 = x$w_buff0 [L745] 2 x$w_buff0 = 2 [L746] 2 x$w_buff1_used = x$w_buff0_used [L747] 2 x$w_buff0_used = (_Bool)1 [L724] 1 y = 2 [L727] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L730] 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L731] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L764] 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_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L732] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L764] 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) [L765] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L766] 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 [L733] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L795] 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=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L796] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L797] 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 [L798] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L799] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L802] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L803] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L804] 0 x$flush_delayed = weak$$choice2 [L805] 0 x$mem_tmp = x VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L806] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L806] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L807] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L807] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L808] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L808] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L809] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L809] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L810] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L810] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L812] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L812] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L813] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 12.0s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1189 SDtfs, 620 SDslu, 1999 SDs, 0 SdLazy, 1242 SolverSat, 64 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 82 GetRequests, 23 SyntacticMatches, 14 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13038occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.7s AutomataMinimizationTime, 12 MinimizatonAttempts, 1773 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 525 NumberOfCodeBlocks, 525 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 459 ConstructedInterpolants, 0 QuantifiedInterpolants, 62680 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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...