/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/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe032_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-c7e336b [2020-10-05 23:42:17,154 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-05 23:42:17,157 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-05 23:42:17,200 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-05 23:42:17,200 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-05 23:42:17,211 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-05 23:42:17,212 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-05 23:42:17,215 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-05 23:42:17,218 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-05 23:42:17,221 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-05 23:42:17,222 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-05 23:42:17,224 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-05 23:42:17,225 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-05 23:42:17,227 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-05 23:42:17,229 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-05 23:42:17,230 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-05 23:42:17,232 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-05 23:42:17,233 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-05 23:42:17,234 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-05 23:42:17,240 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-05 23:42:17,242 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-05 23:42:17,244 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-05 23:42:17,245 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-05 23:42:17,246 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-05 23:42:17,251 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-05 23:42:17,251 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-05 23:42:17,252 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-05 23:42:17,254 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-05 23:42:17,255 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-05 23:42:17,256 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-05 23:42:17,256 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-05 23:42:17,257 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-05 23:42:17,257 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-05 23:42:17,258 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-05 23:42:17,259 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-05 23:42:17,259 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-05 23:42:17,260 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-05 23:42:17,260 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-05 23:42:17,260 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-05 23:42:17,261 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-05 23:42:17,263 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-05 23:42:17,263 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf [2020-10-05 23:42:17,303 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-05 23:42:17,305 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-05 23:42:17,306 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-05 23:42:17,306 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-05 23:42:17,307 INFO L138 SettingsManager]: * Use SBE=true [2020-10-05 23:42:17,307 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-05 23:42:17,307 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-05 23:42:17,307 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-05 23:42:17,308 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-05 23:42:17,308 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-05 23:42:17,309 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-05 23:42:17,309 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-05 23:42:17,310 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-05 23:42:17,310 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-05 23:42:17,310 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-05 23:42:17,311 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-05 23:42:17,311 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-05 23:42:17,311 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-05 23:42:17,311 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-05 23:42:17,311 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-05 23:42:17,312 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-05 23:42:17,312 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-05 23:42:17,312 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-05 23:42:17,312 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-05 23:42:17,312 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-05 23:42:17,313 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-05 23:42:17,313 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-05 23:42:17,313 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-05 23:42:17,313 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-05 23:42:17,603 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-05 23:42:17,616 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-05 23:42:17,619 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-05 23:42:17,621 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-05 23:42:17,622 INFO L275 PluginConnector]: CDTParser initialized [2020-10-05 23:42:17,622 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe032_rmo.oepc.i [2020-10-05 23:42:17,687 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81d9b3123/14d41fd90e514003909a92820de65b11/FLAGb4955f4c5 [2020-10-05 23:42:18,211 INFO L306 CDTParser]: Found 1 translation units. [2020-10-05 23:42:18,212 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe032_rmo.oepc.i [2020-10-05 23:42:18,239 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81d9b3123/14d41fd90e514003909a92820de65b11/FLAGb4955f4c5 [2020-10-05 23:42:18,571 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81d9b3123/14d41fd90e514003909a92820de65b11 [2020-10-05 23:42:18,580 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-05 23:42:18,582 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-05 23:42:18,583 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-05 23:42:18,584 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-05 23:42:18,587 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-05 23:42:18,588 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 11:42:18" (1/1) ... [2020-10-05 23:42:18,591 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74a1cbdc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:42:18, skipping insertion in model container [2020-10-05 23:42:18,591 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 11:42:18" (1/1) ... [2020-10-05 23:42:18,597 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-05 23:42:18,647 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-05 23:42:19,232 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-05 23:42:19,244 INFO L203 MainTranslator]: Completed pre-run [2020-10-05 23:42:19,321 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-05 23:42:19,396 INFO L208 MainTranslator]: Completed translation [2020-10-05 23:42:19,396 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:42:19 WrapperNode [2020-10-05 23:42:19,397 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-05 23:42:19,398 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-05 23:42:19,398 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-05 23:42:19,398 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-05 23:42:19,407 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:42:19" (1/1) ... [2020-10-05 23:42:19,431 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:42:19" (1/1) ... [2020-10-05 23:42:19,475 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-05 23:42:19,476 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-05 23:42:19,476 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-05 23:42:19,476 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-05 23:42:19,490 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:42:19" (1/1) ... [2020-10-05 23:42:19,491 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:42:19" (1/1) ... [2020-10-05 23:42:19,497 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:42:19" (1/1) ... [2020-10-05 23:42:19,497 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:42:19" (1/1) ... [2020-10-05 23:42:19,513 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:42:19" (1/1) ... [2020-10-05 23:42:19,519 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:42:19" (1/1) ... [2020-10-05 23:42:19,524 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:42:19" (1/1) ... [2020-10-05 23:42:19,531 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-05 23:42:19,532 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-05 23:42:19,532 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-05 23:42:19,532 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-05 23:42:19,533 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:42:19" (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 [2020-10-05 23:42:19,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-05 23:42:19,630 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-05 23:42:19,630 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-05 23:42:19,630 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-05 23:42:19,631 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-05 23:42:19,632 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-05 23:42:19,633 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-05 23:42:19,633 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-05 23:42:19,634 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-05 23:42:19,634 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-05 23:42:19,637 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-05 23:42:19,637 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-05 23:42:19,638 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-05 23:42:19,640 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-05 23:42:23,320 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-05 23:42:23,321 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-05 23:42:23,324 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 11:42:23 BoogieIcfgContainer [2020-10-05 23:42:23,324 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-05 23:42:23,325 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-05 23:42:23,325 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-05 23:42:23,329 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-05 23:42:23,330 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.10 11:42:18" (1/3) ... [2020-10-05 23:42:23,331 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3667f54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 11:42:23, skipping insertion in model container [2020-10-05 23:42:23,331 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:42:19" (2/3) ... [2020-10-05 23:42:23,332 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3667f54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 11:42:23, skipping insertion in model container [2020-10-05 23:42:23,332 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 11:42:23" (3/3) ... [2020-10-05 23:42:23,335 INFO L109 eAbstractionObserver]: Analyzing ICFG safe032_rmo.oepc.i [2020-10-05 23:42:23,348 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-05 23:42:23,349 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-05 23:42:23,360 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-05 23:42:23,361 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-05 23:42:23,427 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,428 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,428 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,428 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,429 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,431 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,431 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,431 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,431 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,432 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,432 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,432 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,432 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,432 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,433 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,433 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,433 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,433 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,433 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,433 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,434 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,434 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,434 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,434 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,434 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,434 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,435 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,435 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,435 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,435 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,435 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,436 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,436 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,436 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,436 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,436 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,437 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,438 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,438 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,438 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,439 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,439 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,441 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,442 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,442 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,442 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,442 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,442 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,443 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,443 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,443 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,443 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,443 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,444 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,444 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,445 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,445 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,445 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,446 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,446 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,446 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,446 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,447 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,447 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,447 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,447 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,448 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,449 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,449 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,449 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,449 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,450 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,450 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,450 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,451 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,451 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,451 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,451 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,452 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,452 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,452 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,453 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,453 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,454 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,454 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,455 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,456 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,456 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,456 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,457 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,457 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,457 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,457 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,460 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,460 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,460 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,461 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,461 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,461 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,462 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,462 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,463 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,464 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,469 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,470 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,470 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,471 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,472 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,472 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,473 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,473 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,473 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,473 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,473 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,474 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,474 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,474 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,478 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,478 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,487 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,487 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,488 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,488 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,488 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,489 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,489 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,489 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,490 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,490 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,490 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,490 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,491 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,491 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,491 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,492 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,492 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,492 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,492 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,493 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,493 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,493 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,493 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,493 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,494 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,494 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,494 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,496 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,497 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,497 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,497 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,497 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,498 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,498 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,498 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,498 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,498 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,498 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,499 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,499 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,499 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,499 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,499 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,500 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,500 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,500 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,501 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,501 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,501 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,501 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,502 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,502 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,502 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,503 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,503 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,503 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,504 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,504 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,504 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,505 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,505 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,505 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,505 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,506 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,506 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,506 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,510 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,510 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,510 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,511 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,511 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,511 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,512 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,512 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,512 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,512 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,513 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,513 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,537 INFO L251 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-05 23:42:23,564 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-10-05 23:42:23,565 INFO L376 AbstractCegarLoop]: Hoare is true [2020-10-05 23:42:23,565 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-05 23:42:23,565 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-05 23:42:23,565 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-05 23:42:23,566 INFO L380 AbstractCegarLoop]: Difference is false [2020-10-05 23:42:23,566 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-05 23:42:23,566 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-05 23:42:23,592 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 199 flow [2020-10-05 23:42:23,595 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 199 flow [2020-10-05 23:42:23,655 INFO L129 PetriNetUnfolder]: 2/89 cut-off events. [2020-10-05 23:42:23,655 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-05 23:42:23,662 INFO L80 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 89 events. 2/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 64 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2020-10-05 23:42:23,666 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 199 flow [2020-10-05 23:42:23,693 INFO L129 PetriNetUnfolder]: 2/89 cut-off events. [2020-10-05 23:42:23,694 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-05 23:42:23,694 INFO L80 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 89 events. 2/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 64 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2020-10-05 23:42:23,698 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1624 [2020-10-05 23:42:23,699 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-10-05 23:42:24,071 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2020-10-05 23:42:24,848 WARN L193 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-10-05 23:42:26,288 WARN L193 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 230 DAG size of output: 189 [2020-10-05 23:42:26,326 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-10-05 23:42:26,327 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 23:42:26,331 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-05 23:42:26,332 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 23:42:27,525 WARN L193 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 146 DAG size of output: 126 [2020-10-05 23:42:28,562 WARN L193 SmtUtils]: Spent 884.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 109 [2020-10-05 23:42:28,860 WARN L193 SmtUtils]: Spent 295.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2020-10-05 23:42:30,546 WARN L193 SmtUtils]: Spent 1.49 s on a formula simplification. DAG size of input: 141 DAG size of output: 132 [2020-10-05 23:42:30,986 WARN L193 SmtUtils]: Spent 436.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2020-10-05 23:42:31,241 WARN L193 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2020-10-05 23:42:31,354 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2020-10-05 23:42:31,363 INFO L206 etLargeBlockEncoding]: Checked pairs total: 4118 [2020-10-05 23:42:31,363 INFO L214 etLargeBlockEncoding]: Total number of compositions: 74 [2020-10-05 23:42:31,367 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 26 transitions, 67 flow [2020-10-05 23:42:31,448 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 778 states. [2020-10-05 23:42:31,454 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states. [2020-10-05 23:42:31,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-10-05 23:42:31,484 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:42:31,485 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:42:31,486 INFO L427 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:42:31,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:42:31,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1033422208, now seen corresponding path program 1 times [2020-10-05 23:42:31,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:42:31,506 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053973717] [2020-10-05 23:42:31,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:42:31,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:42:31,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:42:31,840 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053973717] [2020-10-05 23:42:31,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:42:31,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:42:31,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000919693] [2020-10-05 23:42:31,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:42:31,847 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:42:31,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:42:31,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:42:31,865 INFO L87 Difference]: Start difference. First operand 778 states. Second operand 3 states. [2020-10-05 23:42:32,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:42:32,006 INFO L93 Difference]: Finished difference Result 658 states and 2050 transitions. [2020-10-05 23:42:32,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:42:32,008 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-10-05 23:42:32,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:42:32,031 INFO L225 Difference]: With dead ends: 658 [2020-10-05 23:42:32,031 INFO L226 Difference]: Without dead ends: 538 [2020-10-05 23:42:32,033 INFO L675 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 [2020-10-05 23:42:32,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2020-10-05 23:42:32,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 538. [2020-10-05 23:42:32,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2020-10-05 23:42:32,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 1644 transitions. [2020-10-05 23:42:32,142 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 1644 transitions. Word has length 7 [2020-10-05 23:42:32,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:42:32,143 INFO L479 AbstractCegarLoop]: Abstraction has 538 states and 1644 transitions. [2020-10-05 23:42:32,143 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:42:32,143 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 1644 transitions. [2020-10-05 23:42:32,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-05 23:42:32,147 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:42:32,147 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:42:32,147 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-05 23:42:32,148 INFO L427 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:42:32,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:42:32,148 INFO L82 PathProgramCache]: Analyzing trace with hash 981365630, now seen corresponding path program 1 times [2020-10-05 23:42:32,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:42:32,149 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199423375] [2020-10-05 23:42:32,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:42:32,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:42:32,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:42:32,330 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199423375] [2020-10-05 23:42:32,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:42:32,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:42:32,331 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129783982] [2020-10-05 23:42:32,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:42:32,332 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:42:32,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:42:32,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:42:32,333 INFO L87 Difference]: Start difference. First operand 538 states and 1644 transitions. Second operand 3 states. [2020-10-05 23:42:32,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:42:32,409 INFO L93 Difference]: Finished difference Result 532 states and 1621 transitions. [2020-10-05 23:42:32,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:42:32,411 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-05 23:42:32,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:42:32,417 INFO L225 Difference]: With dead ends: 532 [2020-10-05 23:42:32,417 INFO L226 Difference]: Without dead ends: 532 [2020-10-05 23:42:32,418 INFO L675 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 [2020-10-05 23:42:32,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2020-10-05 23:42:32,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 532. [2020-10-05 23:42:32,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 532 states. [2020-10-05 23:42:32,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 1621 transitions. [2020-10-05 23:42:32,448 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 1621 transitions. Word has length 9 [2020-10-05 23:42:32,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:42:32,448 INFO L479 AbstractCegarLoop]: Abstraction has 532 states and 1621 transitions. [2020-10-05 23:42:32,449 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:42:32,449 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 1621 transitions. [2020-10-05 23:42:32,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-05 23:42:32,450 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:42:32,451 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:42:32,451 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-05 23:42:32,451 INFO L427 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:42:32,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:42:32,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1127615764, now seen corresponding path program 1 times [2020-10-05 23:42:32,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:42:32,452 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346577082] [2020-10-05 23:42:32,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:42:32,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:42:32,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:42:32,520 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346577082] [2020-10-05 23:42:32,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:42:32,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:42:32,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575336149] [2020-10-05 23:42:32,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:42:32,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:42:32,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:42:32,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:42:32,522 INFO L87 Difference]: Start difference. First operand 532 states and 1621 transitions. Second operand 3 states. [2020-10-05 23:42:32,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:42:32,590 INFO L93 Difference]: Finished difference Result 523 states and 1588 transitions. [2020-10-05 23:42:32,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:42:32,592 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-10-05 23:42:32,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:42:32,596 INFO L225 Difference]: With dead ends: 523 [2020-10-05 23:42:32,597 INFO L226 Difference]: Without dead ends: 523 [2020-10-05 23:42:32,597 INFO L675 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 [2020-10-05 23:42:32,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2020-10-05 23:42:32,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 523. [2020-10-05 23:42:32,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 523 states. [2020-10-05 23:42:32,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 1588 transitions. [2020-10-05 23:42:32,620 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 1588 transitions. Word has length 10 [2020-10-05 23:42:32,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:42:32,620 INFO L479 AbstractCegarLoop]: Abstraction has 523 states and 1588 transitions. [2020-10-05 23:42:32,620 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:42:32,621 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 1588 transitions. [2020-10-05 23:42:32,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-05 23:42:32,622 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:42:32,623 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:42:32,623 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-05 23:42:32,625 INFO L427 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:42:32,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:42:32,626 INFO L82 PathProgramCache]: Analyzing trace with hash 357008298, now seen corresponding path program 1 times [2020-10-05 23:42:32,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:42:32,626 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248128494] [2020-10-05 23:42:32,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:42:32,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:42:32,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:42:32,686 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248128494] [2020-10-05 23:42:32,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:42:32,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:42:32,687 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922629660] [2020-10-05 23:42:32,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:42:32,687 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:42:32,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:42:32,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:42:32,688 INFO L87 Difference]: Start difference. First operand 523 states and 1588 transitions. Second operand 3 states. [2020-10-05 23:42:32,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:42:32,702 INFO L93 Difference]: Finished difference Result 517 states and 1565 transitions. [2020-10-05 23:42:32,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:42:32,703 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-10-05 23:42:32,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:42:32,708 INFO L225 Difference]: With dead ends: 517 [2020-10-05 23:42:32,708 INFO L226 Difference]: Without dead ends: 517 [2020-10-05 23:42:32,708 INFO L675 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 [2020-10-05 23:42:32,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2020-10-05 23:42:32,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 517. [2020-10-05 23:42:32,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 517 states. [2020-10-05 23:42:32,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 1565 transitions. [2020-10-05 23:42:32,728 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 1565 transitions. Word has length 10 [2020-10-05 23:42:32,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:42:32,729 INFO L479 AbstractCegarLoop]: Abstraction has 517 states and 1565 transitions. [2020-10-05 23:42:32,729 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:42:32,729 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 1565 transitions. [2020-10-05 23:42:32,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-05 23:42:32,731 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:42:32,731 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:42:32,732 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-05 23:42:32,732 INFO L427 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:42:32,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:42:32,732 INFO L82 PathProgramCache]: Analyzing trace with hash -596905476, now seen corresponding path program 1 times [2020-10-05 23:42:32,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:42:32,733 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486731799] [2020-10-05 23:42:32,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:42:32,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:42:32,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:42:32,783 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486731799] [2020-10-05 23:42:32,783 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:42:32,783 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:42:32,783 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467571379] [2020-10-05 23:42:32,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:42:32,784 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:42:32,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:42:32,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:42:32,784 INFO L87 Difference]: Start difference. First operand 517 states and 1565 transitions. Second operand 3 states. [2020-10-05 23:42:32,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:42:32,802 INFO L93 Difference]: Finished difference Result 472 states and 1409 transitions. [2020-10-05 23:42:32,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:42:32,804 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-05 23:42:32,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:42:32,807 INFO L225 Difference]: With dead ends: 472 [2020-10-05 23:42:32,807 INFO L226 Difference]: Without dead ends: 472 [2020-10-05 23:42:32,807 INFO L675 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 [2020-10-05 23:42:32,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2020-10-05 23:42:32,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 472. [2020-10-05 23:42:32,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2020-10-05 23:42:32,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 1409 transitions. [2020-10-05 23:42:32,824 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 1409 transitions. Word has length 11 [2020-10-05 23:42:32,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:42:32,824 INFO L479 AbstractCegarLoop]: Abstraction has 472 states and 1409 transitions. [2020-10-05 23:42:32,824 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:42:32,825 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 1409 transitions. [2020-10-05 23:42:32,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-05 23:42:32,826 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:42:32,827 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:42:32,827 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-05 23:42:32,827 INFO L427 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:42:32,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:42:32,827 INFO L82 PathProgramCache]: Analyzing trace with hash 733241045, now seen corresponding path program 1 times [2020-10-05 23:42:32,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:42:32,828 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83064791] [2020-10-05 23:42:32,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:42:32,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:42:33,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:42:33,113 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83064791] [2020-10-05 23:42:33,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:42:33,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-05 23:42:33,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646470603] [2020-10-05 23:42:33,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-05 23:42:33,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:42:33,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-05 23:42:33,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:42:33,115 INFO L87 Difference]: Start difference. First operand 472 states and 1409 transitions. Second operand 6 states. [2020-10-05 23:42:33,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:42:33,295 INFO L93 Difference]: Finished difference Result 473 states and 1408 transitions. [2020-10-05 23:42:33,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-05 23:42:33,296 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-10-05 23:42:33,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:42:33,300 INFO L225 Difference]: With dead ends: 473 [2020-10-05 23:42:33,301 INFO L226 Difference]: Without dead ends: 473 [2020-10-05 23:42:33,301 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:42:33,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2020-10-05 23:42:33,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 463. [2020-10-05 23:42:33,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 463 states. [2020-10-05 23:42:33,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 1379 transitions. [2020-10-05 23:42:33,318 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 1379 transitions. Word has length 13 [2020-10-05 23:42:33,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:42:33,318 INFO L479 AbstractCegarLoop]: Abstraction has 463 states and 1379 transitions. [2020-10-05 23:42:33,318 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-05 23:42:33,319 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 1379 transitions. [2020-10-05 23:42:33,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-05 23:42:33,320 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:42:33,320 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:42:33,321 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-05 23:42:33,321 INFO L427 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:42:33,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:42:33,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1255080755, now seen corresponding path program 1 times [2020-10-05 23:42:33,321 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:42:33,322 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182862567] [2020-10-05 23:42:33,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:42:33,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:42:33,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:42:33,477 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182862567] [2020-10-05 23:42:33,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:42:33,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-05 23:42:33,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439987316] [2020-10-05 23:42:33,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-05 23:42:33,478 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:42:33,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-05 23:42:33,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:42:33,479 INFO L87 Difference]: Start difference. First operand 463 states and 1379 transitions. Second operand 6 states. [2020-10-05 23:42:33,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:42:33,680 INFO L93 Difference]: Finished difference Result 499 states and 1496 transitions. [2020-10-05 23:42:33,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:42:33,682 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-10-05 23:42:33,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:42:33,687 INFO L225 Difference]: With dead ends: 499 [2020-10-05 23:42:33,687 INFO L226 Difference]: Without dead ends: 499 [2020-10-05 23:42:33,688 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-05 23:42:33,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2020-10-05 23:42:33,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 499. [2020-10-05 23:42:33,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 499 states. [2020-10-05 23:42:33,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 1496 transitions. [2020-10-05 23:42:33,705 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 1496 transitions. Word has length 14 [2020-10-05 23:42:33,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:42:33,706 INFO L479 AbstractCegarLoop]: Abstraction has 499 states and 1496 transitions. [2020-10-05 23:42:33,706 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-05 23:42:33,706 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 1496 transitions. [2020-10-05 23:42:33,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-05 23:42:33,707 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:42:33,707 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:42:33,708 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-05 23:42:33,708 INFO L427 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:42:33,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:42:33,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1255635965, now seen corresponding path program 2 times [2020-10-05 23:42:33,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:42:33,709 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892073163] [2020-10-05 23:42:33,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:42:33,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:42:33,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:42:33,946 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892073163] [2020-10-05 23:42:33,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:42:33,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-05 23:42:33,947 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396301182] [2020-10-05 23:42:33,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-05 23:42:33,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:42:33,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-05 23:42:33,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-10-05 23:42:33,948 INFO L87 Difference]: Start difference. First operand 499 states and 1496 transitions. Second operand 8 states. [2020-10-05 23:42:34,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:42:34,311 INFO L93 Difference]: Finished difference Result 633 states and 1917 transitions. [2020-10-05 23:42:34,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 23:42:34,312 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2020-10-05 23:42:34,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:42:34,317 INFO L225 Difference]: With dead ends: 633 [2020-10-05 23:42:34,317 INFO L226 Difference]: Without dead ends: 633 [2020-10-05 23:42:34,318 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2020-10-05 23:42:34,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2020-10-05 23:42:34,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 535. [2020-10-05 23:42:34,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 535 states. [2020-10-05 23:42:34,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 1601 transitions. [2020-10-05 23:42:34,341 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 1601 transitions. Word has length 14 [2020-10-05 23:42:34,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:42:34,341 INFO L479 AbstractCegarLoop]: Abstraction has 535 states and 1601 transitions. [2020-10-05 23:42:34,341 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-05 23:42:34,341 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 1601 transitions. [2020-10-05 23:42:34,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-05 23:42:34,343 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:42:34,343 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:42:34,344 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-05 23:42:34,344 INFO L427 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:42:34,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:42:34,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1659355165, now seen corresponding path program 3 times [2020-10-05 23:42:34,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:42:34,345 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680296241] [2020-10-05 23:42:34,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:42:34,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:42:34,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:42:34,471 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680296241] [2020-10-05 23:42:34,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:42:34,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:42:34,471 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4521532] [2020-10-05 23:42:34,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:42:34,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:42:34,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:42:34,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:42:34,473 INFO L87 Difference]: Start difference. First operand 535 states and 1601 transitions. Second operand 5 states. [2020-10-05 23:42:34,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:42:34,662 INFO L93 Difference]: Finished difference Result 604 states and 1805 transitions. [2020-10-05 23:42:34,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:42:34,663 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-10-05 23:42:34,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:42:34,668 INFO L225 Difference]: With dead ends: 604 [2020-10-05 23:42:34,668 INFO L226 Difference]: Without dead ends: 604 [2020-10-05 23:42:34,669 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:42:34,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2020-10-05 23:42:34,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 544. [2020-10-05 23:42:34,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2020-10-05 23:42:34,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 1615 transitions. [2020-10-05 23:42:34,691 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 1615 transitions. Word has length 14 [2020-10-05 23:42:34,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:42:34,691 INFO L479 AbstractCegarLoop]: Abstraction has 544 states and 1615 transitions. [2020-10-05 23:42:34,692 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:42:34,692 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 1615 transitions. [2020-10-05 23:42:34,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-05 23:42:34,693 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:42:34,694 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:42:34,694 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-05 23:42:34,694 INFO L427 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:42:34,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:42:34,694 INFO L82 PathProgramCache]: Analyzing trace with hash 250991359, now seen corresponding path program 1 times [2020-10-05 23:42:34,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:42:34,695 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188641299] [2020-10-05 23:42:34,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:42:34,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:42:34,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:42:34,983 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188641299] [2020-10-05 23:42:34,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:42:34,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-05 23:42:34,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602770066] [2020-10-05 23:42:34,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-05 23:42:34,984 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:42:34,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-05 23:42:34,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:42:34,985 INFO L87 Difference]: Start difference. First operand 544 states and 1615 transitions. Second operand 6 states. [2020-10-05 23:42:35,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:42:35,408 INFO L93 Difference]: Finished difference Result 710 states and 2081 transitions. [2020-10-05 23:42:35,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-05 23:42:35,409 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-10-05 23:42:35,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:42:35,414 INFO L225 Difference]: With dead ends: 710 [2020-10-05 23:42:35,414 INFO L226 Difference]: Without dead ends: 638 [2020-10-05 23:42:35,415 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2020-10-05 23:42:35,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2020-10-05 23:42:35,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 558. [2020-10-05 23:42:35,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 558 states. [2020-10-05 23:42:35,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 1659 transitions. [2020-10-05 23:42:35,437 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 1659 transitions. Word has length 15 [2020-10-05 23:42:35,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:42:35,437 INFO L479 AbstractCegarLoop]: Abstraction has 558 states and 1659 transitions. [2020-10-05 23:42:35,437 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-05 23:42:35,437 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 1659 transitions. [2020-10-05 23:42:35,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-05 23:42:35,439 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:42:35,439 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:42:35,439 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-05 23:42:35,439 INFO L427 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:42:35,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:42:35,440 INFO L82 PathProgramCache]: Analyzing trace with hash 251229687, now seen corresponding path program 1 times [2020-10-05 23:42:35,440 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:42:35,440 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514967098] [2020-10-05 23:42:35,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:42:35,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:42:35,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:42:35,937 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514967098] [2020-10-05 23:42:35,937 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:42:35,937 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-05 23:42:35,937 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100215202] [2020-10-05 23:42:35,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-05 23:42:35,938 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:42:35,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-05 23:42:35,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:42:35,938 INFO L87 Difference]: Start difference. First operand 558 states and 1659 transitions. Second operand 9 states. [2020-10-05 23:42:36,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:42:36,292 INFO L93 Difference]: Finished difference Result 624 states and 1854 transitions. [2020-10-05 23:42:36,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 23:42:36,293 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2020-10-05 23:42:36,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:42:36,299 INFO L225 Difference]: With dead ends: 624 [2020-10-05 23:42:36,299 INFO L226 Difference]: Without dead ends: 624 [2020-10-05 23:42:36,300 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2020-10-05 23:42:36,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2020-10-05 23:42:36,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 576. [2020-10-05 23:42:36,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576 states. [2020-10-05 23:42:36,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 1714 transitions. [2020-10-05 23:42:36,318 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 1714 transitions. Word has length 15 [2020-10-05 23:42:36,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:42:36,320 INFO L479 AbstractCegarLoop]: Abstraction has 576 states and 1714 transitions. [2020-10-05 23:42:36,320 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-05 23:42:36,321 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 1714 transitions. [2020-10-05 23:42:36,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-05 23:42:36,322 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:42:36,322 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:42:36,323 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-05 23:42:36,323 INFO L427 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:42:36,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:42:36,323 INFO L82 PathProgramCache]: Analyzing trace with hash 270007999, now seen corresponding path program 2 times [2020-10-05 23:42:36,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:42:36,324 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643581726] [2020-10-05 23:42:36,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:42:36,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:42:36,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:42:36,422 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643581726] [2020-10-05 23:42:36,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:42:36,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:42:36,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762699616] [2020-10-05 23:42:36,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:42:36,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:42:36,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:42:36,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:42:36,424 INFO L87 Difference]: Start difference. First operand 576 states and 1714 transitions. Second operand 5 states. [2020-10-05 23:42:36,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:42:36,604 INFO L93 Difference]: Finished difference Result 716 states and 2078 transitions. [2020-10-05 23:42:36,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:42:36,605 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-10-05 23:42:36,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:42:36,610 INFO L225 Difference]: With dead ends: 716 [2020-10-05 23:42:36,610 INFO L226 Difference]: Without dead ends: 692 [2020-10-05 23:42:36,611 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:42:36,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2020-10-05 23:42:36,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 560. [2020-10-05 23:42:36,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 560 states. [2020-10-05 23:42:36,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 1650 transitions. [2020-10-05 23:42:36,629 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 1650 transitions. Word has length 15 [2020-10-05 23:42:36,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:42:36,629 INFO L479 AbstractCegarLoop]: Abstraction has 560 states and 1650 transitions. [2020-10-05 23:42:36,629 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:42:36,629 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 1650 transitions. [2020-10-05 23:42:36,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-05 23:42:36,631 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:42:36,631 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:42:36,631 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-05 23:42:36,631 INFO L427 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:42:36,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:42:36,632 INFO L82 PathProgramCache]: Analyzing trace with hash -2101548220, now seen corresponding path program 1 times [2020-10-05 23:42:36,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:42:36,632 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902761589] [2020-10-05 23:42:36,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:42:36,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:42:36,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:42:36,673 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902761589] [2020-10-05 23:42:36,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:42:36,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-05 23:42:36,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970796030] [2020-10-05 23:42:36,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:42:36,675 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:42:36,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:42:36,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:42:36,675 INFO L87 Difference]: Start difference. First operand 560 states and 1650 transitions. Second operand 3 states. [2020-10-05 23:42:36,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:42:36,688 INFO L93 Difference]: Finished difference Result 761 states and 2189 transitions. [2020-10-05 23:42:36,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:42:36,689 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2020-10-05 23:42:36,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:42:36,692 INFO L225 Difference]: With dead ends: 761 [2020-10-05 23:42:36,693 INFO L226 Difference]: Without dead ends: 422 [2020-10-05 23:42:36,693 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:42:36,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2020-10-05 23:42:36,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 410. [2020-10-05 23:42:36,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2020-10-05 23:42:36,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 1117 transitions. [2020-10-05 23:42:36,706 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 1117 transitions. Word has length 15 [2020-10-05 23:42:36,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:42:36,707 INFO L479 AbstractCegarLoop]: Abstraction has 410 states and 1117 transitions. [2020-10-05 23:42:36,707 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:42:36,707 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 1117 transitions. [2020-10-05 23:42:36,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-05 23:42:36,708 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:42:36,708 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:42:36,709 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-05 23:42:36,709 INFO L427 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:42:36,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:42:36,709 INFO L82 PathProgramCache]: Analyzing trace with hash -219687627, now seen corresponding path program 1 times [2020-10-05 23:42:36,709 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:42:36,710 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982270271] [2020-10-05 23:42:36,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:42:36,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:42:37,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:42:37,133 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982270271] [2020-10-05 23:42:37,133 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:42:37,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-05 23:42:37,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756570418] [2020-10-05 23:42:37,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-05 23:42:37,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:42:37,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-05 23:42:37,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:42:37,135 INFO L87 Difference]: Start difference. First operand 410 states and 1117 transitions. Second operand 9 states. [2020-10-05 23:42:37,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:42:37,547 INFO L93 Difference]: Finished difference Result 498 states and 1327 transitions. [2020-10-05 23:42:37,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-05 23:42:37,548 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2020-10-05 23:42:37,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:42:37,553 INFO L225 Difference]: With dead ends: 498 [2020-10-05 23:42:37,553 INFO L226 Difference]: Without dead ends: 468 [2020-10-05 23:42:37,553 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2020-10-05 23:42:37,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2020-10-05 23:42:37,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 404. [2020-10-05 23:42:37,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 404 states. [2020-10-05 23:42:37,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 1101 transitions. [2020-10-05 23:42:37,568 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 1101 transitions. Word has length 16 [2020-10-05 23:42:37,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:42:37,569 INFO L479 AbstractCegarLoop]: Abstraction has 404 states and 1101 transitions. [2020-10-05 23:42:37,569 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-05 23:42:37,569 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 1101 transitions. [2020-10-05 23:42:37,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-05 23:42:37,570 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:42:37,570 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:42:37,571 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-05 23:42:37,571 INFO L427 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:42:37,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:42:37,571 INFO L82 PathProgramCache]: Analyzing trace with hash -1458952055, now seen corresponding path program 2 times [2020-10-05 23:42:37,572 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:42:37,572 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544230377] [2020-10-05 23:42:37,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:42:37,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:42:37,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:42:37,909 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544230377] [2020-10-05 23:42:37,909 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:42:37,909 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:42:37,909 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222666710] [2020-10-05 23:42:37,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:42:37,910 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:42:37,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:42:37,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:42:37,911 INFO L87 Difference]: Start difference. First operand 404 states and 1101 transitions. Second operand 7 states. [2020-10-05 23:42:38,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:42:38,227 INFO L93 Difference]: Finished difference Result 810 states and 2180 transitions. [2020-10-05 23:42:38,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-05 23:42:38,228 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-10-05 23:42:38,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:42:38,233 INFO L225 Difference]: With dead ends: 810 [2020-10-05 23:42:38,233 INFO L226 Difference]: Without dead ends: 655 [2020-10-05 23:42:38,233 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2020-10-05 23:42:38,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2020-10-05 23:42:38,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 448. [2020-10-05 23:42:38,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2020-10-05 23:42:38,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 1211 transitions. [2020-10-05 23:42:38,248 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 1211 transitions. Word has length 16 [2020-10-05 23:42:38,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:42:38,248 INFO L479 AbstractCegarLoop]: Abstraction has 448 states and 1211 transitions. [2020-10-05 23:42:38,248 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:42:38,248 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 1211 transitions. [2020-10-05 23:42:38,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-05 23:42:38,250 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:42:38,250 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:42:38,250 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-05 23:42:38,250 INFO L427 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:42:38,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:42:38,251 INFO L82 PathProgramCache]: Analyzing trace with hash -312762039, now seen corresponding path program 3 times [2020-10-05 23:42:38,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:42:38,251 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293704207] [2020-10-05 23:42:38,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:42:38,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:42:38,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:42:38,445 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293704207] [2020-10-05 23:42:38,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:42:38,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-05 23:42:38,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772743974] [2020-10-05 23:42:38,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-05 23:42:38,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:42:38,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-05 23:42:38,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:42:38,447 INFO L87 Difference]: Start difference. First operand 448 states and 1211 transitions. Second operand 6 states. [2020-10-05 23:42:38,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:42:38,814 INFO L93 Difference]: Finished difference Result 636 states and 1671 transitions. [2020-10-05 23:42:38,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-05 23:42:38,814 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-10-05 23:42:38,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:42:38,818 INFO L225 Difference]: With dead ends: 636 [2020-10-05 23:42:38,819 INFO L226 Difference]: Without dead ends: 546 [2020-10-05 23:42:38,819 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:42:38,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2020-10-05 23:42:38,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 466. [2020-10-05 23:42:38,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2020-10-05 23:42:38,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 1243 transitions. [2020-10-05 23:42:38,832 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 1243 transitions. Word has length 16 [2020-10-05 23:42:38,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:42:38,833 INFO L479 AbstractCegarLoop]: Abstraction has 466 states and 1243 transitions. [2020-10-05 23:42:38,833 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-05 23:42:38,833 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 1243 transitions. [2020-10-05 23:42:38,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-05 23:42:38,834 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:42:38,835 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:42:38,835 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-05 23:42:38,835 INFO L427 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:42:38,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:42:38,835 INFO L82 PathProgramCache]: Analyzing trace with hash -312560229, now seen corresponding path program 4 times [2020-10-05 23:42:38,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:42:38,836 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305014352] [2020-10-05 23:42:38,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:42:38,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:42:39,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:42:39,249 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305014352] [2020-10-05 23:42:39,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:42:39,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-05 23:42:39,250 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663428165] [2020-10-05 23:42:39,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-05 23:42:39,251 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:42:39,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-05 23:42:39,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-10-05 23:42:39,252 INFO L87 Difference]: Start difference. First operand 466 states and 1243 transitions. Second operand 10 states. [2020-10-05 23:42:39,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:42:39,598 INFO L93 Difference]: Finished difference Result 526 states and 1391 transitions. [2020-10-05 23:42:39,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-05 23:42:39,599 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2020-10-05 23:42:39,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:42:39,603 INFO L225 Difference]: With dead ends: 526 [2020-10-05 23:42:39,603 INFO L226 Difference]: Without dead ends: 499 [2020-10-05 23:42:39,605 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2020-10-05 23:42:39,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2020-10-05 23:42:39,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 463. [2020-10-05 23:42:39,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 463 states. [2020-10-05 23:42:39,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 1233 transitions. [2020-10-05 23:42:39,618 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 1233 transitions. Word has length 16 [2020-10-05 23:42:39,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:42:39,618 INFO L479 AbstractCegarLoop]: Abstraction has 463 states and 1233 transitions. [2020-10-05 23:42:39,618 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-05 23:42:39,618 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 1233 transitions. [2020-10-05 23:42:39,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-05 23:42:39,620 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:42:39,620 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:42:39,620 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-05 23:42:39,620 INFO L427 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:42:39,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:42:39,621 INFO L82 PathProgramCache]: Analyzing trace with hash 900355189, now seen corresponding path program 5 times [2020-10-05 23:42:39,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:42:39,624 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596202585] [2020-10-05 23:42:39,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:42:39,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:42:39,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:42:39,939 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596202585] [2020-10-05 23:42:39,941 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:42:39,941 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-05 23:42:39,941 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333300420] [2020-10-05 23:42:39,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-05 23:42:39,942 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:42:39,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-05 23:42:39,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:42:39,944 INFO L87 Difference]: Start difference. First operand 463 states and 1233 transitions. Second operand 6 states. [2020-10-05 23:42:40,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:42:40,041 INFO L93 Difference]: Finished difference Result 515 states and 1345 transitions. [2020-10-05 23:42:40,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-05 23:42:40,042 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-10-05 23:42:40,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:42:40,046 INFO L225 Difference]: With dead ends: 515 [2020-10-05 23:42:40,046 INFO L226 Difference]: Without dead ends: 349 [2020-10-05 23:42:40,047 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:42:40,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2020-10-05 23:42:40,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 331. [2020-10-05 23:42:40,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2020-10-05 23:42:40,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 858 transitions. [2020-10-05 23:42:40,055 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 858 transitions. Word has length 16 [2020-10-05 23:42:40,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:42:40,055 INFO L479 AbstractCegarLoop]: Abstraction has 331 states and 858 transitions. [2020-10-05 23:42:40,055 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-05 23:42:40,055 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 858 transitions. [2020-10-05 23:42:40,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-05 23:42:40,056 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:42:40,057 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:42:40,057 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-05 23:42:40,057 INFO L427 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:42:40,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:42:40,057 INFO L82 PathProgramCache]: Analyzing trace with hash -723485020, now seen corresponding path program 1 times [2020-10-05 23:42:40,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:42:40,058 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884507505] [2020-10-05 23:42:40,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:42:40,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:42:40,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:42:40,131 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884507505] [2020-10-05 23:42:40,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:42:40,132 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:42:40,132 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048000968] [2020-10-05 23:42:40,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-05 23:42:40,132 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:42:40,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-05 23:42:40,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-05 23:42:40,133 INFO L87 Difference]: Start difference. First operand 331 states and 858 transitions. Second operand 4 states. [2020-10-05 23:42:40,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:42:40,166 INFO L93 Difference]: Finished difference Result 311 states and 706 transitions. [2020-10-05 23:42:40,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 23:42:40,167 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2020-10-05 23:42:40,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:42:40,169 INFO L225 Difference]: With dead ends: 311 [2020-10-05 23:42:40,169 INFO L226 Difference]: Without dead ends: 214 [2020-10-05 23:42:40,169 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:42:40,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2020-10-05 23:42:40,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2020-10-05 23:42:40,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2020-10-05 23:42:40,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 462 transitions. [2020-10-05 23:42:40,175 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 462 transitions. Word has length 16 [2020-10-05 23:42:40,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:42:40,175 INFO L479 AbstractCegarLoop]: Abstraction has 214 states and 462 transitions. [2020-10-05 23:42:40,175 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-05 23:42:40,175 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 462 transitions. [2020-10-05 23:42:40,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-05 23:42:40,176 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:42:40,176 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:42:40,176 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-05 23:42:40,176 INFO L427 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:42:40,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:42:40,177 INFO L82 PathProgramCache]: Analyzing trace with hash 233701298, now seen corresponding path program 1 times [2020-10-05 23:42:40,177 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:42:40,177 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004529551] [2020-10-05 23:42:40,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:42:40,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:42:40,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:42:40,251 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004529551] [2020-10-05 23:42:40,251 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:42:40,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-05 23:42:40,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628126768] [2020-10-05 23:42:40,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:42:40,253 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:42:40,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:42:40,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:42:40,253 INFO L87 Difference]: Start difference. First operand 214 states and 462 transitions. Second operand 5 states. [2020-10-05 23:42:40,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:42:40,298 INFO L93 Difference]: Finished difference Result 181 states and 356 transitions. [2020-10-05 23:42:40,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:42:40,298 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-10-05 23:42:40,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:42:40,299 INFO L225 Difference]: With dead ends: 181 [2020-10-05 23:42:40,299 INFO L226 Difference]: Without dead ends: 135 [2020-10-05 23:42:40,300 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:42:40,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2020-10-05 23:42:40,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2020-10-05 23:42:40,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2020-10-05 23:42:40,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 258 transitions. [2020-10-05 23:42:40,303 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 258 transitions. Word has length 17 [2020-10-05 23:42:40,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:42:40,304 INFO L479 AbstractCegarLoop]: Abstraction has 135 states and 258 transitions. [2020-10-05 23:42:40,304 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:42:40,304 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 258 transitions. [2020-10-05 23:42:40,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-05 23:42:40,305 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:42:40,305 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:42:40,305 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-05 23:42:40,305 INFO L427 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:42:40,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:42:40,306 INFO L82 PathProgramCache]: Analyzing trace with hash -499071186, now seen corresponding path program 1 times [2020-10-05 23:42:40,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:42:40,306 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659890462] [2020-10-05 23:42:40,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:42:40,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:42:40,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:42:40,412 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659890462] [2020-10-05 23:42:40,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:42:40,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:42:40,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21559647] [2020-10-05 23:42:40,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-05 23:42:40,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:42:40,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-05 23:42:40,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:42:40,414 INFO L87 Difference]: Start difference. First operand 135 states and 258 transitions. Second operand 6 states. [2020-10-05 23:42:40,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:42:40,488 INFO L93 Difference]: Finished difference Result 123 states and 233 transitions. [2020-10-05 23:42:40,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-05 23:42:40,490 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-10-05 23:42:40,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:42:40,491 INFO L225 Difference]: With dead ends: 123 [2020-10-05 23:42:40,491 INFO L226 Difference]: Without dead ends: 94 [2020-10-05 23:42:40,492 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:42:40,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2020-10-05 23:42:40,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 86. [2020-10-05 23:42:40,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2020-10-05 23:42:40,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 158 transitions. [2020-10-05 23:42:40,495 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 158 transitions. Word has length 19 [2020-10-05 23:42:40,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:42:40,496 INFO L479 AbstractCegarLoop]: Abstraction has 86 states and 158 transitions. [2020-10-05 23:42:40,496 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-05 23:42:40,496 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 158 transitions. [2020-10-05 23:42:40,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:42:40,497 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:42:40,497 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:42:40,497 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-05 23:42:40,497 INFO L427 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:42:40,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:42:40,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1029189765, now seen corresponding path program 1 times [2020-10-05 23:42:40,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:42:40,498 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014616973] [2020-10-05 23:42:40,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:42:40,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:42:40,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:42:40,720 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014616973] [2020-10-05 23:42:40,720 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:42:40,720 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-05 23:42:40,721 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926102949] [2020-10-05 23:42:40,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-05 23:42:40,721 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:42:40,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-05 23:42:40,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:42:40,722 INFO L87 Difference]: Start difference. First operand 86 states and 158 transitions. Second operand 6 states. [2020-10-05 23:42:40,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:42:40,980 INFO L93 Difference]: Finished difference Result 118 states and 213 transitions. [2020-10-05 23:42:40,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-05 23:42:40,981 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-10-05 23:42:40,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:42:40,982 INFO L225 Difference]: With dead ends: 118 [2020-10-05 23:42:40,983 INFO L226 Difference]: Without dead ends: 90 [2020-10-05 23:42:40,983 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:42:40,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2020-10-05 23:42:40,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 86. [2020-10-05 23:42:40,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2020-10-05 23:42:40,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 157 transitions. [2020-10-05 23:42:40,986 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 157 transitions. Word has length 21 [2020-10-05 23:42:40,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:42:40,986 INFO L479 AbstractCegarLoop]: Abstraction has 86 states and 157 transitions. [2020-10-05 23:42:40,986 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-05 23:42:40,987 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 157 transitions. [2020-10-05 23:42:40,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:42:40,987 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:42:40,987 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:42:40,988 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-10-05 23:42:40,988 INFO L427 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:42:40,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:42:40,988 INFO L82 PathProgramCache]: Analyzing trace with hash -1258202069, now seen corresponding path program 2 times [2020-10-05 23:42:40,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:42:40,989 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815644262] [2020-10-05 23:42:40,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:42:41,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:42:41,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:42:41,459 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815644262] [2020-10-05 23:42:41,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:42:41,460 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-05 23:42:41,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828393886] [2020-10-05 23:42:41,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-05 23:42:41,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:42:41,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-05 23:42:41,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2020-10-05 23:42:41,461 INFO L87 Difference]: Start difference. First operand 86 states and 157 transitions. Second operand 11 states. [2020-10-05 23:42:42,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:42:42,142 INFO L93 Difference]: Finished difference Result 107 states and 192 transitions. [2020-10-05 23:42:42,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-05 23:42:42,143 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2020-10-05 23:42:42,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:42:42,144 INFO L225 Difference]: With dead ends: 107 [2020-10-05 23:42:42,144 INFO L226 Difference]: Without dead ends: 93 [2020-10-05 23:42:42,145 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2020-10-05 23:42:42,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-10-05 23:42:42,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2020-10-05 23:42:42,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-10-05 23:42:42,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 164 transitions. [2020-10-05 23:42:42,147 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 164 transitions. Word has length 21 [2020-10-05 23:42:42,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:42:42,148 INFO L479 AbstractCegarLoop]: Abstraction has 91 states and 164 transitions. [2020-10-05 23:42:42,148 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-05 23:42:42,148 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 164 transitions. [2020-10-05 23:42:42,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:42:42,148 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:42:42,148 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:42:42,148 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-10-05 23:42:42,149 INFO L427 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:42:42,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:42:42,149 INFO L82 PathProgramCache]: Analyzing trace with hash -657403903, now seen corresponding path program 3 times [2020-10-05 23:42:42,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:42:42,149 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333244366] [2020-10-05 23:42:42,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:42:42,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:42:42,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:42:42,616 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333244366] [2020-10-05 23:42:42,616 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:42:42,616 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:42:42,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72422817] [2020-10-05 23:42:42,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:42:42,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:42:42,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:42:42,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:42:42,617 INFO L87 Difference]: Start difference. First operand 91 states and 164 transitions. Second operand 7 states. [2020-10-05 23:42:43,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:42:43,162 INFO L93 Difference]: Finished difference Result 117 states and 208 transitions. [2020-10-05 23:42:43,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-05 23:42:43,168 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2020-10-05 23:42:43,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:42:43,169 INFO L225 Difference]: With dead ends: 117 [2020-10-05 23:42:43,169 INFO L226 Difference]: Without dead ends: 85 [2020-10-05 23:42:43,169 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2020-10-05 23:42:43,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2020-10-05 23:42:43,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 77. [2020-10-05 23:42:43,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-10-05 23:42:43,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 137 transitions. [2020-10-05 23:42:43,172 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 137 transitions. Word has length 21 [2020-10-05 23:42:43,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:42:43,172 INFO L479 AbstractCegarLoop]: Abstraction has 77 states and 137 transitions. [2020-10-05 23:42:43,172 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:42:43,172 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 137 transitions. [2020-10-05 23:42:43,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:42:43,173 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:42:43,173 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:42:43,174 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-10-05 23:42:43,174 INFO L427 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:42:43,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:42:43,174 INFO L82 PathProgramCache]: Analyzing trace with hash 769866229, now seen corresponding path program 4 times [2020-10-05 23:42:43,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:42:43,175 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134415167] [2020-10-05 23:42:43,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:42:43,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:42:43,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:42:43,829 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134415167] [2020-10-05 23:42:43,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:42:43,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-05 23:42:43,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806337838] [2020-10-05 23:42:43,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-05 23:42:43,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:42:43,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-05 23:42:43,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2020-10-05 23:42:43,830 INFO L87 Difference]: Start difference. First operand 77 states and 137 transitions. Second operand 11 states. [2020-10-05 23:42:44,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:42:44,637 INFO L93 Difference]: Finished difference Result 88 states and 150 transitions. [2020-10-05 23:42:44,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-05 23:42:44,638 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2020-10-05 23:42:44,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:42:44,638 INFO L225 Difference]: With dead ends: 88 [2020-10-05 23:42:44,638 INFO L226 Difference]: Without dead ends: 72 [2020-10-05 23:42:44,639 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2020-10-05 23:42:44,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-10-05 23:42:44,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2020-10-05 23:42:44,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-10-05 23:42:44,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 122 transitions. [2020-10-05 23:42:44,641 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 122 transitions. Word has length 21 [2020-10-05 23:42:44,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:42:44,642 INFO L479 AbstractCegarLoop]: Abstraction has 71 states and 122 transitions. [2020-10-05 23:42:44,642 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-05 23:42:44,642 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 122 transitions. [2020-10-05 23:42:44,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:42:44,642 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:42:44,643 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:42:44,643 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-10-05 23:42:44,643 INFO L427 AbstractCegarLoop]: === Iteration 26 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:42:44,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:42:44,643 INFO L82 PathProgramCache]: Analyzing trace with hash 497450945, now seen corresponding path program 5 times [2020-10-05 23:42:44,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:42:44,644 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566306712] [2020-10-05 23:42:44,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:42:44,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:42:44,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:42:44,949 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566306712] [2020-10-05 23:42:44,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:42:44,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-05 23:42:44,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637458367] [2020-10-05 23:42:44,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-05 23:42:44,950 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:42:44,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-05 23:42:44,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2020-10-05 23:42:44,950 INFO L87 Difference]: Start difference. First operand 71 states and 122 transitions. Second operand 11 states. [2020-10-05 23:42:45,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:42:45,473 INFO L93 Difference]: Finished difference Result 93 states and 156 transitions. [2020-10-05 23:42:45,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-05 23:42:45,474 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2020-10-05 23:42:45,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:42:45,475 INFO L225 Difference]: With dead ends: 93 [2020-10-05 23:42:45,475 INFO L226 Difference]: Without dead ends: 70 [2020-10-05 23:42:45,475 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2020-10-05 23:42:45,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-10-05 23:42:45,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2020-10-05 23:42:45,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-10-05 23:42:45,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 113 transitions. [2020-10-05 23:42:45,478 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 113 transitions. Word has length 21 [2020-10-05 23:42:45,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:42:45,478 INFO L479 AbstractCegarLoop]: Abstraction has 68 states and 113 transitions. [2020-10-05 23:42:45,478 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-05 23:42:45,478 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 113 transitions. [2020-10-05 23:42:45,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:42:45,479 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:42:45,479 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:42:45,479 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-10-05 23:42:45,479 INFO L427 AbstractCegarLoop]: === Iteration 27 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:42:45,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:42:45,480 INFO L82 PathProgramCache]: Analyzing trace with hash -1830146245, now seen corresponding path program 6 times [2020-10-05 23:42:45,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:42:45,480 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299802900] [2020-10-05 23:42:45,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:42:45,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:42:45,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:42:45,737 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299802900] [2020-10-05 23:42:45,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:42:45,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:42:45,737 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991363421] [2020-10-05 23:42:45,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:42:45,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:42:45,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:42:45,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:42:45,738 INFO L87 Difference]: Start difference. First operand 68 states and 113 transitions. Second operand 7 states. [2020-10-05 23:42:45,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:42:45,939 INFO L93 Difference]: Finished difference Result 90 states and 147 transitions. [2020-10-05 23:42:45,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-05 23:42:45,940 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2020-10-05 23:42:45,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:42:45,940 INFO L225 Difference]: With dead ends: 90 [2020-10-05 23:42:45,940 INFO L226 Difference]: Without dead ends: 62 [2020-10-05 23:42:45,941 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-05 23:42:45,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2020-10-05 23:42:45,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2020-10-05 23:42:45,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-10-05 23:42:45,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 101 transitions. [2020-10-05 23:42:45,944 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 101 transitions. Word has length 21 [2020-10-05 23:42:45,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:42:45,944 INFO L479 AbstractCegarLoop]: Abstraction has 62 states and 101 transitions. [2020-10-05 23:42:45,944 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:42:45,944 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 101 transitions. [2020-10-05 23:42:45,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:42:45,945 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:42:45,945 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:42:45,945 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-10-05 23:42:45,945 INFO L427 AbstractCegarLoop]: === Iteration 28 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:42:45,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:42:45,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1310019483, now seen corresponding path program 7 times [2020-10-05 23:42:45,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:42:45,946 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584590737] [2020-10-05 23:42:45,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:42:45,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:42:46,516 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 23 [2020-10-05 23:42:46,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:42:46,938 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584590737] [2020-10-05 23:42:46,939 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:42:46,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-05 23:42:46,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512583899] [2020-10-05 23:42:46,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-05 23:42:46,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:42:46,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-05 23:42:46,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2020-10-05 23:42:46,940 INFO L87 Difference]: Start difference. First operand 62 states and 101 transitions. Second operand 13 states. [2020-10-05 23:42:47,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:42:47,821 INFO L93 Difference]: Finished difference Result 105 states and 178 transitions. [2020-10-05 23:42:47,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-05 23:42:47,822 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 21 [2020-10-05 23:42:47,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:42:47,823 INFO L225 Difference]: With dead ends: 105 [2020-10-05 23:42:47,823 INFO L226 Difference]: Without dead ends: 59 [2020-10-05 23:42:47,824 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2020-10-05 23:42:47,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-10-05 23:42:47,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 50. [2020-10-05 23:42:47,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-10-05 23:42:47,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 78 transitions. [2020-10-05 23:42:47,827 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 78 transitions. Word has length 21 [2020-10-05 23:42:47,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:42:47,828 INFO L479 AbstractCegarLoop]: Abstraction has 50 states and 78 transitions. [2020-10-05 23:42:47,828 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-05 23:42:47,828 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 78 transitions. [2020-10-05 23:42:47,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:42:47,828 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:42:47,828 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:42:47,829 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-10-05 23:42:47,829 INFO L427 AbstractCegarLoop]: === Iteration 29 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:42:47,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:42:47,829 INFO L82 PathProgramCache]: Analyzing trace with hash -2042720303, now seen corresponding path program 8 times [2020-10-05 23:42:47,829 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:42:47,829 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019779955] [2020-10-05 23:42:47,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:42:47,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:42:47,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:42:47,932 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019779955] [2020-10-05 23:42:47,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:42:47,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-05 23:42:47,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192055905] [2020-10-05 23:42:47,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:42:47,933 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:42:47,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:42:47,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:42:47,933 INFO L87 Difference]: Start difference. First operand 50 states and 78 transitions. Second operand 5 states. [2020-10-05 23:42:48,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:42:48,079 INFO L93 Difference]: Finished difference Result 74 states and 119 transitions. [2020-10-05 23:42:48,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 23:42:48,080 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2020-10-05 23:42:48,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:42:48,081 INFO L225 Difference]: With dead ends: 74 [2020-10-05 23:42:48,081 INFO L226 Difference]: Without dead ends: 47 [2020-10-05 23:42:48,081 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:42:48,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-10-05 23:42:48,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2020-10-05 23:42:48,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-10-05 23:42:48,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 72 transitions. [2020-10-05 23:42:48,083 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 72 transitions. Word has length 21 [2020-10-05 23:42:48,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:42:48,083 INFO L479 AbstractCegarLoop]: Abstraction has 47 states and 72 transitions. [2020-10-05 23:42:48,083 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:42:48,083 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 72 transitions. [2020-10-05 23:42:48,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:42:48,084 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:42:48,084 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:42:48,084 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-10-05 23:42:48,084 INFO L427 AbstractCegarLoop]: === Iteration 30 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:42:48,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:42:48,085 INFO L82 PathProgramCache]: Analyzing trace with hash -754656493, now seen corresponding path program 9 times [2020-10-05 23:42:48,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:42:48,085 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738596187] [2020-10-05 23:42:48,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:42:48,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:42:48,397 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 33 [2020-10-05 23:42:48,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:42:48,513 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738596187] [2020-10-05 23:42:48,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:42:48,514 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:42:48,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832967342] [2020-10-05 23:42:48,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:42:48,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:42:48,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:42:48,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:42:48,516 INFO L87 Difference]: Start difference. First operand 47 states and 72 transitions. Second operand 7 states. [2020-10-05 23:42:48,656 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 30 [2020-10-05 23:42:48,771 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 29 [2020-10-05 23:42:49,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:42:49,082 INFO L93 Difference]: Finished difference Result 61 states and 94 transitions. [2020-10-05 23:42:49,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-05 23:42:49,083 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2020-10-05 23:42:49,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:42:49,084 INFO L225 Difference]: With dead ends: 61 [2020-10-05 23:42:49,084 INFO L226 Difference]: Without dead ends: 37 [2020-10-05 23:42:49,085 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2020-10-05 23:42:49,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-10-05 23:42:49,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-10-05 23:42:49,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-10-05 23:42:49,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 55 transitions. [2020-10-05 23:42:49,087 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 55 transitions. Word has length 21 [2020-10-05 23:42:49,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:42:49,087 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 55 transitions. [2020-10-05 23:42:49,088 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:42:49,088 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 55 transitions. [2020-10-05 23:42:49,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:42:49,088 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:42:49,089 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:42:49,089 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-10-05 23:42:49,089 INFO L427 AbstractCegarLoop]: === Iteration 31 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:42:49,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:42:49,090 INFO L82 PathProgramCache]: Analyzing trace with hash 559176997, now seen corresponding path program 10 times [2020-10-05 23:42:49,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:42:49,090 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410032272] [2020-10-05 23:42:49,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:42:49,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 23:42:49,176 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 23:42:49,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 23:42:49,380 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 23:42:49,431 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-05 23:42:49,432 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-10-05 23:42:49,432 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-10-05 23:42:49,433 WARN L633 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-05 23:42:49,451 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1649] [1649] L3-->L854: Formula: (let ((.cse7 (= (mod ~x$r_buff1_thd0~0_In-846658571 256) 0)) (.cse6 (= (mod ~x$w_buff1_used~0_In-846658571 256) 0)) (.cse9 (= (mod ~x$w_buff0_used~0_In-846658571 256) 0)) (.cse8 (= (mod ~x$r_buff0_thd0~0_In-846658571 256) 0))) (let ((.cse1 (not .cse8)) (.cse2 (not .cse9)) (.cse0 (or .cse8 .cse9)) (.cse4 (not .cse6)) (.cse5 (not .cse7)) (.cse3 (or .cse6 .cse7))) (and (= ~x$r_buff0_thd0~0_Out-846658571 ~x$r_buff0_thd0~0_In-846658571) (= ~x$r_buff1_thd0~0_Out-846658571 ~x$r_buff1_thd0~0_In-846658571) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-846658571 0)) (= ULTIMATE.start_assume_abort_if_not_~cond_Out-846658571 |ULTIMATE.start_assume_abort_if_not_#in~cond_In-846658571|) (or (and (= ~x$w_buff0_used~0_In-846658571 ~x$w_buff0_used~0_Out-846658571) .cse0) (and .cse1 .cse2 (= ~x$w_buff0_used~0_Out-846658571 0))) (or (and .cse1 .cse2 (= ~x$w_buff0~0_In-846658571 ~x~0_Out-846658571)) (and (or (and .cse3 (= ~x~0_In-846658571 ~x~0_Out-846658571)) (and .cse4 (= ~x~0_Out-846658571 ~x$w_buff1~0_In-846658571) .cse5)) .cse0)) (or (and .cse4 .cse5 (= ~x$w_buff1_used~0_Out-846658571 0)) (and (= ~x$w_buff1_used~0_In-846658571 ~x$w_buff1_used~0_Out-846658571) .cse3))))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-846658571, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-846658571, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-846658571|, ~x$w_buff1~0=~x$w_buff1~0_In-846658571, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-846658571, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-846658571, ~x~0=~x~0_In-846658571, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-846658571} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-846658571, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_Out-846658571, ~x$w_buff1~0=~x$w_buff1~0_In-846658571, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out-846658571, ULTIMATE.start_main_#t~ite69=|ULTIMATE.start_main_#t~ite69_Out-846658571|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out-846658571, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out-846658571, ULTIMATE.start_main_#t~ite73=|ULTIMATE.start_main_#t~ite73_Out-846658571|, ULTIMATE.start_main_#t~ite74=|ULTIMATE.start_main_#t~ite74_Out-846658571|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-846658571|, ULTIMATE.start_main_#t~ite71=|ULTIMATE.start_main_#t~ite71_Out-846658571|, ULTIMATE.start_main_#t~ite72=|ULTIMATE.start_main_#t~ite72_Out-846658571|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-846658571, ULTIMATE.start_main_#t~ite70=|ULTIMATE.start_main_#t~ite70_Out-846658571|, ~x~0=~x~0_Out-846658571} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite73, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite74, ULTIMATE.start_main_#t~ite71, ULTIMATE.start_main_#t~ite72, ULTIMATE.start_assume_abort_if_not_~cond, ULTIMATE.start_main_#t~ite70, ~x$w_buff1_used~0, ULTIMATE.start_main_#t~ite69, ~x$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0] because there is no mapped edge [2020-10-05 23:42:49,464 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:42:49,465 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:49,467 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:42:49,467 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:49,468 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:42:49,468 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:49,468 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:42:49,468 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:49,469 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:42:49,469 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:49,469 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:42:49,469 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:49,470 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:42:49,470 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:49,470 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:42:49,470 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:49,471 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:42:49,471 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:49,471 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:42:49,471 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:49,472 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:42:49,472 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:49,472 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:42:49,472 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:49,472 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:42:49,472 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:49,473 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:42:49,473 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:49,473 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:42:49,474 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:49,474 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:42:49,474 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:49,474 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:42:49,474 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:49,475 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:42:49,475 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:49,479 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:42:49,479 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:49,480 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:42:49,480 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:49,480 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:42:49,480 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:49,480 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:42:49,481 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:49,481 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:42:49,481 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:49,481 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:42:49,481 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:49,481 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:42:49,481 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:49,482 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:42:49,482 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:49,482 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:42:49,482 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:49,482 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:42:49,482 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:49,483 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:42:49,483 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:49,483 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:42:49,483 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:49,483 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:42:49,483 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:49,483 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:42:49,484 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:49,484 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:42:49,484 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:49,484 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:42:49,484 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:49,484 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:42:49,484 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:49,485 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:42:49,485 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:49,485 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:42:49,486 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:49,486 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:42:49,486 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:49,486 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:42:49,486 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:49,486 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:42:49,487 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:49,487 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:42:49,487 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:49,487 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:42:49,487 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:49,487 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:42:49,487 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:49,488 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:42:49,488 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:49,488 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:42:49,488 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:49,488 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:42:49,489 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:49,489 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:42:49,489 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:49,489 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:42:49,489 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:49,489 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:42:49,489 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:49,490 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:42:49,490 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:49,490 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:42:49,490 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:49,490 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:42:49,490 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:49,490 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:42:49,491 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:49,491 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:42:49,491 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:49,491 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:42:49,491 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:49,491 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:42:49,491 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:49,492 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:42:49,492 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:49,567 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.10 11:42:49 BasicIcfg [2020-10-05 23:42:49,567 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-05 23:42:49,569 INFO L168 Benchmark]: Toolchain (without parser) took 30987.29 ms. Allocated memory was 147.3 MB in the beginning and 529.5 MB in the end (delta: 382.2 MB). Free memory was 100.9 MB in the beginning and 449.0 MB in the end (delta: -348.1 MB). Peak memory consumption was 396.6 MB. Max. memory is 7.1 GB. [2020-10-05 23:42:49,570 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 147.3 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-10-05 23:42:49,570 INFO L168 Benchmark]: CACSL2BoogieTranslator took 813.67 ms. Allocated memory was 147.3 MB in the beginning and 203.9 MB in the end (delta: 56.6 MB). Free memory was 100.7 MB in the beginning and 152.2 MB in the end (delta: -51.5 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. [2020-10-05 23:42:49,571 INFO L168 Benchmark]: Boogie Procedure Inliner took 77.76 ms. Allocated memory is still 203.9 MB. Free memory was 152.2 MB in the beginning and 149.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2020-10-05 23:42:49,571 INFO L168 Benchmark]: Boogie Preprocessor took 56.14 ms. Allocated memory is still 203.9 MB. Free memory was 149.5 MB in the beginning and 146.3 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2020-10-05 23:42:49,572 INFO L168 Benchmark]: RCFGBuilder took 3791.99 ms. Allocated memory was 203.9 MB in the beginning and 288.9 MB in the end (delta: 84.9 MB). Free memory was 146.3 MB in the beginning and 244.1 MB in the end (delta: -97.8 MB). Peak memory consumption was 101.1 MB. Max. memory is 7.1 GB. [2020-10-05 23:42:49,572 INFO L168 Benchmark]: TraceAbstraction took 26242.24 ms. Allocated memory was 288.9 MB in the beginning and 529.5 MB in the end (delta: 240.6 MB). Free memory was 241.2 MB in the beginning and 449.0 MB in the end (delta: -207.8 MB). Peak memory consumption was 395.3 MB. Max. memory is 7.1 GB. [2020-10-05 23:42:49,575 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 147.3 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 813.67 ms. Allocated memory was 147.3 MB in the beginning and 203.9 MB in the end (delta: 56.6 MB). Free memory was 100.7 MB in the beginning and 152.2 MB in the end (delta: -51.5 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 77.76 ms. Allocated memory is still 203.9 MB. Free memory was 152.2 MB in the beginning and 149.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 56.14 ms. Allocated memory is still 203.9 MB. Free memory was 149.5 MB in the beginning and 146.3 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3791.99 ms. Allocated memory was 203.9 MB in the beginning and 288.9 MB in the end (delta: 84.9 MB). Free memory was 146.3 MB in the beginning and 244.1 MB in the end (delta: -97.8 MB). Peak memory consumption was 101.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 26242.24 ms. Allocated memory was 288.9 MB in the beginning and 529.5 MB in the end (delta: 240.6 MB). Free memory was 241.2 MB in the beginning and 449.0 MB in the end (delta: -207.8 MB). Peak memory consumption was 395.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 7.7s, 100 ProgramPointsBefore, 36 ProgramPointsAfterwards, 92 TransitionsBefore, 26 TransitionsAfterwards, 1624 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 35 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 2 ChoiceCompositions, 801 VarBasedMoverChecksPositive, 39 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 4118 CheckedPairsTotal, 74 TotalNumberOfCompositions - CounterExampleResult [Line: 8]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L699] 0 int __unbuffered_cnt = 0; [L701] 0 int __unbuffered_p0_EAX = 0; [L703] 0 int __unbuffered_p1_EAX = 0; [L704] 0 _Bool main$tmp_guard0; [L705] 0 _Bool main$tmp_guard1; [L707] 0 int x = 0; [L708] 0 _Bool x$flush_delayed; [L709] 0 int x$mem_tmp; [L710] 0 _Bool x$r_buff0_thd0; [L711] 0 _Bool x$r_buff0_thd1; [L712] 0 _Bool x$r_buff0_thd2; [L713] 0 _Bool x$r_buff0_thd3; [L714] 0 _Bool x$r_buff1_thd0; [L715] 0 _Bool x$r_buff1_thd1; [L716] 0 _Bool x$r_buff1_thd2; [L717] 0 _Bool x$r_buff1_thd3; [L718] 0 _Bool x$read_delayed; [L719] 0 int *x$read_delayed_var; [L720] 0 int x$w_buff0; [L721] 0 _Bool x$w_buff0_used; [L722] 0 int x$w_buff1; [L723] 0 _Bool x$w_buff1_used; [L725] 0 int y = 0; [L726] 0 _Bool weak$$choice0; [L727] 0 _Bool weak$$choice2; [L838] 0 pthread_t t2549; [L839] FCALL, FORK 0 pthread_create(&t2549, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L840] 0 pthread_t t2550; [L841] FCALL, FORK 0 pthread_create(&t2550, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L842] 0 pthread_t t2551; [L843] FCALL, FORK 0 pthread_create(&t2551, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L801] 3 x$w_buff1 = x$w_buff0 [L802] 3 x$w_buff0 = 2 [L803] 3 x$w_buff1_used = x$w_buff0_used [L804] 3 x$w_buff0_used = (_Bool)1 [L8] COND FALSE 3 !(!expression) [L806] 3 x$r_buff1_thd0 = x$r_buff0_thd0 [L807] 3 x$r_buff1_thd1 = x$r_buff0_thd1 [L808] 3 x$r_buff1_thd2 = x$r_buff0_thd2 [L809] 3 x$r_buff1_thd3 = x$r_buff0_thd3 [L810] 3 x$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L813] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L731] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L736] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L737] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L738] 1 x$flush_delayed = weak$$choice2 [L739] 1 x$mem_tmp = x [L740] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L740] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1 [L740] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L740] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L741] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L741] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L742] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L742] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L743] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L743] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L744] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L744] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L745] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L745] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1) [L745] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L745] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1) [L745] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L745] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L746] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L746] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L746] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L746] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L747] 1 __unbuffered_p0_EAX = x [L748] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L748] 1 x = x$flush_delayed ? x$mem_tmp : x [L749] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L756] 1 return 0; [L761] 2 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L764] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L764] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L764] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L764] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L765] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L765] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L766] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L766] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L767] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L767] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L768] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L768] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L771] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L772] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L773] 2 x$flush_delayed = weak$$choice2 [L774] 2 x$mem_tmp = x [L775] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L775] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L776] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L776] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0) [L776] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L776] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L777] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L777] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1) [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1 [L777] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1) [L777] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L777] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L778] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L778] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used) [L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L778] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used) [L778] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L778] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L779] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L779] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L780] EXPR 2 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L780] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2) [L780] EXPR 2 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L780] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L781] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L781] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L782] 2 __unbuffered_p1_EAX = x [L783] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L783] 2 x = x$flush_delayed ? x$mem_tmp : x [L784] 2 x$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L816] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L816] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L817] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L817] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L818] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L818] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L819] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L819] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L820] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L820] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L823] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L825] 3 return 0; [L787] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L787] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L787] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L787] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L788] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L788] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L789] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L789] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L790] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L790] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L791] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L791] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L794] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L796] 2 return 0; [L845] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L856] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L857] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L858] 0 x$flush_delayed = weak$$choice2 [L859] 0 x$mem_tmp = x [L860] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L860] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1 [L860] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L860] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L861] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L861] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L862] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L862] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L862] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L862] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L863] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L863] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L863] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L863] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L864] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L864] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L865] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L865] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L866] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L866] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L866] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L866] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L867] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1) [L868] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L868] 0 x = x$flush_delayed ? x$mem_tmp : x [L869] 0 x$flush_delayed = (_Bool)0 [L8] COND TRUE 0 !expression [L8] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 91 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 25.8s, OverallIterations: 31, TraceHistogramMax: 1, AutomataDifference: 8.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.8s, HoareTripleCheckerStatistics: 602 SDtfs, 876 SDslu, 1288 SDs, 0 SdLazy, 1982 SolverSat, 536 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 222 GetRequests, 17 SyntacticMatches, 4 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 7.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=778occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 30 MinimizatonAttempts, 879 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 6.6s InterpolantComputationTime, 504 NumberOfCodeBlocks, 504 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 453 ConstructedInterpolants, 0 QuantifiedInterpolants, 113318 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 30 InterpolantComputations, 30 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...