/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/safe029_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 18:45:55,131 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 18:45:55,133 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 18:45:55,152 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 18:45:55,152 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 18:45:55,155 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 18:45:55,157 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 18:45:55,167 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 18:45:55,170 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 18:45:55,173 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 18:45:55,175 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 18:45:55,177 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 18:45:55,177 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 18:45:55,179 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 18:45:55,181 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 18:45:55,183 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 18:45:55,184 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 18:45:55,185 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 18:45:55,186 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 18:45:55,191 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 18:45:55,195 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 18:45:55,200 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 18:45:55,201 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 18:45:55,202 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 18:45:55,204 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 18:45:55,204 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 18:45:55,205 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 18:45:55,206 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 18:45:55,208 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 18:45:55,209 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 18:45:55,209 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 18:45:55,210 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 18:45:55,211 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 18:45:55,212 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 18:45:55,213 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 18:45:55,214 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 18:45:55,214 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 18:45:55,215 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 18:45:55,215 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 18:45:55,216 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 18:45:55,217 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 18:45:55,218 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 18:45:55,246 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 18:45:55,246 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 18:45:55,254 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 18:45:55,255 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 18:45:55,255 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 18:45:55,255 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 18:45:55,255 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 18:45:55,256 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 18:45:55,256 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 18:45:55,256 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 18:45:55,256 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 18:45:55,256 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 18:45:55,256 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 18:45:55,258 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 18:45:55,259 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 18:45:55,259 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 18:45:55,259 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 18:45:55,259 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 18:45:55,259 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 18:45:55,260 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 18:45:55,260 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 18:45:55,260 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 18:45:55,261 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 18:45:55,261 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 18:45:55,261 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 18:45:55,261 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 18:45:55,261 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 18:45:55,261 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 18:45:55,262 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 18:45:55,262 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 18:45:55,262 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 18:45:55,556 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 18:45:55,571 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 18:45:55,575 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 18:45:55,577 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 18:45:55,578 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 18:45:55,580 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe029_power.oepc.i [2019-12-27 18:45:55,653 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2bb9379ce/507a299ecc814ea2ad62a38c0039383e/FLAG78940bafa [2019-12-27 18:45:56,218 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 18:45:56,219 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_power.oepc.i [2019-12-27 18:45:56,238 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2bb9379ce/507a299ecc814ea2ad62a38c0039383e/FLAG78940bafa [2019-12-27 18:45:56,484 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2bb9379ce/507a299ecc814ea2ad62a38c0039383e [2019-12-27 18:45:56,493 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 18:45:56,495 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 18:45:56,496 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 18:45:56,497 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 18:45:56,500 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 18:45:56,501 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:45:56" (1/1) ... [2019-12-27 18:45:56,504 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23a66491 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:45:56, skipping insertion in model container [2019-12-27 18:45:56,504 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:45:56" (1/1) ... [2019-12-27 18:45:56,512 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 18:45:56,577 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 18:45:57,163 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 18:45:57,178 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 18:45:57,277 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 18:45:57,370 INFO L208 MainTranslator]: Completed translation [2019-12-27 18:45:57,371 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:45:57 WrapperNode [2019-12-27 18:45:57,371 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 18:45:57,372 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 18:45:57,372 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 18:45:57,372 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 18:45:57,382 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:45:57" (1/1) ... [2019-12-27 18:45:57,413 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:45:57" (1/1) ... [2019-12-27 18:45:57,451 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 18:45:57,451 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 18:45:57,452 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 18:45:57,452 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 18:45:57,462 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:45:57" (1/1) ... [2019-12-27 18:45:57,463 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:45:57" (1/1) ... [2019-12-27 18:45:57,468 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:45:57" (1/1) ... [2019-12-27 18:45:57,468 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:45:57" (1/1) ... [2019-12-27 18:45:57,478 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:45:57" (1/1) ... [2019-12-27 18:45:57,482 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:45:57" (1/1) ... [2019-12-27 18:45:57,486 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:45:57" (1/1) ... [2019-12-27 18:45:57,491 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 18:45:57,492 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 18:45:57,492 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 18:45:57,492 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 18:45:57,493 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:45:57" (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 18:45:57,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 18:45:57,578 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 18:45:57,578 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 18:45:57,578 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 18:45:57,579 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 18:45:57,579 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 18:45:57,580 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 18:45:57,580 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 18:45:57,581 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 18:45:57,581 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 18:45:57,581 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 18:45:57,583 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 18:45:58,282 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 18:45:58,283 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 18:45:58,284 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:45:58 BoogieIcfgContainer [2019-12-27 18:45:58,284 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 18:45:58,286 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 18:45:58,288 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 18:45:58,292 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 18:45:58,293 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 06:45:56" (1/3) ... [2019-12-27 18:45:58,294 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c402156 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:45:58, skipping insertion in model container [2019-12-27 18:45:58,295 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:45:57" (2/3) ... [2019-12-27 18:45:58,295 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c402156 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:45:58, skipping insertion in model container [2019-12-27 18:45:58,296 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:45:58" (3/3) ... [2019-12-27 18:45:58,298 INFO L109 eAbstractionObserver]: Analyzing ICFG safe029_power.oepc.i [2019-12-27 18:45:58,309 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 18:45:58,310 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 18:45:58,323 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 18:45:58,324 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 18:45:58,383 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:45:58,383 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:45:58,383 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:45:58,383 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:45:58,384 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:45:58,384 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:45:58,384 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:45:58,384 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:45:58,385 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:45:58,385 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:45:58,385 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:45:58,386 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:45:58,386 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:45:58,386 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:45:58,386 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:45:58,387 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:45:58,387 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:45:58,387 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:45:58,387 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:45:58,388 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:45:58,388 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:45:58,388 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:45:58,388 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:45:58,389 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:45:58,389 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:45:58,389 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:45:58,389 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:45:58,390 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:45:58,390 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:45:58,390 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:45:58,391 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:45:58,391 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:45:58,391 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:45:58,391 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:45:58,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:45:58,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:45:58,392 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:45:58,393 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:45:58,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:45:58,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:45:58,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:45:58,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:45:58,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:45:58,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:45:58,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:45:58,398 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:45:58,398 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:45:58,398 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:45:58,398 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:45:58,399 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:45:58,399 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:45:58,399 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:45:58,399 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:45:58,400 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:45:58,400 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:45:58,401 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:45:58,401 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:45:58,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:45:58,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:45:58,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:45:58,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:45:58,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:45:58,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:45:58,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:45:58,407 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:45:58,407 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:45:58,408 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:45:58,408 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:45:58,408 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:45:58,409 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:45:58,409 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:45:58,409 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:45:58,409 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:45:58,410 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:45:58,410 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:45:58,410 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:45:58,416 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:45:58,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:45:58,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:45:58,416 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:45:58,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:45:58,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:45:58,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:45:58,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:45:58,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:45:58,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:45:58,434 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 18:45:58,452 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 18:45:58,452 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 18:45:58,452 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 18:45:58,452 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 18:45:58,452 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 18:45:58,452 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 18:45:58,453 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 18:45:58,453 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 18:45:58,470 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 145 places, 179 transitions [2019-12-27 18:45:58,472 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 145 places, 179 transitions [2019-12-27 18:45:58,594 INFO L132 PetriNetUnfolder]: 41/177 cut-off events. [2019-12-27 18:45:58,594 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 18:45:58,607 INFO L76 FinitePrefix]: Finished finitePrefix Result has 184 conditions, 177 events. 41/177 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 250 event pairs. 0/134 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 18:45:58,624 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 145 places, 179 transitions [2019-12-27 18:45:58,668 INFO L132 PetriNetUnfolder]: 41/177 cut-off events. [2019-12-27 18:45:58,669 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 18:45:58,679 INFO L76 FinitePrefix]: Finished finitePrefix Result has 184 conditions, 177 events. 41/177 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 250 event pairs. 0/134 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 18:45:58,694 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10418 [2019-12-27 18:45:58,695 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 18:46:03,257 WARN L192 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 77 [2019-12-27 18:46:03,399 INFO L206 etLargeBlockEncoding]: Checked pairs total: 46212 [2019-12-27 18:46:03,399 INFO L214 etLargeBlockEncoding]: Total number of compositions: 97 [2019-12-27 18:46:03,406 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 78 places, 90 transitions [2019-12-27 18:46:03,970 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8458 states. [2019-12-27 18:46:03,973 INFO L276 IsEmpty]: Start isEmpty. Operand 8458 states. [2019-12-27 18:46:03,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 18:46:03,979 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:46:03,980 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 18:46:03,980 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:46:03,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:46:03,987 INFO L82 PathProgramCache]: Analyzing trace with hash 717058, now seen corresponding path program 1 times [2019-12-27 18:46:03,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:46:03,999 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370343932] [2019-12-27 18:46:03,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:46:04,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:46:04,208 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 18:46:04,208 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370343932] [2019-12-27 18:46:04,209 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:46:04,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 18:46:04,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [806956864] [2019-12-27 18:46:04,211 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:46:04,217 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:46:04,229 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 18:46:04,230 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:46:04,234 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:46:04,234 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:46:04,234 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:46:04,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:46:04,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:46:04,252 INFO L87 Difference]: Start difference. First operand 8458 states. Second operand 3 states. [2019-12-27 18:46:04,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:46:04,550 INFO L93 Difference]: Finished difference Result 8394 states and 27476 transitions. [2019-12-27 18:46:04,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:46:04,552 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 18:46:04,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:46:04,675 INFO L225 Difference]: With dead ends: 8394 [2019-12-27 18:46:04,675 INFO L226 Difference]: Without dead ends: 8226 [2019-12-27 18:46:04,677 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 18:46:04,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8226 states. [2019-12-27 18:46:05,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8226 to 8226. [2019-12-27 18:46:05,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8226 states. [2019-12-27 18:46:05,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8226 states to 8226 states and 26958 transitions. [2019-12-27 18:46:05,196 INFO L78 Accepts]: Start accepts. Automaton has 8226 states and 26958 transitions. Word has length 3 [2019-12-27 18:46:05,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:46:05,197 INFO L462 AbstractCegarLoop]: Abstraction has 8226 states and 26958 transitions. [2019-12-27 18:46:05,197 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:46:05,197 INFO L276 IsEmpty]: Start isEmpty. Operand 8226 states and 26958 transitions. [2019-12-27 18:46:05,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 18:46:05,202 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:46:05,203 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:46:05,203 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:46:05,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:46:05,204 INFO L82 PathProgramCache]: Analyzing trace with hash 651590314, now seen corresponding path program 1 times [2019-12-27 18:46:05,204 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:46:05,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929406288] [2019-12-27 18:46:05,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:46:05,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:46:05,406 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 18:46:05,408 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929406288] [2019-12-27 18:46:05,408 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:46:05,408 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:46:05,409 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1977644045] [2019-12-27 18:46:05,409 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:46:05,411 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:46:05,415 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 18:46:05,415 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:46:05,416 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:46:05,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:46:05,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:46:05,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:46:05,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:46:05,419 INFO L87 Difference]: Start difference. First operand 8226 states and 26958 transitions. Second operand 4 states. [2019-12-27 18:46:05,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:46:05,880 INFO L93 Difference]: Finished difference Result 12778 states and 40134 transitions. [2019-12-27 18:46:05,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:46:05,881 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 18:46:05,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:46:05,977 INFO L225 Difference]: With dead ends: 12778 [2019-12-27 18:46:05,978 INFO L226 Difference]: Without dead ends: 12771 [2019-12-27 18:46:05,979 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:46:06,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12771 states. [2019-12-27 18:46:07,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12771 to 11467. [2019-12-27 18:46:07,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11467 states. [2019-12-27 18:46:07,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11467 states to 11467 states and 36507 transitions. [2019-12-27 18:46:07,155 INFO L78 Accepts]: Start accepts. Automaton has 11467 states and 36507 transitions. Word has length 11 [2019-12-27 18:46:07,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:46:07,155 INFO L462 AbstractCegarLoop]: Abstraction has 11467 states and 36507 transitions. [2019-12-27 18:46:07,156 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:46:07,156 INFO L276 IsEmpty]: Start isEmpty. Operand 11467 states and 36507 transitions. [2019-12-27 18:46:07,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 18:46:07,164 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:46:07,164 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:46:07,164 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:46:07,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:46:07,165 INFO L82 PathProgramCache]: Analyzing trace with hash -1968692504, now seen corresponding path program 1 times [2019-12-27 18:46:07,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:46:07,166 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793120432] [2019-12-27 18:46:07,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:46:07,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:46:07,294 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 18:46:07,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793120432] [2019-12-27 18:46:07,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:46:07,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:46:07,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2063859599] [2019-12-27 18:46:07,295 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:46:07,297 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:46:07,298 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 18:46:07,298 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:46:07,299 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:46:07,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:46:07,300 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:46:07,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:46:07,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:46:07,300 INFO L87 Difference]: Start difference. First operand 11467 states and 36507 transitions. Second operand 4 states. [2019-12-27 18:46:07,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:46:07,571 INFO L93 Difference]: Finished difference Result 14268 states and 44852 transitions. [2019-12-27 18:46:07,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:46:07,572 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 18:46:07,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:46:07,624 INFO L225 Difference]: With dead ends: 14268 [2019-12-27 18:46:07,624 INFO L226 Difference]: Without dead ends: 14268 [2019-12-27 18:46:07,625 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:46:07,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14268 states. [2019-12-27 18:46:08,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14268 to 12752. [2019-12-27 18:46:08,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12752 states. [2019-12-27 18:46:08,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12752 states to 12752 states and 40448 transitions. [2019-12-27 18:46:08,195 INFO L78 Accepts]: Start accepts. Automaton has 12752 states and 40448 transitions. Word has length 11 [2019-12-27 18:46:08,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:46:08,204 INFO L462 AbstractCegarLoop]: Abstraction has 12752 states and 40448 transitions. [2019-12-27 18:46:08,205 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:46:08,205 INFO L276 IsEmpty]: Start isEmpty. Operand 12752 states and 40448 transitions. [2019-12-27 18:46:08,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 18:46:08,209 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:46:08,210 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:46:08,210 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:46:08,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:46:08,210 INFO L82 PathProgramCache]: Analyzing trace with hash -1372508181, now seen corresponding path program 1 times [2019-12-27 18:46:08,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:46:08,212 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294675982] [2019-12-27 18:46:08,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:46:08,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:46:08,399 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 18:46:08,400 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294675982] [2019-12-27 18:46:08,400 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:46:08,403 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 18:46:08,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [67006076] [2019-12-27 18:46:08,404 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:46:08,407 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:46:08,411 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 32 states and 45 transitions. [2019-12-27 18:46:08,412 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:46:08,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 18:46:08,457 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 18:46:08,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 18:46:08,458 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:46:08,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 18:46:08,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:46:08,458 INFO L87 Difference]: Start difference. First operand 12752 states and 40448 transitions. Second operand 7 states. [2019-12-27 18:46:09,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:46:09,515 INFO L93 Difference]: Finished difference Result 18884 states and 58847 transitions. [2019-12-27 18:46:09,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 18:46:09,515 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2019-12-27 18:46:09,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:46:09,568 INFO L225 Difference]: With dead ends: 18884 [2019-12-27 18:46:09,568 INFO L226 Difference]: Without dead ends: 18877 [2019-12-27 18:46:09,568 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 18:46:09,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18877 states. [2019-12-27 18:46:09,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18877 to 13559. [2019-12-27 18:46:09,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13559 states. [2019-12-27 18:46:10,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13559 states to 13559 states and 43046 transitions. [2019-12-27 18:46:10,011 INFO L78 Accepts]: Start accepts. Automaton has 13559 states and 43046 transitions. Word has length 17 [2019-12-27 18:46:10,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:46:10,011 INFO L462 AbstractCegarLoop]: Abstraction has 13559 states and 43046 transitions. [2019-12-27 18:46:10,012 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 18:46:10,012 INFO L276 IsEmpty]: Start isEmpty. Operand 13559 states and 43046 transitions. [2019-12-27 18:46:10,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 18:46:10,025 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:46:10,025 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:46:10,025 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:46:10,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:46:10,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1155459573, now seen corresponding path program 1 times [2019-12-27 18:46:10,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:46:10,026 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243259259] [2019-12-27 18:46:10,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:46:10,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:46:10,062 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 18:46:10,062 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243259259] [2019-12-27 18:46:10,062 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:46:10,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:46:10,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [126081669] [2019-12-27 18:46:10,063 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:46:10,067 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:46:10,231 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 18:46:10,231 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:46:10,232 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:46:10,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:46:10,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:46:10,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:46:10,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:46:10,233 INFO L87 Difference]: Start difference. First operand 13559 states and 43046 transitions. Second operand 3 states. [2019-12-27 18:46:10,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:46:10,348 INFO L93 Difference]: Finished difference Result 16463 states and 51634 transitions. [2019-12-27 18:46:10,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:46:10,349 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-12-27 18:46:10,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:46:10,389 INFO L225 Difference]: With dead ends: 16463 [2019-12-27 18:46:10,389 INFO L226 Difference]: Without dead ends: 16463 [2019-12-27 18:46:10,390 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 18:46:10,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16463 states. [2019-12-27 18:46:10,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16463 to 14516. [2019-12-27 18:46:10,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14516 states. [2019-12-27 18:46:10,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14516 states to 14516 states and 45999 transitions. [2019-12-27 18:46:10,807 INFO L78 Accepts]: Start accepts. Automaton has 14516 states and 45999 transitions. Word has length 25 [2019-12-27 18:46:10,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:46:10,808 INFO L462 AbstractCegarLoop]: Abstraction has 14516 states and 45999 transitions. [2019-12-27 18:46:10,808 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:46:10,808 INFO L276 IsEmpty]: Start isEmpty. Operand 14516 states and 45999 transitions. [2019-12-27 18:46:10,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 18:46:10,822 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:46:10,822 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:46:10,823 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:46:10,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:46:10,823 INFO L82 PathProgramCache]: Analyzing trace with hash -1248228747, now seen corresponding path program 1 times [2019-12-27 18:46:10,824 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:46:10,824 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952084286] [2019-12-27 18:46:10,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:46:10,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:46:10,940 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 18:46:10,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952084286] [2019-12-27 18:46:10,941 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:46:10,941 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 18:46:10,941 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [118904332] [2019-12-27 18:46:10,941 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:46:10,945 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:46:10,950 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 18:46:10,950 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:46:10,950 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:46:10,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 18:46:10,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:46:10,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 18:46:10,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:46:10,951 INFO L87 Difference]: Start difference. First operand 14516 states and 45999 transitions. Second operand 6 states. [2019-12-27 18:46:11,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:46:11,584 INFO L93 Difference]: Finished difference Result 20445 states and 63414 transitions. [2019-12-27 18:46:11,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 18:46:11,586 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-27 18:46:11,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:46:11,621 INFO L225 Difference]: With dead ends: 20445 [2019-12-27 18:46:11,621 INFO L226 Difference]: Without dead ends: 20429 [2019-12-27 18:46:11,621 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-27 18:46:11,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20429 states. [2019-12-27 18:46:12,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20429 to 16673. [2019-12-27 18:46:12,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16673 states. [2019-12-27 18:46:12,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16673 states to 16673 states and 52455 transitions. [2019-12-27 18:46:12,113 INFO L78 Accepts]: Start accepts. Automaton has 16673 states and 52455 transitions. Word has length 25 [2019-12-27 18:46:12,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:46:12,114 INFO L462 AbstractCegarLoop]: Abstraction has 16673 states and 52455 transitions. [2019-12-27 18:46:12,114 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 18:46:12,114 INFO L276 IsEmpty]: Start isEmpty. Operand 16673 states and 52455 transitions. [2019-12-27 18:46:12,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-27 18:46:12,136 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:46:12,137 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] [2019-12-27 18:46:12,137 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:46:12,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:46:12,137 INFO L82 PathProgramCache]: Analyzing trace with hash 279625016, now seen corresponding path program 1 times [2019-12-27 18:46:12,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:46:12,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517345196] [2019-12-27 18:46:12,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:46:12,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:46:12,226 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 18:46:12,227 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517345196] [2019-12-27 18:46:12,227 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:46:12,227 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:46:12,228 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [169573316] [2019-12-27 18:46:12,228 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:46:12,234 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:46:12,246 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 51 states and 68 transitions. [2019-12-27 18:46:12,247 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:46:12,287 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 18:46:12,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 18:46:12,288 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:46:12,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 18:46:12,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:46:12,289 INFO L87 Difference]: Start difference. First operand 16673 states and 52455 transitions. Second operand 6 states. [2019-12-27 18:46:12,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:46:12,788 INFO L93 Difference]: Finished difference Result 2448 states and 5588 transitions. [2019-12-27 18:46:12,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 18:46:12,789 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2019-12-27 18:46:12,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:46:12,793 INFO L225 Difference]: With dead ends: 2448 [2019-12-27 18:46:12,793 INFO L226 Difference]: Without dead ends: 2141 [2019-12-27 18:46:12,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-12-27 18:46:12,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2141 states. [2019-12-27 18:46:12,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2141 to 2046. [2019-12-27 18:46:12,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2046 states. [2019-12-27 18:46:12,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2046 states to 2046 states and 4531 transitions. [2019-12-27 18:46:12,822 INFO L78 Accepts]: Start accepts. Automaton has 2046 states and 4531 transitions. Word has length 31 [2019-12-27 18:46:12,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:46:12,823 INFO L462 AbstractCegarLoop]: Abstraction has 2046 states and 4531 transitions. [2019-12-27 18:46:12,823 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 18:46:12,823 INFO L276 IsEmpty]: Start isEmpty. Operand 2046 states and 4531 transitions. [2019-12-27 18:46:12,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 18:46:12,826 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:46:12,826 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] [2019-12-27 18:46:12,827 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:46:12,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:46:12,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1011623832, now seen corresponding path program 1 times [2019-12-27 18:46:12,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:46:12,828 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708397993] [2019-12-27 18:46:12,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:46:12,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:46:13,126 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 18:46:13,127 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708397993] [2019-12-27 18:46:13,127 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:46:13,127 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 18:46:13,128 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [683884744] [2019-12-27 18:46:13,128 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:46:13,144 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:46:13,157 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 38 states and 37 transitions. [2019-12-27 18:46:13,157 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:46:13,158 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:46:13,159 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 18:46:13,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:46:13,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 18:46:13,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-27 18:46:13,160 INFO L87 Difference]: Start difference. First operand 2046 states and 4531 transitions. Second operand 9 states. [2019-12-27 18:46:14,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:46:14,087 INFO L93 Difference]: Finished difference Result 3161 states and 6801 transitions. [2019-12-27 18:46:14,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 18:46:14,088 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2019-12-27 18:46:14,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:46:14,094 INFO L225 Difference]: With dead ends: 3161 [2019-12-27 18:46:14,094 INFO L226 Difference]: Without dead ends: 3159 [2019-12-27 18:46:14,095 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-12-27 18:46:14,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3159 states. [2019-12-27 18:46:14,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3159 to 2600. [2019-12-27 18:46:14,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2600 states. [2019-12-27 18:46:14,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2600 states to 2600 states and 5677 transitions. [2019-12-27 18:46:14,141 INFO L78 Accepts]: Start accepts. Automaton has 2600 states and 5677 transitions. Word has length 37 [2019-12-27 18:46:14,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:46:14,142 INFO L462 AbstractCegarLoop]: Abstraction has 2600 states and 5677 transitions. [2019-12-27 18:46:14,142 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 18:46:14,142 INFO L276 IsEmpty]: Start isEmpty. Operand 2600 states and 5677 transitions. [2019-12-27 18:46:14,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 18:46:14,149 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:46:14,149 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:46:14,149 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:46:14,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:46:14,150 INFO L82 PathProgramCache]: Analyzing trace with hash -669150451, now seen corresponding path program 1 times [2019-12-27 18:46:14,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:46:14,151 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423913902] [2019-12-27 18:46:14,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:46:14,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:46:14,268 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 18:46:14,269 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423913902] [2019-12-27 18:46:14,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:46:14,269 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 18:46:14,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [581517402] [2019-12-27 18:46:14,270 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:46:14,281 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:46:14,299 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 64 states and 85 transitions. [2019-12-27 18:46:14,300 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:46:14,401 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 18:46:14,401 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 18:46:14,401 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:46:14,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 18:46:14,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 18:46:14,402 INFO L87 Difference]: Start difference. First operand 2600 states and 5677 transitions. Second operand 8 states. [2019-12-27 18:46:15,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:46:15,048 INFO L93 Difference]: Finished difference Result 3395 states and 7301 transitions. [2019-12-27 18:46:15,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 18:46:15,049 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2019-12-27 18:46:15,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:46:15,054 INFO L225 Difference]: With dead ends: 3395 [2019-12-27 18:46:15,054 INFO L226 Difference]: Without dead ends: 3395 [2019-12-27 18:46:15,055 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-27 18:46:15,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3395 states. [2019-12-27 18:46:15,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3395 to 2964. [2019-12-27 18:46:15,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2964 states. [2019-12-27 18:46:15,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2964 states to 2964 states and 6443 transitions. [2019-12-27 18:46:15,087 INFO L78 Accepts]: Start accepts. Automaton has 2964 states and 6443 transitions. Word has length 41 [2019-12-27 18:46:15,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:46:15,087 INFO L462 AbstractCegarLoop]: Abstraction has 2964 states and 6443 transitions. [2019-12-27 18:46:15,087 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 18:46:15,088 INFO L276 IsEmpty]: Start isEmpty. Operand 2964 states and 6443 transitions. [2019-12-27 18:46:15,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 18:46:15,093 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:46:15,093 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] [2019-12-27 18:46:15,094 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:46:15,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:46:15,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1349071825, now seen corresponding path program 1 times [2019-12-27 18:46:15,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:46:15,095 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205105265] [2019-12-27 18:46:15,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:46:15,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:46:15,468 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 18:46:15,469 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205105265] [2019-12-27 18:46:15,469 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:46:15,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 18:46:15,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [414578451] [2019-12-27 18:46:15,469 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:46:15,478 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:46:15,495 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 65 states and 86 transitions. [2019-12-27 18:46:15,496 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:46:15,513 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 18:46:15,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 18:46:15,514 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:46:15,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 18:46:15,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:46:15,514 INFO L87 Difference]: Start difference. First operand 2964 states and 6443 transitions. Second operand 7 states. [2019-12-27 18:46:15,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:46:15,708 INFO L93 Difference]: Finished difference Result 5393 states and 11851 transitions. [2019-12-27 18:46:15,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 18:46:15,709 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2019-12-27 18:46:15,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:46:15,713 INFO L225 Difference]: With dead ends: 5393 [2019-12-27 18:46:15,714 INFO L226 Difference]: Without dead ends: 2721 [2019-12-27 18:46:15,714 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-12-27 18:46:15,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2721 states. [2019-12-27 18:46:15,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2721 to 2512. [2019-12-27 18:46:15,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2512 states. [2019-12-27 18:46:15,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2512 states to 2512 states and 5440 transitions. [2019-12-27 18:46:15,743 INFO L78 Accepts]: Start accepts. Automaton has 2512 states and 5440 transitions. Word has length 42 [2019-12-27 18:46:15,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:46:15,744 INFO L462 AbstractCegarLoop]: Abstraction has 2512 states and 5440 transitions. [2019-12-27 18:46:15,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 18:46:15,744 INFO L276 IsEmpty]: Start isEmpty. Operand 2512 states and 5440 transitions. [2019-12-27 18:46:15,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-27 18:46:15,749 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:46:15,749 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] [2019-12-27 18:46:15,749 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:46:15,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:46:15,750 INFO L82 PathProgramCache]: Analyzing trace with hash 1852418777, now seen corresponding path program 1 times [2019-12-27 18:46:15,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:46:15,750 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986047651] [2019-12-27 18:46:15,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:46:15,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:46:16,016 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 18:46:16,016 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986047651] [2019-12-27 18:46:16,016 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:46:16,017 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 18:46:16,017 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1008143948] [2019-12-27 18:46:16,017 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:46:16,026 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:46:16,038 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 44 states and 43 transitions. [2019-12-27 18:46:16,038 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:46:16,038 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:46:16,039 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 18:46:16,039 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:46:16,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 18:46:16,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-12-27 18:46:16,040 INFO L87 Difference]: Start difference. First operand 2512 states and 5440 transitions. Second operand 11 states. [2019-12-27 18:46:16,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:46:16,315 INFO L93 Difference]: Finished difference Result 2801 states and 5995 transitions. [2019-12-27 18:46:16,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 18:46:16,316 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 43 [2019-12-27 18:46:16,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:46:16,320 INFO L225 Difference]: With dead ends: 2801 [2019-12-27 18:46:16,320 INFO L226 Difference]: Without dead ends: 2690 [2019-12-27 18:46:16,321 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-12-27 18:46:16,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2690 states. [2019-12-27 18:46:16,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2690 to 2486. [2019-12-27 18:46:16,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2486 states. [2019-12-27 18:46:16,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2486 states to 2486 states and 5382 transitions. [2019-12-27 18:46:16,370 INFO L78 Accepts]: Start accepts. Automaton has 2486 states and 5382 transitions. Word has length 43 [2019-12-27 18:46:16,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:46:16,370 INFO L462 AbstractCegarLoop]: Abstraction has 2486 states and 5382 transitions. [2019-12-27 18:46:16,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 18:46:16,371 INFO L276 IsEmpty]: Start isEmpty. Operand 2486 states and 5382 transitions. [2019-12-27 18:46:16,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-27 18:46:16,377 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:46:16,377 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] [2019-12-27 18:46:16,377 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:46:16,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:46:16,378 INFO L82 PathProgramCache]: Analyzing trace with hash 588171772, now seen corresponding path program 1 times [2019-12-27 18:46:16,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:46:16,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576869161] [2019-12-27 18:46:16,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:46:16,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:46:16,494 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 18:46:16,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576869161] [2019-12-27 18:46:16,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:46:16,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 18:46:16,495 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1897251566] [2019-12-27 18:46:16,496 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:46:16,505 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:46:16,517 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 46 states and 47 transitions. [2019-12-27 18:46:16,518 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:46:16,518 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:46:16,518 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:46:16,519 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:46:16,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:46:16,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:46:16,519 INFO L87 Difference]: Start difference. First operand 2486 states and 5382 transitions. Second operand 5 states. [2019-12-27 18:46:16,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:46:16,561 INFO L93 Difference]: Finished difference Result 632 states and 1130 transitions. [2019-12-27 18:46:16,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:46:16,561 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-12-27 18:46:16,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:46:16,562 INFO L225 Difference]: With dead ends: 632 [2019-12-27 18:46:16,563 INFO L226 Difference]: Without dead ends: 518 [2019-12-27 18:46:16,563 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:46:16,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2019-12-27 18:46:16,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 447. [2019-12-27 18:46:16,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 447 states. [2019-12-27 18:46:16,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 809 transitions. [2019-12-27 18:46:16,569 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 809 transitions. Word has length 43 [2019-12-27 18:46:16,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:46:16,569 INFO L462 AbstractCegarLoop]: Abstraction has 447 states and 809 transitions. [2019-12-27 18:46:16,569 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:46:16,569 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 809 transitions. [2019-12-27 18:46:16,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 18:46:16,570 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:46:16,571 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 18:46:16,571 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:46:16,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:46:16,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1706256168, now seen corresponding path program 1 times [2019-12-27 18:46:16,572 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:46:16,572 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955132832] [2019-12-27 18:46:16,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:46:16,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:46:16,642 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 18:46:16,642 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955132832] [2019-12-27 18:46:16,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:46:16,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:46:16,643 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [555952248] [2019-12-27 18:46:16,643 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:46:16,655 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:46:16,690 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 87 states and 117 transitions. [2019-12-27 18:46:16,691 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:46:16,701 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 18:46:16,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:46:16,701 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:46:16,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:46:16,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:46:16,702 INFO L87 Difference]: Start difference. First operand 447 states and 809 transitions. Second operand 4 states. [2019-12-27 18:46:16,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:46:16,816 INFO L93 Difference]: Finished difference Result 387 states and 687 transitions. [2019-12-27 18:46:16,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:46:16,816 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-12-27 18:46:16,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:46:16,817 INFO L225 Difference]: With dead ends: 387 [2019-12-27 18:46:16,817 INFO L226 Difference]: Without dead ends: 387 [2019-12-27 18:46:16,818 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 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 18:46:16,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2019-12-27 18:46:16,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 308. [2019-12-27 18:46:16,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2019-12-27 18:46:16,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 551 transitions. [2019-12-27 18:46:16,824 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 551 transitions. Word has length 52 [2019-12-27 18:46:16,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:46:16,824 INFO L462 AbstractCegarLoop]: Abstraction has 308 states and 551 transitions. [2019-12-27 18:46:16,824 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:46:16,824 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 551 transitions. [2019-12-27 18:46:16,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 18:46:16,825 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:46:16,825 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 18:46:16,825 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:46:16,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:46:16,825 INFO L82 PathProgramCache]: Analyzing trace with hash 2062591520, now seen corresponding path program 1 times [2019-12-27 18:46:16,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:46:16,826 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117453199] [2019-12-27 18:46:16,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:46:16,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:46:16,891 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 18:46:16,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117453199] [2019-12-27 18:46:16,892 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:46:16,892 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:46:16,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [4206145] [2019-12-27 18:46:16,893 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:46:16,906 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:46:16,945 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 87 states and 114 transitions. [2019-12-27 18:46:16,946 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:46:16,946 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:46:16,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:46:16,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:46:16,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:46:16,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:46:16,948 INFO L87 Difference]: Start difference. First operand 308 states and 551 transitions. Second operand 3 states. [2019-12-27 18:46:16,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:46:16,995 INFO L93 Difference]: Finished difference Result 307 states and 549 transitions. [2019-12-27 18:46:16,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:46:16,995 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-27 18:46:16,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:46:16,996 INFO L225 Difference]: With dead ends: 307 [2019-12-27 18:46:16,996 INFO L226 Difference]: Without dead ends: 307 [2019-12-27 18:46:16,996 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 18:46:16,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-12-27 18:46:16,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 219. [2019-12-27 18:46:16,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-12-27 18:46:16,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 389 transitions. [2019-12-27 18:46:17,000 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 389 transitions. Word has length 53 [2019-12-27 18:46:17,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:46:17,000 INFO L462 AbstractCegarLoop]: Abstraction has 219 states and 389 transitions. [2019-12-27 18:46:17,000 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:46:17,000 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 389 transitions. [2019-12-27 18:46:17,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 18:46:17,001 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:46:17,001 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 18:46:17,001 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:46:17,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:46:17,002 INFO L82 PathProgramCache]: Analyzing trace with hash 133727006, now seen corresponding path program 1 times [2019-12-27 18:46:17,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:46:17,002 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253665407] [2019-12-27 18:46:17,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:46:17,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:46:17,234 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 18:46:17,235 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253665407] [2019-12-27 18:46:17,235 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:46:17,235 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 18:46:17,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1017481349] [2019-12-27 18:46:17,236 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:46:17,260 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:46:17,309 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 88 states and 113 transitions. [2019-12-27 18:46:17,310 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:46:17,572 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 18:46:17,572 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 18:46:17,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:46:17,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 18:46:17,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2019-12-27 18:46:17,574 INFO L87 Difference]: Start difference. First operand 219 states and 389 transitions. Second operand 17 states. [2019-12-27 18:46:19,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:46:19,645 INFO L93 Difference]: Finished difference Result 564 states and 958 transitions. [2019-12-27 18:46:19,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-27 18:46:19,646 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-12-27 18:46:19,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:46:19,647 INFO L225 Difference]: With dead ends: 564 [2019-12-27 18:46:19,647 INFO L226 Difference]: Without dead ends: 533 [2019-12-27 18:46:19,649 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=354, Invalid=1626, Unknown=0, NotChecked=0, Total=1980 [2019-12-27 18:46:19,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2019-12-27 18:46:19,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 319. [2019-12-27 18:46:19,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2019-12-27 18:46:19,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 560 transitions. [2019-12-27 18:46:19,654 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 560 transitions. Word has length 54 [2019-12-27 18:46:19,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:46:19,655 INFO L462 AbstractCegarLoop]: Abstraction has 319 states and 560 transitions. [2019-12-27 18:46:19,655 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 18:46:19,655 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 560 transitions. [2019-12-27 18:46:19,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 18:46:19,655 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:46:19,656 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:46:19,656 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:46:19,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:46:19,656 INFO L82 PathProgramCache]: Analyzing trace with hash 815200260, now seen corresponding path program 2 times [2019-12-27 18:46:19,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:46:19,657 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178483373] [2019-12-27 18:46:19,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:46:19,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:46:20,040 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 18:46:20,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178483373] [2019-12-27 18:46:20,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:46:20,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 18:46:20,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [601740352] [2019-12-27 18:46:20,041 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:46:20,074 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:46:20,108 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 81 states and 102 transitions. [2019-12-27 18:46:20,108 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:46:20,191 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 18:46:20,192 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 18:46:20,192 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:46:20,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 18:46:20,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2019-12-27 18:46:20,193 INFO L87 Difference]: Start difference. First operand 319 states and 560 transitions. Second operand 16 states. [2019-12-27 18:46:20,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:46:20,791 INFO L93 Difference]: Finished difference Result 420 states and 712 transitions. [2019-12-27 18:46:20,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 18:46:20,792 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 54 [2019-12-27 18:46:20,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:46:20,793 INFO L225 Difference]: With dead ends: 420 [2019-12-27 18:46:20,793 INFO L226 Difference]: Without dead ends: 389 [2019-12-27 18:46:20,794 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=146, Invalid=556, Unknown=0, NotChecked=0, Total=702 [2019-12-27 18:46:20,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2019-12-27 18:46:20,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 327. [2019-12-27 18:46:20,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2019-12-27 18:46:20,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 574 transitions. [2019-12-27 18:46:20,798 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 574 transitions. Word has length 54 [2019-12-27 18:46:20,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:46:20,798 INFO L462 AbstractCegarLoop]: Abstraction has 327 states and 574 transitions. [2019-12-27 18:46:20,798 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 18:46:20,798 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 574 transitions. [2019-12-27 18:46:20,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 18:46:20,799 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:46:20,799 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 18:46:20,799 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:46:20,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:46:20,800 INFO L82 PathProgramCache]: Analyzing trace with hash 2067211286, now seen corresponding path program 3 times [2019-12-27 18:46:20,800 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:46:20,801 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568793092] [2019-12-27 18:46:20,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:46:20,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 18:46:20,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 18:46:20,899 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 18:46:20,899 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 18:46:20,903 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] ULTIMATE.startENTRY-->L777: Formula: (let ((.cse0 (store |v_#valid_40| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t2473~0.base_19|) (= 0 v_~__unbuffered_cnt~0_61) (= v_~weak$$choice2~0_132 0) (= |v_#NULL.offset_6| 0) (= v_~y$read_delayed~0_7 0) (= v_~y$w_buff1_used~0_444 0) (= v_~y$r_buff1_thd0~0_304 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t2473~0.base_19|) 0) (= v_~main$tmp_guard0~0_23 0) (= v_~y$r_buff0_thd0~0_394 0) (= |v_#valid_38| (store .cse0 |v_ULTIMATE.start_main_~#t2473~0.base_19| 1)) (= |v_#memory_int_15| (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2473~0.base_19| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2473~0.base_19|) |v_ULTIMATE.start_main_~#t2473~0.offset_16| 0))) (= 0 v_~y$w_buff0~0_376) (= 0 |v_#NULL.base_6|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2473~0.base_19| 4)) (= v_~y$r_buff1_thd1~0_220 0) (= v_~y~0_141 0) (= v_~y$r_buff0_thd1~0_301 0) (= 0 v_~weak$$choice0~0_24) (= 0 v_~y$flush_delayed~0_48) (= 0 v_~y$r_buff0_thd2~0_175) (= v_~y$w_buff1~0_254 0) (= v_~y$mem_tmp~0_31 0) (= v_~y$w_buff0_used~0_753 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= 0 v_~y$r_buff1_thd2~0_205) (= 0 |v_ULTIMATE.start_main_~#t2473~0.offset_16|) (= 0 v_~x~0_168) (< 0 |v_#StackHeapBarrier_13|) (= v_~main$tmp_guard1~0_22 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_45|, ULTIMATE.start_main_~#t2473~0.base=|v_ULTIMATE.start_main_~#t2473~0.base_19|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_32|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_32|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_42|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_56|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_35|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$mem_tmp~0=v_~y$mem_tmp~0_31, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_301, ~y$flush_delayed~0=v_~y$flush_delayed~0_48, #length=|v_#length_15|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_29|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_32|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_44|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_35|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_51|, ULTIMATE.start_main_~#t2474~0.offset=|v_ULTIMATE.start_main_~#t2474~0.offset_15|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_45|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_31|, ~weak$$choice0~0=v_~weak$$choice0~0_24, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_30|, ~y$w_buff1~0=v_~y$w_buff1~0_254, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_175, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61, ULTIMATE.start_main_~#t2473~0.offset=|v_ULTIMATE.start_main_~#t2473~0.offset_16|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_304, ~x~0=v_~x~0_168, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_753, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_28|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_28|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_22, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_43|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_28|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_46|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_28|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_220, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_39|, ~y$w_buff0~0=v_~y$w_buff0~0_376, ~y~0=v_~y~0_141, ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_30|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_44|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_26|, ULTIMATE.start_main_~#t2474~0.base=|v_ULTIMATE.start_main_~#t2474~0.base_19|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_37|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_29|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_23, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_28|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_39|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_205, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_16|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_15|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_394, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_13|, ~weak$$choice2~0=v_~weak$$choice2~0_132, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_444} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_~#t2473~0.base, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~y$mem_tmp~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_~#t2474~0.offset, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet15, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t2473~0.offset, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite30, ~y$w_buff0~0, ~y~0, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_~#t2474~0.base, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 18:46:20,904 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L777-1-->L779: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t2474~0.base_11|)) (= |v_#valid_21| (store |v_#valid_22| |v_ULTIMATE.start_main_~#t2474~0.base_11| 1)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2474~0.base_11| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2474~0.base_11|) |v_ULTIMATE.start_main_~#t2474~0.offset_10| 1))) (= 0 |v_ULTIMATE.start_main_~#t2474~0.offset_10|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t2474~0.base_11|) (= 0 (select |v_#valid_22| |v_ULTIMATE.start_main_~#t2474~0.base_11|)) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t2474~0.base_11| 4) |v_#length_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t2474~0.base=|v_ULTIMATE.start_main_~#t2474~0.base_11|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_9|, ULTIMATE.start_main_~#t2474~0.offset=|v_ULTIMATE.start_main_~#t2474~0.offset_10|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t2474~0.base, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t2474~0.offset] because there is no mapped edge [2019-12-27 18:46:20,905 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [623] [623] P0ENTRY-->L4-3: Formula: (and (= 2 v_~y$w_buff0~0_172) (= 1 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_79|) (= v_P0Thread1of1ForFork0_~arg.offset_79 |v_P0Thread1of1ForFork0_#in~arg.offset_79|) (= v_~y$w_buff0_used~0_290 1) (= 0 (mod v_~y$w_buff1_used~0_162 256)) (= v_P0Thread1of1ForFork0_~arg.base_79 |v_P0Thread1of1ForFork0_#in~arg.base_79|) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_81 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_79|) (= v_~y$w_buff0_used~0_291 v_~y$w_buff1_used~0_162) (= v_~y$w_buff1~0_100 v_~y$w_buff0~0_173)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_79|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_291, ~y$w_buff0~0=v_~y$w_buff0~0_173, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_79|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_79|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_290, ~y$w_buff1~0=v_~y$w_buff1~0_100, ~y$w_buff0~0=v_~y$w_buff0~0_172, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_81, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_79|, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_79, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_79|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_79, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_162} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 18:46:20,906 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [656] [656] L735-->L735-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1868292120 256))) (.cse1 (= (mod ~y$r_buff0_thd1~0_In-1868292120 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-1868292120|)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-1868292120 |P0Thread1of1ForFork0_#t~ite5_Out-1868292120|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1868292120, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1868292120} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1868292120|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1868292120, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1868292120} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 18:46:20,907 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L754-2-->L754-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In358577650 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In358577650 256) 0))) (or (and (or .cse0 .cse1) (= ~y~0_In358577650 |P1Thread1of1ForFork1_#t~ite9_Out358577650|)) (and (= ~y$w_buff1~0_In358577650 |P1Thread1of1ForFork1_#t~ite9_Out358577650|) (not .cse0) (not .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In358577650, ~y$w_buff1~0=~y$w_buff1~0_In358577650, ~y~0=~y~0_In358577650, ~y$w_buff1_used~0=~y$w_buff1_used~0_In358577650} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In358577650, ~y$w_buff1~0=~y$w_buff1~0_In358577650, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out358577650|, ~y~0=~y~0_In358577650, ~y$w_buff1_used~0=~y$w_buff1_used~0_In358577650} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-12-27 18:46:20,907 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [630] [630] L754-4-->L755: Formula: (= v_~y~0_50 |v_P1Thread1of1ForFork1_#t~ite9_14|) InVars {P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_14|} OutVars{P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_13|, P1Thread1of1ForFork1_#t~ite10=|v_P1Thread1of1ForFork1_#t~ite10_15|, ~y~0=v_~y~0_50} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10, ~y~0] because there is no mapped edge [2019-12-27 18:46:20,907 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L755-->L755-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In-866758635 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-866758635 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out-866758635| 0)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-866758635 |P1Thread1of1ForFork1_#t~ite11_Out-866758635|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-866758635, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-866758635} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-866758635, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-866758635, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-866758635|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 18:46:20,908 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L736-->L736-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd1~0_In-1208549131 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-1208549131 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1208549131 256))) (.cse2 (= (mod ~y$r_buff0_thd1~0_In-1208549131 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-1208549131|)) (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-1208549131 |P0Thread1of1ForFork0_#t~ite6_Out-1208549131|) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1208549131, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1208549131, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1208549131, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1208549131} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1208549131|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1208549131, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1208549131, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1208549131, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1208549131} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 18:46:20,908 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L737-->L738: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-16239108 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd1~0_In-16239108 256) 0))) (or (and (not .cse0) (not .cse1) (= ~y$r_buff0_thd1~0_Out-16239108 0)) (and (= ~y$r_buff0_thd1~0_Out-16239108 ~y$r_buff0_thd1~0_In-16239108) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-16239108, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-16239108} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-16239108, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-16239108|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-16239108} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 18:46:20,909 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [638] [638] L756-->L756-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1883641018 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In-1883641018 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1883641018 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-1883641018 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite12_Out-1883641018| ~y$w_buff1_used~0_In-1883641018)) (and (= |P1Thread1of1ForFork1_#t~ite12_Out-1883641018| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1883641018, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1883641018, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1883641018, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1883641018} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1883641018, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1883641018, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1883641018, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-1883641018|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1883641018} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 18:46:20,909 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L757-->L757-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In-802994113 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-802994113 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd2~0_In-802994113 |P1Thread1of1ForFork1_#t~ite13_Out-802994113|)) (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite13_Out-802994113|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-802994113, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-802994113} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-802994113, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-802994113, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-802994113|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-27 18:46:20,910 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [644] [644] L758-->L758-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1576983071 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1576983071 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In1576983071 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In1576983071 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite14_Out1576983071| ~y$r_buff1_thd2~0_In1576983071) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P1Thread1of1ForFork1_#t~ite14_Out1576983071|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1576983071, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1576983071, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1576983071, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1576983071} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1576983071, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1576983071, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1576983071, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out1576983071|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1576983071} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 18:46:20,910 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [668] [668] L758-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= |v_P1Thread1of1ForFork1_#t~ite14_34| v_~y$r_buff1_thd2~0_85) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_34|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_85, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_33|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 18:46:20,910 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [655] [655] L738-->L738-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff1_thd1~0_In597863118 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In597863118 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In597863118 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd1~0_In597863118 256) 0))) (or (and (= ~y$r_buff1_thd1~0_In597863118 |P0Thread1of1ForFork0_#t~ite8_Out597863118|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork0_#t~ite8_Out597863118| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In597863118, ~y$w_buff0_used~0=~y$w_buff0_used~0_In597863118, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In597863118, ~y$w_buff1_used~0=~y$w_buff1_used~0_In597863118} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In597863118, ~y$w_buff0_used~0=~y$w_buff0_used~0_In597863118, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out597863118|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In597863118, ~y$w_buff1_used~0=~y$w_buff1_used~0_In597863118} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 18:46:20,910 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [663] [663] L738-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_32 (+ v_~__unbuffered_cnt~0_33 1)) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~y$r_buff1_thd1~0_63 |v_P0Thread1of1ForFork0_#t~ite8_28|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_63, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_27|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 18:46:20,911 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [592] [592] L783-->L785-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (or (= (mod v_~y$w_buff0_used~0_159 256) 0) (= (mod v_~y$r_buff0_thd0~0_61 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_159, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_61, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_159, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_61, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 18:46:20,911 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [654] [654] L785-2-->L785-4: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd0~0_In376567630 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In376567630 256)))) (or (and (or .cse0 .cse1) (= ~y~0_In376567630 |ULTIMATE.start_main_#t~ite17_Out376567630|)) (and (= |ULTIMATE.start_main_#t~ite17_Out376567630| ~y$w_buff1~0_In376567630) (not .cse1) (not .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In376567630, ~y~0=~y~0_In376567630, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In376567630, ~y$w_buff1_used~0=~y$w_buff1_used~0_In376567630} OutVars{ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out376567630|, ~y$w_buff1~0=~y$w_buff1~0_In376567630, ~y~0=~y~0_In376567630, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In376567630, ~y$w_buff1_used~0=~y$w_buff1_used~0_In376567630} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17] because there is no mapped edge [2019-12-27 18:46:20,911 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [621] [621] L785-4-->L786: Formula: (= v_~y~0_46 |v_ULTIMATE.start_main_#t~ite17_8|) InVars {ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_8|} OutVars{ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_7|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_8|, ~y~0=v_~y~0_46} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18, ~y~0] because there is no mapped edge [2019-12-27 18:46:20,911 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L786-->L786-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1209069827 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-1209069827 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite19_Out-1209069827| 0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite19_Out-1209069827| ~y$w_buff0_used~0_In-1209069827)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1209069827, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1209069827} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1209069827, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-1209069827|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1209069827} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-27 18:46:20,912 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [641] [641] L787-->L787-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd0~0_In1404631295 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1404631295 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In1404631295 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1404631295 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite20_Out1404631295|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite20_Out1404631295| ~y$w_buff1_used~0_In1404631295) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1404631295, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1404631295, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1404631295, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1404631295} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1404631295, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1404631295, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out1404631295|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1404631295, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1404631295} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 18:46:20,913 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [650] [650] L788-->L788-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-766526642 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-766526642 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite21_Out-766526642|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In-766526642 |ULTIMATE.start_main_#t~ite21_Out-766526642|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-766526642, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-766526642} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-766526642, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-766526642, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-766526642|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 18:46:20,913 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [642] [642] L789-->L789-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In213226455 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In213226455 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In213226455 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In213226455 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite22_Out213226455| ~y$r_buff1_thd0~0_In213226455)) (and (= 0 |ULTIMATE.start_main_#t~ite22_Out213226455|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In213226455, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In213226455, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In213226455, ~y$w_buff1_used~0=~y$w_buff1_used~0_In213226455} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In213226455, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In213226455, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In213226455, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out213226455|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In213226455} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 18:46:20,916 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L799-->L799-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1006295709 256)))) (or (and (= |ULTIMATE.start_main_#t~ite35_Out1006295709| ~y$w_buff0_used~0_In1006295709) (= |ULTIMATE.start_main_#t~ite34_In1006295709| |ULTIMATE.start_main_#t~ite34_Out1006295709|) (not .cse0)) (and (= |ULTIMATE.start_main_#t~ite35_Out1006295709| |ULTIMATE.start_main_#t~ite34_Out1006295709|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1006295709 256)))) (or (= (mod ~y$w_buff0_used~0_In1006295709 256) 0) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In1006295709 256))) (and .cse1 (= (mod ~y$r_buff1_thd0~0_In1006295709 256) 0)))) (= ~y$w_buff0_used~0_In1006295709 |ULTIMATE.start_main_#t~ite34_Out1006295709|) .cse0))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1006295709, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1006295709, ~weak$$choice2~0=~weak$$choice2~0_In1006295709, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1006295709, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1006295709, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_In1006295709|} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1006295709, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1006295709, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out1006295709|, ~weak$$choice2~0=~weak$$choice2~0_In1006295709, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1006295709, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out1006295709|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1006295709} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-27 18:46:20,917 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [597] [597] L801-->L802: Formula: (and (= v_~y$r_buff0_thd0~0_72 v_~y$r_buff0_thd0~0_71) (not (= (mod v_~weak$$choice2~0_23 256) 0))) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_72, ~weak$$choice2~0=v_~weak$$choice2~0_23} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_7|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_7|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_71, ~weak$$choice2~0=v_~weak$$choice2~0_23} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39, ~y$r_buff0_thd0~0] because there is no mapped edge [2019-12-27 18:46:20,918 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [676] [676] L804-->L4: Formula: (and (= v_~y~0_99 v_~y$mem_tmp~0_21) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10| (mod v_~main$tmp_guard1~0_10 256)) (not (= 0 (mod v_~y$flush_delayed~0_36 256))) (= 0 v_~y$flush_delayed~0_35)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_21, ~y$flush_delayed~0=v_~y$flush_delayed~0_36, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_21, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~y$flush_delayed~0=v_~y$flush_delayed~0_35, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ~y~0=v_~y~0_99, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_28|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~y$flush_delayed~0, ~y~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 18:46:20,918 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 18:46:20,979 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 06:46:20 BasicIcfg [2019-12-27 18:46:20,979 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 18:46:20,981 INFO L168 Benchmark]: Toolchain (without parser) took 24486.07 ms. Allocated memory was 138.9 MB in the beginning and 858.3 MB in the end (delta: 719.3 MB). Free memory was 100.2 MB in the beginning and 629.1 MB in the end (delta: -528.9 MB). Peak memory consumption was 190.4 MB. Max. memory is 7.1 GB. [2019-12-27 18:46:20,982 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 138.9 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-27 18:46:20,982 INFO L168 Benchmark]: CACSL2BoogieTranslator took 874.84 ms. Allocated memory was 138.9 MB in the beginning and 204.5 MB in the end (delta: 65.5 MB). Free memory was 100.0 MB in the beginning and 158.7 MB in the end (delta: -58.8 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB. [2019-12-27 18:46:20,983 INFO L168 Benchmark]: Boogie Procedure Inliner took 79.54 ms. Allocated memory is still 204.5 MB. Free memory was 158.7 MB in the beginning and 156.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 18:46:20,984 INFO L168 Benchmark]: Boogie Preprocessor took 39.89 ms. Allocated memory is still 204.5 MB. Free memory was 156.1 MB in the beginning and 153.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 18:46:20,984 INFO L168 Benchmark]: RCFGBuilder took 792.77 ms. Allocated memory is still 204.5 MB. Free memory was 153.5 MB in the beginning and 109.5 MB in the end (delta: 44.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 7.1 GB. [2019-12-27 18:46:20,985 INFO L168 Benchmark]: TraceAbstraction took 22692.84 ms. Allocated memory was 204.5 MB in the beginning and 858.3 MB in the end (delta: 653.8 MB). Free memory was 109.5 MB in the beginning and 629.1 MB in the end (delta: -519.6 MB). Peak memory consumption was 134.2 MB. Max. memory is 7.1 GB. [2019-12-27 18:46:20,989 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.24 ms. Allocated memory is still 138.9 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 874.84 ms. Allocated memory was 138.9 MB in the beginning and 204.5 MB in the end (delta: 65.5 MB). Free memory was 100.0 MB in the beginning and 158.7 MB in the end (delta: -58.8 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 79.54 ms. Allocated memory is still 204.5 MB. Free memory was 158.7 MB in the beginning and 156.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.89 ms. Allocated memory is still 204.5 MB. Free memory was 156.1 MB in the beginning and 153.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 792.77 ms. Allocated memory is still 204.5 MB. Free memory was 153.5 MB in the beginning and 109.5 MB in the end (delta: 44.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 22692.84 ms. Allocated memory was 204.5 MB in the beginning and 858.3 MB in the end (delta: 653.8 MB). Free memory was 109.5 MB in the beginning and 629.1 MB in the end (delta: -519.6 MB). Peak memory consumption was 134.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.9s, 145 ProgramPointsBefore, 78 ProgramPointsAfterwards, 179 TransitionsBefore, 90 TransitionsAfterwards, 10418 CoEnabledTransitionPairs, 7 FixpointIterations, 27 TrivialSequentialCompositions, 38 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 25 ChoiceCompositions, 3579 VarBasedMoverChecksPositive, 213 VarBasedMoverChecksNegative, 67 SemBasedMoverChecksPositive, 198 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.6s, 0 MoverChecksTotal, 46212 CheckedPairsTotal, 97 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L777] FCALL, FORK 0 pthread_create(&t2473, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L779] FCALL, FORK 0 pthread_create(&t2474, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L725] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L726] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L727] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L728] 1 y$r_buff0_thd1 = (_Bool)1 [L731] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L734] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L748] 2 x = 2 [L751] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L734] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L754] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L735] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L736] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L755] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L756] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L757] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L781] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L786] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L787] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L788] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L789] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L792] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L793] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L794] 0 y$flush_delayed = weak$$choice2 [L795] 0 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L796] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L796] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L797] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L797] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L798] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L798] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L799] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L800] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L800] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L802] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L802] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L803] 0 main$tmp_guard1 = !(x == 2 && y == 2) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 139 locations, 2 error locations. Result: UNSAFE, OverallTime: 22.4s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 8.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2167 SDtfs, 2521 SDslu, 6005 SDs, 0 SdLazy, 4153 SolverSat, 217 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 215 GetRequests, 34 SyntacticMatches, 28 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 676 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16673occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.8s AutomataMinimizationTime, 16 MinimizatonAttempts, 15853 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 596 NumberOfCodeBlocks, 596 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 526 ConstructedInterpolants, 0 QuantifiedInterpolants, 120556 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...