/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/safe029_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-b09bf87 [2020-10-16 12:11:13,125 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 12:11:13,128 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 12:11:13,174 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 12:11:13,174 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 12:11:13,182 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 12:11:13,183 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 12:11:13,186 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 12:11:13,189 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 12:11:13,190 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 12:11:13,191 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 12:11:13,192 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 12:11:13,194 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 12:11:13,196 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 12:11:13,198 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 12:11:13,199 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 12:11:13,201 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 12:11:13,203 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 12:11:13,205 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 12:11:13,211 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 12:11:13,215 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 12:11:13,218 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 12:11:13,219 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 12:11:13,221 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 12:11:13,223 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 12:11:13,230 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 12:11:13,230 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 12:11:13,231 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 12:11:13,232 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 12:11:13,236 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 12:11:13,236 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 12:11:13,237 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 12:11:13,238 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 12:11:13,238 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 12:11:13,240 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 12:11:13,241 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 12:11:13,241 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 12:11:13,241 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 12:11:13,242 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 12:11:13,243 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 12:11:13,244 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 12:11:13,244 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf [2020-10-16 12:11:13,284 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 12:11:13,285 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 12:11:13,286 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 12:11:13,286 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 12:11:13,287 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 12:11:13,287 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 12:11:13,287 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 12:11:13,287 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 12:11:13,288 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 12:11:13,288 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 12:11:13,288 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 12:11:13,288 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 12:11:13,288 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 12:11:13,288 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 12:11:13,289 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 12:11:13,289 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 12:11:13,289 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 12:11:13,289 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 12:11:13,290 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 12:11:13,290 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 12:11:13,290 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 12:11:13,290 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 12:11:13,290 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 12:11:13,291 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-16 12:11:13,291 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 12:11:13,291 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 12:11:13,291 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 12:11:13,291 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-16 12:11:13,291 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-16 12:11:13,557 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 12:11:13,573 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 12:11:13,578 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 12:11:13,580 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 12:11:13,580 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 12:11:13,581 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe029_power.opt.i [2020-10-16 12:11:13,643 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/0923476f1/f3011fe06595461689cec66cb08e6785/FLAG96bf166e2 [2020-10-16 12:11:14,231 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 12:11:14,232 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/pthread-wmm/safe029_power.opt.i [2020-10-16 12:11:14,247 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/0923476f1/f3011fe06595461689cec66cb08e6785/FLAG96bf166e2 [2020-10-16 12:11:14,477 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/0923476f1/f3011fe06595461689cec66cb08e6785 [2020-10-16 12:11:14,487 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 12:11:14,489 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 12:11:14,490 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 12:11:14,490 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 12:11:14,494 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 12:11:14,495 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 12:11:14" (1/1) ... [2020-10-16 12:11:14,498 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69ca0ba1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:11:14, skipping insertion in model container [2020-10-16 12:11:14,499 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 12:11:14" (1/1) ... [2020-10-16 12:11:14,506 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 12:11:14,573 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 12:11:15,104 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 12:11:15,120 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 12:11:15,179 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 12:11:15,274 INFO L208 MainTranslator]: Completed translation [2020-10-16 12:11:15,276 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:11:15 WrapperNode [2020-10-16 12:11:15,276 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 12:11:15,278 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 12:11:15,278 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 12:11:15,279 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 12:11:15,287 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:11:15" (1/1) ... [2020-10-16 12:11:15,309 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:11:15" (1/1) ... [2020-10-16 12:11:15,348 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 12:11:15,349 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 12:11:15,349 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 12:11:15,349 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 12:11:15,360 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:11:15" (1/1) ... [2020-10-16 12:11:15,361 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:11:15" (1/1) ... [2020-10-16 12:11:15,365 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:11:15" (1/1) ... [2020-10-16 12:11:15,365 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:11:15" (1/1) ... [2020-10-16 12:11:15,375 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:11:15" (1/1) ... [2020-10-16 12:11:15,379 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:11:15" (1/1) ... [2020-10-16 12:11:15,383 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:11:15" (1/1) ... [2020-10-16 12:11:15,389 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 12:11:15,389 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 12:11:15,389 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 12:11:15,390 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 12:11:15,391 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:11:15" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/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-16 12:11:15,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 12:11:15,485 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 12:11:15,486 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 12:11:15,486 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 12:11:15,486 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 12:11:15,486 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 12:11:15,486 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 12:11:15,487 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 12:11:15,487 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 12:11:15,487 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 12:11:15,487 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 12:11:15,489 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-16 12:11:17,380 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 12:11:17,380 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 12:11:17,382 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 12:11:17 BoogieIcfgContainer [2020-10-16 12:11:17,383 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 12:11:17,384 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 12:11:17,384 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 12:11:17,387 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 12:11:17,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 12:11:14" (1/3) ... [2020-10-16 12:11:17,389 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21a43051 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 12:11:17, skipping insertion in model container [2020-10-16 12:11:17,389 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:11:15" (2/3) ... [2020-10-16 12:11:17,389 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21a43051 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 12:11:17, skipping insertion in model container [2020-10-16 12:11:17,389 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 12:11:17" (3/3) ... [2020-10-16 12:11:17,391 INFO L111 eAbstractionObserver]: Analyzing ICFG safe029_power.opt.i [2020-10-16 12:11:17,403 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-16 12:11:17,403 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-16 12:11:17,411 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 12:11:17,412 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 12:11:17,438 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:17,438 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:17,439 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:17,439 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:17,439 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:17,439 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:17,440 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:17,440 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:17,440 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:17,440 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:17,440 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:17,441 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:17,441 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:17,442 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:17,442 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:17,442 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:17,442 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:17,442 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:17,443 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:17,443 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:17,443 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:17,443 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:17,443 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:17,444 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:17,444 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:17,444 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:17,444 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:17,444 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:17,445 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:17,445 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:17,449 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:17,449 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:17,449 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:17,450 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:17,450 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:17,450 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:17,450 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:17,451 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:17,451 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:17,451 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:17,455 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:17,455 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:17,455 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:17,456 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:17,456 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:17,456 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:17,456 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:17,456 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:17,457 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:17,457 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:17,457 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:17,457 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:17,461 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-16 12:11:17,475 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-10-16 12:11:17,497 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 12:11:17,497 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-16 12:11:17,497 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-16 12:11:17,497 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 12:11:17,498 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 12:11:17,498 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 12:11:17,498 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 12:11:17,498 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 12:11:17,512 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-16 12:11:17,512 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 74 transitions, 158 flow [2020-10-16 12:11:17,515 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 74 transitions, 158 flow [2020-10-16 12:11:17,517 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 79 places, 74 transitions, 158 flow [2020-10-16 12:11:17,558 INFO L129 PetriNetUnfolder]: 2/72 cut-off events. [2020-10-16 12:11:17,558 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 12:11:17,562 INFO L80 FinitePrefix]: Finished finitePrefix Result has 79 conditions, 72 events. 2/72 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 47 event pairs, 0 based on Foata normal form. 0/68 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2020-10-16 12:11:17,565 INFO L117 LiptonReduction]: Number of co-enabled transitions 888 [2020-10-16 12:11:18,090 WARN L193 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-16 12:11:18,213 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-10-16 12:11:19,627 WARN L193 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 224 DAG size of output: 184 [2020-10-16 12:11:19,660 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 2, 1] term [2020-10-16 12:11:19,660 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:11:19,664 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-16 12:11:19,664 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:11:20,374 WARN L193 SmtUtils]: Spent 687.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 119 [2020-10-16 12:11:21,342 WARN L193 SmtUtils]: Spent 674.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 115 [2020-10-16 12:11:21,649 WARN L193 SmtUtils]: Spent 304.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2020-10-16 12:11:22,273 WARN L193 SmtUtils]: Spent 621.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 106 [2020-10-16 12:11:22,554 WARN L193 SmtUtils]: Spent 278.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2020-10-16 12:11:23,093 WARN L193 SmtUtils]: Spent 332.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2020-10-16 12:11:23,425 WARN L193 SmtUtils]: Spent 328.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2020-10-16 12:11:23,860 WARN L193 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 77 [2020-10-16 12:11:23,987 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2020-10-16 12:11:23,993 INFO L132 LiptonReduction]: Checked pairs total: 2263 [2020-10-16 12:11:23,993 INFO L134 LiptonReduction]: Total number of compositions: 65 [2020-10-16 12:11:24,005 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 26 places, 19 transitions, 48 flow [2020-10-16 12:11:24,045 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 162 states. [2020-10-16 12:11:24,051 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states. [2020-10-16 12:11:24,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-10-16 12:11:24,061 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:11:24,062 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-10-16 12:11:24,063 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:11:24,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:11:24,069 INFO L82 PathProgramCache]: Analyzing trace with hash 859717262, now seen corresponding path program 1 times [2020-10-16 12:11:24,079 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:11:24,080 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760309850] [2020-10-16 12:11:24,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:11:24,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:11:24,298 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-16 12:11:24,299 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760309850] [2020-10-16 12:11:24,300 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:11:24,300 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 12:11:24,301 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225768183] [2020-10-16 12:11:24,307 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:11:24,307 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:11:24,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:11:24,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:11:24,326 INFO L87 Difference]: Start difference. First operand 162 states. Second operand 3 states. [2020-10-16 12:11:24,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:11:24,405 INFO L93 Difference]: Finished difference Result 137 states and 320 transitions. [2020-10-16 12:11:24,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:11:24,408 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-10-16 12:11:24,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:11:24,420 INFO L225 Difference]: With dead ends: 137 [2020-10-16 12:11:24,421 INFO L226 Difference]: Without dead ends: 112 [2020-10-16 12:11:24,422 INFO L677 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-16 12:11:24,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-10-16 12:11:24,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2020-10-16 12:11:24,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-10-16 12:11:24,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 255 transitions. [2020-10-16 12:11:24,473 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 255 transitions. Word has length 5 [2020-10-16 12:11:24,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:11:24,474 INFO L481 AbstractCegarLoop]: Abstraction has 112 states and 255 transitions. [2020-10-16 12:11:24,474 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:11:24,474 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 255 transitions. [2020-10-16 12:11:24,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-10-16 12:11:24,475 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:11:24,475 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:11:24,475 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 12:11:24,475 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:11:24,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:11:24,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1554625103, now seen corresponding path program 1 times [2020-10-16 12:11:24,476 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:11:24,476 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093201948] [2020-10-16 12:11:24,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:11:24,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:11:24,711 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-16 12:11:24,712 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093201948] [2020-10-16 12:11:24,712 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:11:24,712 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 12:11:24,712 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140063212] [2020-10-16 12:11:24,714 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 12:11:24,714 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:11:24,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 12:11:24,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-16 12:11:24,715 INFO L87 Difference]: Start difference. First operand 112 states and 255 transitions. Second operand 4 states. [2020-10-16 12:11:24,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:11:24,762 INFO L93 Difference]: Finished difference Result 111 states and 252 transitions. [2020-10-16 12:11:24,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:11:24,764 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-10-16 12:11:24,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:11:24,765 INFO L225 Difference]: With dead ends: 111 [2020-10-16 12:11:24,765 INFO L226 Difference]: Without dead ends: 111 [2020-10-16 12:11:24,766 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-16 12:11:24,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2020-10-16 12:11:24,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2020-10-16 12:11:24,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2020-10-16 12:11:24,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 252 transitions. [2020-10-16 12:11:24,778 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 252 transitions. Word has length 7 [2020-10-16 12:11:24,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:11:24,779 INFO L481 AbstractCegarLoop]: Abstraction has 111 states and 252 transitions. [2020-10-16 12:11:24,779 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 12:11:24,779 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 252 transitions. [2020-10-16 12:11:24,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-10-16 12:11:24,780 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:11:24,780 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:11:24,780 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 12:11:24,780 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:11:24,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:11:24,781 INFO L82 PathProgramCache]: Analyzing trace with hash 948719512, now seen corresponding path program 1 times [2020-10-16 12:11:24,781 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:11:24,781 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385226786] [2020-10-16 12:11:24,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:11:24,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:11:24,863 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-16 12:11:24,864 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385226786] [2020-10-16 12:11:24,864 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:11:24,864 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 12:11:24,864 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886341977] [2020-10-16 12:11:24,865 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:11:24,865 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:11:24,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:11:24,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:11:24,866 INFO L87 Difference]: Start difference. First operand 111 states and 252 transitions. Second operand 3 states. [2020-10-16 12:11:24,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:11:24,880 INFO L93 Difference]: Finished difference Result 110 states and 249 transitions. [2020-10-16 12:11:24,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:11:24,885 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2020-10-16 12:11:24,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:11:24,887 INFO L225 Difference]: With dead ends: 110 [2020-10-16 12:11:24,887 INFO L226 Difference]: Without dead ends: 110 [2020-10-16 12:11:24,887 INFO L677 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-16 12:11:24,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2020-10-16 12:11:24,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2020-10-16 12:11:24,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2020-10-16 12:11:24,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 249 transitions. [2020-10-16 12:11:24,904 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 249 transitions. Word has length 8 [2020-10-16 12:11:24,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:11:24,904 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 249 transitions. [2020-10-16 12:11:24,904 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:11:24,904 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 249 transitions. [2020-10-16 12:11:24,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-10-16 12:11:24,905 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:11:24,905 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:11:24,906 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 12:11:24,906 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:11:24,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:11:24,906 INFO L82 PathProgramCache]: Analyzing trace with hash 948737399, now seen corresponding path program 1 times [2020-10-16 12:11:24,907 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:11:24,907 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5383271] [2020-10-16 12:11:24,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:11:24,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:11:25,031 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-16 12:11:25,031 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5383271] [2020-10-16 12:11:25,032 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:11:25,032 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 12:11:25,032 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893751741] [2020-10-16 12:11:25,032 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 12:11:25,033 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:11:25,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 12:11:25,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-16 12:11:25,033 INFO L87 Difference]: Start difference. First operand 110 states and 249 transitions. Second operand 4 states. [2020-10-16 12:11:25,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:11:25,067 INFO L93 Difference]: Finished difference Result 109 states and 246 transitions. [2020-10-16 12:11:25,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:11:25,068 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2020-10-16 12:11:25,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:11:25,069 INFO L225 Difference]: With dead ends: 109 [2020-10-16 12:11:25,069 INFO L226 Difference]: Without dead ends: 109 [2020-10-16 12:11:25,070 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-16 12:11:25,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2020-10-16 12:11:25,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2020-10-16 12:11:25,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2020-10-16 12:11:25,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 246 transitions. [2020-10-16 12:11:25,078 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 246 transitions. Word has length 8 [2020-10-16 12:11:25,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:11:25,078 INFO L481 AbstractCegarLoop]: Abstraction has 109 states and 246 transitions. [2020-10-16 12:11:25,078 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 12:11:25,079 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 246 transitions. [2020-10-16 12:11:25,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-16 12:11:25,079 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:11:25,080 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:11:25,080 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 12:11:25,080 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:11:25,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:11:25,080 INFO L82 PathProgramCache]: Analyzing trace with hash -654518260, now seen corresponding path program 1 times [2020-10-16 12:11:25,081 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:11:25,081 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442260356] [2020-10-16 12:11:25,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:11:25,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:11:25,137 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-16 12:11:25,137 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442260356] [2020-10-16 12:11:25,138 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:11:25,138 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:11:25,138 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205310024] [2020-10-16 12:11:25,139 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 12:11:25,139 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:11:25,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 12:11:25,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:11:25,140 INFO L87 Difference]: Start difference. First operand 109 states and 246 transitions. Second operand 5 states. [2020-10-16 12:11:25,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:11:25,215 INFO L93 Difference]: Finished difference Result 154 states and 330 transitions. [2020-10-16 12:11:25,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 12:11:25,217 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-10-16 12:11:25,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:11:25,218 INFO L225 Difference]: With dead ends: 154 [2020-10-16 12:11:25,218 INFO L226 Difference]: Without dead ends: 118 [2020-10-16 12:11:25,218 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:11:25,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2020-10-16 12:11:25,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 106. [2020-10-16 12:11:25,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2020-10-16 12:11:25,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 226 transitions. [2020-10-16 12:11:25,226 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 226 transitions. Word has length 9 [2020-10-16 12:11:25,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:11:25,226 INFO L481 AbstractCegarLoop]: Abstraction has 106 states and 226 transitions. [2020-10-16 12:11:25,227 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 12:11:25,227 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 226 transitions. [2020-10-16 12:11:25,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-16 12:11:25,228 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:11:25,228 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:11:25,228 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 12:11:25,228 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:11:25,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:11:25,229 INFO L82 PathProgramCache]: Analyzing trace with hash -654466738, now seen corresponding path program 1 times [2020-10-16 12:11:25,229 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:11:25,229 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658324443] [2020-10-16 12:11:25,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:11:25,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:11:25,346 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-16 12:11:25,346 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658324443] [2020-10-16 12:11:25,347 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:11:25,347 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:11:25,349 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765183415] [2020-10-16 12:11:25,350 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 12:11:25,350 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:11:25,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 12:11:25,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:11:25,351 INFO L87 Difference]: Start difference. First operand 106 states and 226 transitions. Second operand 5 states. [2020-10-16 12:11:25,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:11:25,424 INFO L93 Difference]: Finished difference Result 104 states and 220 transitions. [2020-10-16 12:11:25,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 12:11:25,425 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-10-16 12:11:25,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:11:25,426 INFO L225 Difference]: With dead ends: 104 [2020-10-16 12:11:25,426 INFO L226 Difference]: Without dead ends: 104 [2020-10-16 12:11:25,427 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:11:25,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2020-10-16 12:11:25,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2020-10-16 12:11:25,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2020-10-16 12:11:25,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 220 transitions. [2020-10-16 12:11:25,433 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 220 transitions. Word has length 9 [2020-10-16 12:11:25,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:11:25,433 INFO L481 AbstractCegarLoop]: Abstraction has 104 states and 220 transitions. [2020-10-16 12:11:25,433 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 12:11:25,434 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 220 transitions. [2020-10-16 12:11:25,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-16 12:11:25,434 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:11:25,435 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:11:25,435 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 12:11:25,435 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:11:25,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:11:25,435 INFO L82 PathProgramCache]: Analyzing trace with hash -653912861, now seen corresponding path program 1 times [2020-10-16 12:11:25,436 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:11:25,436 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312723066] [2020-10-16 12:11:25,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:11:25,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:11:25,482 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-16 12:11:25,483 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312723066] [2020-10-16 12:11:25,483 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:11:25,483 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 12:11:25,483 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115178329] [2020-10-16 12:11:25,484 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 12:11:25,484 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:11:25,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 12:11:25,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-16 12:11:25,485 INFO L87 Difference]: Start difference. First operand 104 states and 220 transitions. Second operand 4 states. [2020-10-16 12:11:25,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:11:25,523 INFO L93 Difference]: Finished difference Result 105 states and 222 transitions. [2020-10-16 12:11:25,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 12:11:25,524 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2020-10-16 12:11:25,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:11:25,527 INFO L225 Difference]: With dead ends: 105 [2020-10-16 12:11:25,527 INFO L226 Difference]: Without dead ends: 105 [2020-10-16 12:11:25,528 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-16 12:11:25,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2020-10-16 12:11:25,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2020-10-16 12:11:25,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2020-10-16 12:11:25,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 222 transitions. [2020-10-16 12:11:25,535 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 222 transitions. Word has length 9 [2020-10-16 12:11:25,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:11:25,535 INFO L481 AbstractCegarLoop]: Abstraction has 105 states and 222 transitions. [2020-10-16 12:11:25,535 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 12:11:25,535 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 222 transitions. [2020-10-16 12:11:25,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-16 12:11:25,536 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:11:25,536 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:11:25,537 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 12:11:25,537 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:11:25,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:11:25,537 INFO L82 PathProgramCache]: Analyzing trace with hash -655211141, now seen corresponding path program 2 times [2020-10-16 12:11:25,538 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:11:25,538 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16525038] [2020-10-16 12:11:25,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:11:25,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:11:25,639 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-16 12:11:25,640 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16525038] [2020-10-16 12:11:25,641 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:11:25,641 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:11:25,642 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611362584] [2020-10-16 12:11:25,642 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 12:11:25,642 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:11:25,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 12:11:25,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:11:25,644 INFO L87 Difference]: Start difference. First operand 105 states and 222 transitions. Second operand 5 states. [2020-10-16 12:11:25,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:11:25,694 INFO L93 Difference]: Finished difference Result 102 states and 214 transitions. [2020-10-16 12:11:25,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 12:11:25,696 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-10-16 12:11:25,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:11:25,697 INFO L225 Difference]: With dead ends: 102 [2020-10-16 12:11:25,698 INFO L226 Difference]: Without dead ends: 102 [2020-10-16 12:11:25,698 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:11:25,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2020-10-16 12:11:25,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2020-10-16 12:11:25,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2020-10-16 12:11:25,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 212 transitions. [2020-10-16 12:11:25,712 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 212 transitions. Word has length 9 [2020-10-16 12:11:25,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:11:25,712 INFO L481 AbstractCegarLoop]: Abstraction has 101 states and 212 transitions. [2020-10-16 12:11:25,712 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 12:11:25,713 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 212 transitions. [2020-10-16 12:11:25,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-16 12:11:25,717 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:11:25,718 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:11:25,718 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 12:11:25,718 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:11:25,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:11:25,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1186366444, now seen corresponding path program 1 times [2020-10-16 12:11:25,719 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:11:25,719 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019803559] [2020-10-16 12:11:25,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:11:25,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:11:25,836 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-16 12:11:25,837 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019803559] [2020-10-16 12:11:25,837 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:11:25,837 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:11:25,838 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556123876] [2020-10-16 12:11:25,838 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 12:11:25,838 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:11:25,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 12:11:25,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:11:25,839 INFO L87 Difference]: Start difference. First operand 101 states and 212 transitions. Second operand 5 states. [2020-10-16 12:11:25,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:11:25,881 INFO L93 Difference]: Finished difference Result 107 states and 222 transitions. [2020-10-16 12:11:25,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 12:11:25,881 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-10-16 12:11:25,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:11:25,883 INFO L225 Difference]: With dead ends: 107 [2020-10-16 12:11:25,883 INFO L226 Difference]: Without dead ends: 107 [2020-10-16 12:11:25,883 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:11:25,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2020-10-16 12:11:25,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2020-10-16 12:11:25,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2020-10-16 12:11:25,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 219 transitions. [2020-10-16 12:11:25,888 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 219 transitions. Word has length 10 [2020-10-16 12:11:25,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:11:25,888 INFO L481 AbstractCegarLoop]: Abstraction has 105 states and 219 transitions. [2020-10-16 12:11:25,888 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 12:11:25,888 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 219 transitions. [2020-10-16 12:11:25,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-16 12:11:25,889 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:11:25,889 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:11:25,890 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 12:11:25,890 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:11:25,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:11:25,890 INFO L82 PathProgramCache]: Analyzing trace with hash -1928407251, now seen corresponding path program 1 times [2020-10-16 12:11:25,890 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:11:25,891 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244920730] [2020-10-16 12:11:25,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:11:25,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:11:25,946 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-16 12:11:25,947 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244920730] [2020-10-16 12:11:25,947 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:11:25,947 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:11:25,948 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605867984] [2020-10-16 12:11:25,948 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 12:11:25,948 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:11:25,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 12:11:25,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 12:11:25,949 INFO L87 Difference]: Start difference. First operand 105 states and 219 transitions. Second operand 4 states. [2020-10-16 12:11:25,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:11:25,971 INFO L93 Difference]: Finished difference Result 93 states and 164 transitions. [2020-10-16 12:11:25,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 12:11:25,972 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-10-16 12:11:25,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:11:25,972 INFO L225 Difference]: With dead ends: 93 [2020-10-16 12:11:25,973 INFO L226 Difference]: Without dead ends: 66 [2020-10-16 12:11:25,973 INFO L677 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-16 12:11:25,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-10-16 12:11:25,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2020-10-16 12:11:25,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-10-16 12:11:25,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 108 transitions. [2020-10-16 12:11:25,976 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 108 transitions. Word has length 11 [2020-10-16 12:11:25,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:11:25,976 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 108 transitions. [2020-10-16 12:11:25,976 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 12:11:25,976 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 108 transitions. [2020-10-16 12:11:25,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-16 12:11:25,977 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:11:25,977 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:11:25,977 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 12:11:25,977 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:11:25,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:11:25,978 INFO L82 PathProgramCache]: Analyzing trace with hash -1324963649, now seen corresponding path program 1 times [2020-10-16 12:11:25,978 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:11:25,978 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675438712] [2020-10-16 12:11:25,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:11:26,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:11:26,070 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-16 12:11:26,070 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675438712] [2020-10-16 12:11:26,070 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:11:26,071 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 12:11:26,071 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825123639] [2020-10-16 12:11:26,071 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 12:11:26,072 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:11:26,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 12:11:26,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:11:26,072 INFO L87 Difference]: Start difference. First operand 66 states and 108 transitions. Second operand 5 states. [2020-10-16 12:11:26,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:11:26,102 INFO L93 Difference]: Finished difference Result 52 states and 79 transitions. [2020-10-16 12:11:26,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 12:11:26,104 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-10-16 12:11:26,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:11:26,104 INFO L225 Difference]: With dead ends: 52 [2020-10-16 12:11:26,104 INFO L226 Difference]: Without dead ends: 26 [2020-10-16 12:11:26,105 INFO L677 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-16 12:11:26,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-10-16 12:11:26,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2020-10-16 12:11:26,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-10-16 12:11:26,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2020-10-16 12:11:26,106 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 12 [2020-10-16 12:11:26,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:11:26,107 INFO L481 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2020-10-16 12:11:26,107 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 12:11:26,107 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2020-10-16 12:11:26,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-16 12:11:26,107 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:11:26,107 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:11:26,108 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 12:11:26,108 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:11:26,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:11:26,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1438791809, now seen corresponding path program 1 times [2020-10-16 12:11:26,108 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:11:26,109 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128887735] [2020-10-16 12:11:26,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:11:26,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:11:26,305 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-16 12:11:26,308 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128887735] [2020-10-16 12:11:26,308 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:11:26,308 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 12:11:26,309 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738284243] [2020-10-16 12:11:26,309 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 12:11:26,309 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:11:26,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 12:11:26,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-16 12:11:26,310 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand 8 states. [2020-10-16 12:11:26,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:11:26,444 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2020-10-16 12:11:26,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 12:11:26,445 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2020-10-16 12:11:26,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:11:26,445 INFO L225 Difference]: With dead ends: 32 [2020-10-16 12:11:26,445 INFO L226 Difference]: Without dead ends: 20 [2020-10-16 12:11:26,446 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-10-16 12:11:26,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-10-16 12:11:26,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-10-16 12:11:26,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-10-16 12:11:26,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2020-10-16 12:11:26,448 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 15 [2020-10-16 12:11:26,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:11:26,448 INFO L481 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2020-10-16 12:11:26,448 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 12:11:26,449 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2020-10-16 12:11:26,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-16 12:11:26,449 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:11:26,449 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:11:26,449 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 12:11:26,450 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:11:26,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:11:26,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1509183925, now seen corresponding path program 2 times [2020-10-16 12:11:26,450 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:11:26,450 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120329583] [2020-10-16 12:11:26,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:11:26,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 12:11:26,486 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 12:11:26,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 12:11:26,518 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 12:11:26,552 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 12:11:26,553 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 12:11:26,553 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-16 12:11:26,554 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-16 12:11:26,564 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [855] [855] L3-->L793: Formula: (let ((.cse6 (= (mod ~x$w_buff0_used~0_In-1335192371 256) 0)) (.cse7 (= (mod ~x$r_buff0_thd0~0_In-1335192371 256) 0)) (.cse8 (= (mod ~x$r_buff1_thd0~0_In-1335192371 256) 0)) (.cse9 (= (mod ~x$w_buff1_used~0_In-1335192371 256) 0))) (let ((.cse0 (or .cse8 .cse9)) (.cse1 (not .cse9)) (.cse2 (not .cse8)) (.cse3 (not .cse7)) (.cse4 (not .cse6)) (.cse5 (or .cse6 .cse7))) (and (not (= ULTIMATE.start_assume_abort_if_not_~cond_In-1335192371 0)) (or (and .cse0 (= ~x$w_buff1_used~0_In-1335192371 ~x$w_buff1_used~0_Out-1335192371)) (and (= ~x$w_buff1_used~0_Out-1335192371 0) .cse1 .cse2)) (or (and (= ~x$w_buff0~0_In-1335192371 ~x~0_Out-1335192371) .cse3 .cse4) (and .cse5 (or (and (= ~x~0_In-1335192371 ~x~0_Out-1335192371) .cse0) (and .cse1 (= ~x$w_buff1~0_In-1335192371 ~x~0_Out-1335192371) .cse2)))) (or (and (= ~x$w_buff0_used~0_Out-1335192371 0) .cse3 .cse4) (and .cse5 (= ~x$w_buff0_used~0_Out-1335192371 ~x$w_buff0_used~0_In-1335192371))) (= ~x$r_buff0_thd0~0_In-1335192371 ~x$r_buff0_thd0~0_Out-1335192371) (= ~x$r_buff1_thd0~0_Out-1335192371 ~x$r_buff1_thd0~0_In-1335192371)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-1335192371, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1335192371, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In-1335192371, ~x$w_buff1~0=~x$w_buff1~0_In-1335192371, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1335192371, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1335192371, ~x~0=~x~0_In-1335192371, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1335192371} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-1335192371, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_Out-1335192371, ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out-1335192371|, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out-1335192371|, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-1335192371|, ~x$w_buff1~0=~x$w_buff1~0_In-1335192371, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out-1335192371, ULTIMATE.start_main_#t~ite16=|ULTIMATE.start_main_#t~ite16_Out-1335192371|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out-1335192371, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-1335192371|, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-1335192371|, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out-1335192371, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In-1335192371, ~x~0=~x~0_Out-1335192371} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19, ~x$w_buff1_used~0, ULTIMATE.start_main_#t~ite16, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite21, ~x~0, ~x$w_buff0_used~0] because there is no mapped edge [2020-10-16 12:11:26,569 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-16 12:11:26,569 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:11:26,570 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-16 12:11:26,571 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:11:26,571 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-16 12:11:26,571 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:11:26,571 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-16 12:11:26,571 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:11:26,571 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-16 12:11:26,572 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:11:26,572 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-16 12:11:26,572 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:11:26,572 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-16 12:11:26,572 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:11:26,573 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-16 12:11:26,573 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:11:26,573 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-16 12:11:26,573 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:11:26,573 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-16 12:11:26,574 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:11:26,574 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-16 12:11:26,574 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:11:26,574 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-16 12:11:26,574 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:11:26,574 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-16 12:11:26,575 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:11:26,576 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-16 12:11:26,576 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:11:26,576 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-16 12:11:26,576 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:11:26,576 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-16 12:11:26,576 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:11:26,577 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-16 12:11:26,577 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:11:26,577 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-16 12:11:26,577 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:11:26,577 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-16 12:11:26,577 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:11:26,578 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-16 12:11:26,578 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:11:26,578 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-16 12:11:26,578 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:11:26,578 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-16 12:11:26,579 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:11:26,579 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-16 12:11:26,579 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:11:26,627 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 12:11:26 BasicIcfg [2020-10-16 12:11:26,628 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 12:11:26,630 INFO L168 Benchmark]: Toolchain (without parser) took 12141.06 ms. Allocated memory was 141.0 MB in the beginning and 341.8 MB in the end (delta: 200.8 MB). Free memory was 103.1 MB in the beginning and 220.8 MB in the end (delta: -117.7 MB). Peak memory consumption was 83.1 MB. Max. memory is 7.1 GB. [2020-10-16 12:11:26,630 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 141.0 MB. Free memory was 122.6 MB in the beginning and 122.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-10-16 12:11:26,631 INFO L168 Benchmark]: CACSL2BoogieTranslator took 786.79 ms. Allocated memory was 141.0 MB in the beginning and 205.5 MB in the end (delta: 64.5 MB). Free memory was 102.8 MB in the beginning and 161.2 MB in the end (delta: -58.4 MB). Peak memory consumption was 27.1 MB. Max. memory is 7.1 GB. [2020-10-16 12:11:26,632 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.55 ms. Allocated memory is still 205.5 MB. Free memory was 161.2 MB in the beginning and 158.0 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. [2020-10-16 12:11:26,633 INFO L168 Benchmark]: Boogie Preprocessor took 39.87 ms. Allocated memory is still 205.5 MB. Free memory was 158.0 MB in the beginning and 155.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2020-10-16 12:11:26,634 INFO L168 Benchmark]: RCFGBuilder took 1993.71 ms. Allocated memory was 205.5 MB in the beginning and 245.4 MB in the end (delta: 39.8 MB). Free memory was 155.4 MB in the beginning and 189.8 MB in the end (delta: -34.4 MB). Peak memory consumption was 98.5 MB. Max. memory is 7.1 GB. [2020-10-16 12:11:26,634 INFO L168 Benchmark]: TraceAbstraction took 9243.70 ms. Allocated memory was 245.4 MB in the beginning and 341.8 MB in the end (delta: 96.5 MB). Free memory was 188.1 MB in the beginning and 220.8 MB in the end (delta: -32.7 MB). Peak memory consumption was 63.8 MB. Max. memory is 7.1 GB. [2020-10-16 12:11:26,639 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.20 ms. Allocated memory is still 141.0 MB. Free memory was 122.6 MB in the beginning and 122.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 786.79 ms. Allocated memory was 141.0 MB in the beginning and 205.5 MB in the end (delta: 64.5 MB). Free memory was 102.8 MB in the beginning and 161.2 MB in the end (delta: -58.4 MB). Peak memory consumption was 27.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 70.55 ms. Allocated memory is still 205.5 MB. Free memory was 161.2 MB in the beginning and 158.0 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.87 ms. Allocated memory is still 205.5 MB. Free memory was 158.0 MB in the beginning and 155.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1993.71 ms. Allocated memory was 205.5 MB in the beginning and 245.4 MB in the end (delta: 39.8 MB). Free memory was 155.4 MB in the beginning and 189.8 MB in the end (delta: -34.4 MB). Peak memory consumption was 98.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9243.70 ms. Allocated memory was 245.4 MB in the beginning and 341.8 MB in the end (delta: 96.5 MB). Free memory was 188.1 MB in the beginning and 220.8 MB in the end (delta: -32.7 MB). Peak memory consumption was 63.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 463 VarBasedMoverChecksPositive, 29 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 32 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 6.4s, 79 PlacesBefore, 26 PlacesAfterwards, 74 TransitionsBefore, 19 TransitionsAfterwards, 888 CoEnabledTransitionPairs, 6 FixpointIterations, 27 TrivialSequentialCompositions, 31 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 2 ChoiceCompositions, 65 TotalNumberOfCompositions, 2263 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L697] 0 int __unbuffered_cnt = 0; [L698] 0 _Bool main$tmp_guard0; [L699] 0 _Bool main$tmp_guard1; [L701] 0 int x = 0; [L702] 0 _Bool x$flush_delayed; [L703] 0 int x$mem_tmp; [L704] 0 _Bool x$r_buff0_thd0; [L705] 0 _Bool x$r_buff0_thd1; [L706] 0 _Bool x$r_buff0_thd2; [L707] 0 _Bool x$r_buff1_thd0; [L708] 0 _Bool x$r_buff1_thd1; [L709] 0 _Bool x$r_buff1_thd2; [L710] 0 _Bool x$read_delayed; [L711] 0 int *x$read_delayed_var; [L712] 0 int x$w_buff0; [L713] 0 _Bool x$w_buff0_used; [L714] 0 int x$w_buff1; [L715] 0 _Bool x$w_buff1_used; [L717] 0 int y = 0; [L718] 0 _Bool weak$$choice0; [L719] 0 _Bool weak$$choice2; [L779] 0 pthread_t t2475; [L780] FCALL, FORK 0 pthread_create(&t2475, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L781] 0 pthread_t t2476; [L782] FCALL, FORK 0 pthread_create(&t2476, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L743] 2 x$w_buff1 = x$w_buff0 [L744] 2 x$w_buff0 = 2 [L745] 2 x$w_buff1_used = x$w_buff0_used [L746] 2 x$w_buff0_used = (_Bool)1 [L7] COND TRUE 2 !expression [L7] 2 __VERIFIER_error() [L748] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L749] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L750] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L751] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L754] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L723] 1 y = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L726] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L757] 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) [L757] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L757] 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) [L757] 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) [L758] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L758] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L759] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L759] 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 [L760] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L760] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L761] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L761] 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 [L729] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L729] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L729] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L729] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L730] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L730] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L731] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L731] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L732] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L732] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L733] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L733] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L736] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L738] 1 return 0; [L764] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L766] 2 return 0; [L784] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L795] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L796] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L797] 0 x$flush_delayed = weak$$choice2 [L798] 0 x$mem_tmp = x [L799] 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) [L799] 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) [L800] 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)) [L800] 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)) [L801] 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)) [L801] 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) [L801] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1 [L801] 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) [L801] 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)) [L801] 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)) [L802] 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)) [L802] 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)) [L803] 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)) [L803] 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)) [L804] 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)) [L804] 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)) [L805] 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)) [L805] 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)) [L806] 0 main$tmp_guard1 = !(x == 2 && y == 2) [L807] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L807] 0 x = x$flush_delayed ? x$mem_tmp : x [L808] 0 x$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, 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=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 73 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 9.0s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.5s, HoareTripleCheckerStatistics: 171 SDtfs, 153 SDslu, 203 SDs, 0 SdLazy, 204 SolverSat, 59 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 41 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=162occurred 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.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 17 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 127 NumberOfCodeBlocks, 127 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 100 ConstructedInterpolants, 0 QuantifiedInterpolants, 6824 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...