./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/safe019_tso.opt_true-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/pthread-wmm/safe019_tso.opt_true-unreach-call.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 42ea31b300af28118faa4af2ac5f7ebdb1b2f5de ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 00:57:37,361 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 00:57:37,364 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 00:57:37,377 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 00:57:37,378 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 00:57:37,379 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 00:57:37,380 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 00:57:37,383 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 00:57:37,385 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 00:57:37,386 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 00:57:37,387 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 00:57:37,388 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 00:57:37,389 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 00:57:37,391 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 00:57:37,392 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 00:57:37,393 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 00:57:37,394 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 00:57:37,396 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 00:57:37,398 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 00:57:37,400 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 00:57:37,401 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 00:57:37,403 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 00:57:37,405 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 00:57:37,406 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 00:57:37,406 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 00:57:37,407 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 00:57:37,408 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 00:57:37,409 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 00:57:37,410 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 00:57:37,411 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 00:57:37,411 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 00:57:37,412 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 00:57:37,412 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 00:57:37,412 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 00:57:37,414 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 00:57:37,415 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 00:57:37,415 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-01 00:57:37,431 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 00:57:37,431 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 00:57:37,433 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 00:57:37,433 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 00:57:37,433 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 00:57:37,433 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 00:57:37,434 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 00:57:37,434 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 00:57:37,434 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 00:57:37,434 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 00:57:37,434 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-01 00:57:37,434 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-01 00:57:37,436 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-01 00:57:37,436 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 00:57:37,436 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 00:57:37,436 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 00:57:37,437 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-01 00:57:37,437 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 00:57:37,437 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 00:57:37,437 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-01 00:57:37,437 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-01 00:57:37,437 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-01 00:57:37,439 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 00:57:37,439 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-01 00:57:37,439 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-01 00:57:37,439 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 00:57:37,439 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-01 00:57:37,440 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-01 00:57:37,440 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 42ea31b300af28118faa4af2ac5f7ebdb1b2f5de [2019-01-01 00:57:37,479 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 00:57:37,498 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 00:57:37,502 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 00:57:37,504 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 00:57:37,505 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 00:57:37,505 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/safe019_tso.opt_true-unreach-call.i [2019-01-01 00:57:37,577 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9d8f8ac1/bdf7bc592db8400596fc5d5038617dad/FLAG6d0ad5784 [2019-01-01 00:57:38,188 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 00:57:38,191 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/safe019_tso.opt_true-unreach-call.i [2019-01-01 00:57:38,212 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9d8f8ac1/bdf7bc592db8400596fc5d5038617dad/FLAG6d0ad5784 [2019-01-01 00:57:38,430 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9d8f8ac1/bdf7bc592db8400596fc5d5038617dad [2019-01-01 00:57:38,434 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 00:57:38,437 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 00:57:38,438 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 00:57:38,438 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 00:57:38,443 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 00:57:38,444 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 12:57:38" (1/1) ... [2019-01-01 00:57:38,448 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@133182c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:57:38, skipping insertion in model container [2019-01-01 00:57:38,448 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 12:57:38" (1/1) ... [2019-01-01 00:57:38,458 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 00:57:38,529 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 00:57:39,003 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 00:57:39,022 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 00:57:39,168 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 00:57:39,257 INFO L195 MainTranslator]: Completed translation [2019-01-01 00:57:39,257 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:57:39 WrapperNode [2019-01-01 00:57:39,258 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 00:57:39,259 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 00:57:39,259 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 00:57:39,259 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 00:57:39,270 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:57:39" (1/1) ... [2019-01-01 00:57:39,296 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:57:39" (1/1) ... [2019-01-01 00:57:39,325 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 00:57:39,326 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 00:57:39,326 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 00:57:39,326 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 00:57:39,337 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:57:39" (1/1) ... [2019-01-01 00:57:39,338 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:57:39" (1/1) ... [2019-01-01 00:57:39,342 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:57:39" (1/1) ... [2019-01-01 00:57:39,343 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:57:39" (1/1) ... [2019-01-01 00:57:39,351 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:57:39" (1/1) ... [2019-01-01 00:57:39,355 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:57:39" (1/1) ... [2019-01-01 00:57:39,358 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:57:39" (1/1) ... [2019-01-01 00:57:39,362 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 00:57:39,363 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 00:57:39,363 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 00:57:39,364 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 00:57:39,365 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:57:39" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-01 00:57:39,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 00:57:39,436 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-01-01 00:57:39,436 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 00:57:39,436 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 00:57:39,436 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-01-01 00:57:39,436 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-01-01 00:57:39,436 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-01-01 00:57:39,437 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-01-01 00:57:39,437 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-01-01 00:57:39,437 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-01-01 00:57:39,437 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-01-01 00:57:39,437 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-01-01 00:57:39,437 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-01-01 00:57:39,439 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 00:57:39,439 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 00:57:39,441 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-01-01 00:57:40,066 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 00:57:40,066 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2019-01-01 00:57:40,067 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 12:57:40 BoogieIcfgContainer [2019-01-01 00:57:40,067 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 00:57:40,068 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-01 00:57:40,068 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-01 00:57:40,071 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-01 00:57:40,072 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.01 12:57:38" (1/3) ... [2019-01-01 00:57:40,072 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23af0437 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 12:57:40, skipping insertion in model container [2019-01-01 00:57:40,073 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:57:39" (2/3) ... [2019-01-01 00:57:40,073 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23af0437 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 12:57:40, skipping insertion in model container [2019-01-01 00:57:40,073 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 12:57:40" (3/3) ... [2019-01-01 00:57:40,075 INFO L112 eAbstractionObserver]: Analyzing ICFG safe019_tso.opt_true-unreach-call.i [2019-01-01 00:57:40,113 WARN L317 ript$VariableManager]: TermVariabe |Thread3_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:40,114 WARN L317 ript$VariableManager]: TermVariabe |Thread3_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:40,114 WARN L317 ript$VariableManager]: TermVariabe Thread3_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:40,114 WARN L317 ript$VariableManager]: TermVariabe Thread3_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:40,114 WARN L317 ript$VariableManager]: TermVariabe |Thread3_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:40,115 WARN L317 ript$VariableManager]: TermVariabe |Thread3_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:40,115 WARN L317 ript$VariableManager]: TermVariabe |Thread3_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:40,115 WARN L317 ript$VariableManager]: TermVariabe |Thread3_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:40,115 WARN L317 ript$VariableManager]: TermVariabe |Thread3_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:40,115 WARN L317 ript$VariableManager]: TermVariabe |Thread3_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:40,116 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:40,116 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:40,116 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:40,116 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:40,116 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:40,117 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:40,117 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:40,117 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:40,117 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:40,117 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:40,118 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:40,118 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:40,118 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:40,118 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:40,118 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:40,118 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:40,118 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:40,119 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:40,119 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:40,119 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:40,119 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:40,120 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:40,120 WARN L317 ript$VariableManager]: TermVariabe Thread2_P3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:40,120 WARN L317 ript$VariableManager]: TermVariabe Thread2_P3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:40,120 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P3_#t~nondet6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:40,120 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P3_#t~nondet6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:40,120 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:40,121 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:40,121 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P3_#t~nondet6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:40,121 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P3_#t~nondet6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:40,169 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-01-01 00:57:40,169 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-01 00:57:40,178 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-01 00:57:40,196 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-01 00:57:40,223 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 00:57:40,224 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-01 00:57:40,224 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-01 00:57:40,224 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-01 00:57:40,224 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 00:57:40,224 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 00:57:40,224 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-01 00:57:40,225 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 00:57:40,225 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-01 00:57:40,234 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 67places, 63 transitions [2019-01-01 00:57:41,265 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 13135 states. [2019-01-01 00:57:41,268 INFO L276 IsEmpty]: Start isEmpty. Operand 13135 states. [2019-01-01 00:57:41,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-01 00:57:41,303 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:57:41,304 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:57:41,307 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:57:41,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:57:41,314 INFO L82 PathProgramCache]: Analyzing trace with hash 2121463999, now seen corresponding path program 1 times [2019-01-01 00:57:41,316 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:57:41,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:57:41,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:57:41,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:57:41,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:57:41,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:57:41,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:57:41,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:57:41,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 00:57:41,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 00:57:41,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 00:57:41,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 00:57:41,721 INFO L87 Difference]: Start difference. First operand 13135 states. Second operand 4 states. [2019-01-01 00:57:42,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:57:42,355 INFO L93 Difference]: Finished difference Result 13741 states and 55792 transitions. [2019-01-01 00:57:42,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 00:57:42,357 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2019-01-01 00:57:42,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:57:42,461 INFO L225 Difference]: With dead ends: 13741 [2019-01-01 00:57:42,461 INFO L226 Difference]: Without dead ends: 5628 [2019-01-01 00:57:42,464 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-01 00:57:42,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5628 states. [2019-01-01 00:57:42,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5628 to 5628. [2019-01-01 00:57:42,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5628 states. [2019-01-01 00:57:42,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5628 states to 5628 states and 22351 transitions. [2019-01-01 00:57:42,836 INFO L78 Accepts]: Start accepts. Automaton has 5628 states and 22351 transitions. Word has length 34 [2019-01-01 00:57:42,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:57:42,838 INFO L480 AbstractCegarLoop]: Abstraction has 5628 states and 22351 transitions. [2019-01-01 00:57:42,838 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 00:57:42,838 INFO L276 IsEmpty]: Start isEmpty. Operand 5628 states and 22351 transitions. [2019-01-01 00:57:42,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-01 00:57:42,848 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:57:42,848 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:57:42,849 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:57:42,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:57:42,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1168974297, now seen corresponding path program 1 times [2019-01-01 00:57:42,850 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:57:42,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:57:42,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:57:42,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:57:42,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:57:42,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:57:43,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:57:43,220 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:57:43,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 00:57:43,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 00:57:43,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 00:57:43,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-01 00:57:43,223 INFO L87 Difference]: Start difference. First operand 5628 states and 22351 transitions. Second operand 5 states. [2019-01-01 00:57:43,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:57:43,927 INFO L93 Difference]: Finished difference Result 6140 states and 23831 transitions. [2019-01-01 00:57:43,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 00:57:43,927 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2019-01-01 00:57:43,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:57:43,976 INFO L225 Difference]: With dead ends: 6140 [2019-01-01 00:57:43,977 INFO L226 Difference]: Without dead ends: 5516 [2019-01-01 00:57:43,978 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-01 00:57:44,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5516 states. [2019-01-01 00:57:44,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5516 to 5516. [2019-01-01 00:57:44,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5516 states. [2019-01-01 00:57:44,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5516 states to 5516 states and 21819 transitions. [2019-01-01 00:57:44,193 INFO L78 Accepts]: Start accepts. Automaton has 5516 states and 21819 transitions. Word has length 35 [2019-01-01 00:57:44,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:57:44,193 INFO L480 AbstractCegarLoop]: Abstraction has 5516 states and 21819 transitions. [2019-01-01 00:57:44,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 00:57:44,194 INFO L276 IsEmpty]: Start isEmpty. Operand 5516 states and 21819 transitions. [2019-01-01 00:57:44,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-01 00:57:44,206 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:57:44,206 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:57:44,208 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:57:44,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:57:44,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1525655991, now seen corresponding path program 1 times [2019-01-01 00:57:44,209 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:57:44,209 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:57:44,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:57:44,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:57:44,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:57:44,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:57:44,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:57:44,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:57:44,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 00:57:44,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 00:57:44,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 00:57:44,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-01 00:57:44,400 INFO L87 Difference]: Start difference. First operand 5516 states and 21819 transitions. Second operand 6 states. [2019-01-01 00:57:44,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:57:44,824 INFO L93 Difference]: Finished difference Result 5452 states and 20827 transitions. [2019-01-01 00:57:44,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 00:57:44,825 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2019-01-01 00:57:44,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:57:44,866 INFO L225 Difference]: With dead ends: 5452 [2019-01-01 00:57:44,867 INFO L226 Difference]: Without dead ends: 4844 [2019-01-01 00:57:44,867 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-01-01 00:57:44,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4844 states. [2019-01-01 00:57:45,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4844 to 4844. [2019-01-01 00:57:45,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4844 states. [2019-01-01 00:57:45,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4844 states to 4844 states and 18795 transitions. [2019-01-01 00:57:45,024 INFO L78 Accepts]: Start accepts. Automaton has 4844 states and 18795 transitions. Word has length 36 [2019-01-01 00:57:45,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:57:45,025 INFO L480 AbstractCegarLoop]: Abstraction has 4844 states and 18795 transitions. [2019-01-01 00:57:45,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 00:57:45,025 INFO L276 IsEmpty]: Start isEmpty. Operand 4844 states and 18795 transitions. [2019-01-01 00:57:45,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-01-01 00:57:45,034 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:57:45,035 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:57:45,035 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:57:45,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:57:45,035 INFO L82 PathProgramCache]: Analyzing trace with hash -113664757, now seen corresponding path program 1 times [2019-01-01 00:57:45,035 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:57:45,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:57:45,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:57:45,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:57:45,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:57:45,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:57:45,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:57:45,170 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:57:45,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 00:57:45,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 00:57:45,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 00:57:45,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-01 00:57:45,171 INFO L87 Difference]: Start difference. First operand 4844 states and 18795 transitions. Second operand 7 states. [2019-01-01 00:57:45,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:57:45,767 INFO L93 Difference]: Finished difference Result 3564 states and 13035 transitions. [2019-01-01 00:57:45,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 00:57:45,768 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2019-01-01 00:57:45,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:57:45,788 INFO L225 Difference]: With dead ends: 3564 [2019-01-01 00:57:45,788 INFO L226 Difference]: Without dead ends: 3052 [2019-01-01 00:57:45,789 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-01 00:57:45,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3052 states. [2019-01-01 00:57:45,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3052 to 3052. [2019-01-01 00:57:45,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3052 states. [2019-01-01 00:57:45,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3052 states to 3052 states and 11179 transitions. [2019-01-01 00:57:45,943 INFO L78 Accepts]: Start accepts. Automaton has 3052 states and 11179 transitions. Word has length 37 [2019-01-01 00:57:45,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:57:45,946 INFO L480 AbstractCegarLoop]: Abstraction has 3052 states and 11179 transitions. [2019-01-01 00:57:45,946 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 00:57:45,947 INFO L276 IsEmpty]: Start isEmpty. Operand 3052 states and 11179 transitions. [2019-01-01 00:57:45,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-01-01 00:57:45,957 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:57:45,957 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:57:45,958 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:57:45,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:57:45,958 INFO L82 PathProgramCache]: Analyzing trace with hash -2069274437, now seen corresponding path program 1 times [2019-01-01 00:57:45,958 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:57:45,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:57:45,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:57:45,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:57:45,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:57:45,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:57:46,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:57:46,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:57:46,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 00:57:46,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 00:57:46,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 00:57:46,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-01 00:57:46,151 INFO L87 Difference]: Start difference. First operand 3052 states and 11179 transitions. Second operand 6 states. [2019-01-01 00:57:46,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:57:46,337 INFO L93 Difference]: Finished difference Result 4732 states and 17539 transitions. [2019-01-01 00:57:46,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 00:57:46,338 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2019-01-01 00:57:46,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:57:46,352 INFO L225 Difference]: With dead ends: 4732 [2019-01-01 00:57:46,353 INFO L226 Difference]: Without dead ends: 2952 [2019-01-01 00:57:46,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-01 00:57:46,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2952 states. [2019-01-01 00:57:46,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2952 to 2952. [2019-01-01 00:57:46,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2952 states. [2019-01-01 00:57:46,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2952 states to 2952 states and 10819 transitions. [2019-01-01 00:57:46,575 INFO L78 Accepts]: Start accepts. Automaton has 2952 states and 10819 transitions. Word has length 38 [2019-01-01 00:57:46,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:57:46,575 INFO L480 AbstractCegarLoop]: Abstraction has 2952 states and 10819 transitions. [2019-01-01 00:57:46,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 00:57:46,577 INFO L276 IsEmpty]: Start isEmpty. Operand 2952 states and 10819 transitions. [2019-01-01 00:57:46,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-01-01 00:57:46,582 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:57:46,583 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:57:46,583 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:57:46,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:57:46,583 INFO L82 PathProgramCache]: Analyzing trace with hash -753117133, now seen corresponding path program 2 times [2019-01-01 00:57:46,588 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:57:46,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:57:46,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:57:46,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:57:46,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:57:46,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:57:46,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:57:46,850 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:57:46,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 00:57:46,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 00:57:46,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 00:57:46,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-01 00:57:46,851 INFO L87 Difference]: Start difference. First operand 2952 states and 10819 transitions. Second operand 7 states. [2019-01-01 00:57:47,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:57:47,032 INFO L93 Difference]: Finished difference Result 4952 states and 18235 transitions. [2019-01-01 00:57:47,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 00:57:47,036 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2019-01-01 00:57:47,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:57:47,048 INFO L225 Difference]: With dead ends: 4952 [2019-01-01 00:57:47,048 INFO L226 Difference]: Without dead ends: 2756 [2019-01-01 00:57:47,049 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-01-01 00:57:47,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2756 states. [2019-01-01 00:57:47,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2756 to 2756. [2019-01-01 00:57:47,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2756 states. [2019-01-01 00:57:47,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2756 states to 2756 states and 10203 transitions. [2019-01-01 00:57:47,137 INFO L78 Accepts]: Start accepts. Automaton has 2756 states and 10203 transitions. Word has length 38 [2019-01-01 00:57:47,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:57:47,137 INFO L480 AbstractCegarLoop]: Abstraction has 2756 states and 10203 transitions. [2019-01-01 00:57:47,137 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 00:57:47,137 INFO L276 IsEmpty]: Start isEmpty. Operand 2756 states and 10203 transitions. [2019-01-01 00:57:47,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-01-01 00:57:47,144 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:57:47,144 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:57:47,144 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:57:47,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:57:47,145 INFO L82 PathProgramCache]: Analyzing trace with hash -894920831, now seen corresponding path program 3 times [2019-01-01 00:57:47,146 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:57:47,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:57:47,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:57:47,148 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 00:57:47,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:57:47,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:57:47,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:57:47,309 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:57:47,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 00:57:47,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 00:57:47,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 00:57:47,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-01 00:57:47,311 INFO L87 Difference]: Start difference. First operand 2756 states and 10203 transitions. Second operand 7 states. [2019-01-01 00:57:47,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:57:47,577 INFO L93 Difference]: Finished difference Result 4612 states and 17131 transitions. [2019-01-01 00:57:47,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 00:57:47,579 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2019-01-01 00:57:47,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:57:47,591 INFO L225 Difference]: With dead ends: 4612 [2019-01-01 00:57:47,591 INFO L226 Difference]: Without dead ends: 2576 [2019-01-01 00:57:47,591 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-01-01 00:57:47,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2576 states. [2019-01-01 00:57:47,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2576 to 2576. [2019-01-01 00:57:47,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2576 states. [2019-01-01 00:57:47,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2576 states to 2576 states and 9591 transitions. [2019-01-01 00:57:47,670 INFO L78 Accepts]: Start accepts. Automaton has 2576 states and 9591 transitions. Word has length 38 [2019-01-01 00:57:47,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:57:47,671 INFO L480 AbstractCegarLoop]: Abstraction has 2576 states and 9591 transitions. [2019-01-01 00:57:47,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 00:57:47,671 INFO L276 IsEmpty]: Start isEmpty. Operand 2576 states and 9591 transitions. [2019-01-01 00:57:47,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-01-01 00:57:47,676 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:57:47,676 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:57:47,677 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:57:47,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:57:47,678 INFO L82 PathProgramCache]: Analyzing trace with hash 358548407, now seen corresponding path program 4 times [2019-01-01 00:57:47,678 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:57:47,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:57:47,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:57:47,681 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 00:57:47,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:57:47,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:57:47,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:57:47,853 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:57:47,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 00:57:47,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 00:57:47,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 00:57:47,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-01 00:57:47,855 INFO L87 Difference]: Start difference. First operand 2576 states and 9591 transitions. Second operand 7 states. [2019-01-01 00:57:47,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:57:47,975 INFO L93 Difference]: Finished difference Result 2064 states and 7543 transitions. [2019-01-01 00:57:47,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 00:57:47,976 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2019-01-01 00:57:47,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:57:47,976 INFO L225 Difference]: With dead ends: 2064 [2019-01-01 00:57:47,976 INFO L226 Difference]: Without dead ends: 0 [2019-01-01 00:57:47,977 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-01-01 00:57:47,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-01 00:57:47,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-01 00:57:47,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-01 00:57:47,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-01 00:57:47,978 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 38 [2019-01-01 00:57:47,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:57:47,978 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 00:57:47,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 00:57:47,978 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-01 00:57:47,978 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-01 00:57:47,982 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-01-01 00:57:47,984 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.01 12:57:47 BasicIcfg [2019-01-01 00:57:47,984 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-01 00:57:47,985 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 00:57:47,985 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 00:57:47,985 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 00:57:47,986 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 12:57:40" (3/4) ... [2019-01-01 00:57:47,990 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-01 00:57:47,998 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure P0 [2019-01-01 00:57:47,999 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure P1 [2019-01-01 00:57:47,999 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure P2 [2019-01-01 00:57:47,999 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure P3 [2019-01-01 00:57:48,005 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2019-01-01 00:57:48,006 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-01-01 00:57:48,060 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 00:57:48,061 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 00:57:48,062 INFO L168 Benchmark]: Toolchain (without parser) took 9626.57 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 327.7 MB). Free memory was 946.0 MB in the beginning and 1.0 GB in the end (delta: -96.6 MB). Peak memory consumption was 231.1 MB. Max. memory is 11.5 GB. [2019-01-01 00:57:48,064 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 00:57:48,065 INFO L168 Benchmark]: CACSL2BoogieTranslator took 820.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -164.8 MB). Peak memory consumption was 26.5 MB. Max. memory is 11.5 GB. [2019-01-01 00:57:48,065 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-01 00:57:48,067 INFO L168 Benchmark]: Boogie Preprocessor took 36.95 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 00:57:48,068 INFO L168 Benchmark]: RCFGBuilder took 703.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.6 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. [2019-01-01 00:57:48,069 INFO L168 Benchmark]: TraceAbstraction took 7916.50 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 189.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.1 MB). Peak memory consumption was 216.9 MB. Max. memory is 11.5 GB. [2019-01-01 00:57:48,070 INFO L168 Benchmark]: Witness Printer took 76.23 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 11.5 GB. [2019-01-01 00:57:48,075 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 820.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -164.8 MB). Peak memory consumption was 26.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 66.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 36.95 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 703.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.6 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7916.50 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 189.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.1 MB). Peak memory consumption was 216.9 MB. Max. memory is 11.5 GB. * Witness Printer took 76.23 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 87 locations, 1 error locations. SAFE Result, 7.7s OverallTime, 8 OverallIterations, 1 TraceHistogramMax, 3.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 566 SDtfs, 879 SDslu, 1515 SDs, 0 SdLazy, 173 SolverSat, 79 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13135occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 294 NumberOfCodeBlocks, 294 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 286 ConstructedInterpolants, 0 QuantifiedInterpolants, 25834 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...