./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread/stack_longest_false-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/stack_longest_false-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 a6ab55767df3b26021df0e39ced39f80ee5a9fd9 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-31 17:24:04,151 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 17:24:04,153 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 17:24:04,165 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 17:24:04,166 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 17:24:04,167 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 17:24:04,168 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 17:24:04,170 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 17:24:04,171 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 17:24:04,172 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 17:24:04,173 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 17:24:04,173 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 17:24:04,174 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 17:24:04,175 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 17:24:04,176 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 17:24:04,177 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 17:24:04,178 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 17:24:04,180 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 17:24:04,181 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 17:24:04,183 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 17:24:04,184 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 17:24:04,187 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 17:24:04,190 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 17:24:04,190 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 17:24:04,191 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 17:24:04,191 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 17:24:04,197 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 17:24:04,197 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 17:24:04,198 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 17:24:04,201 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 17:24:04,202 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 17:24:04,202 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 17:24:04,203 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 17:24:04,203 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 17:24:04,206 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 17:24:04,206 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 17:24:04,207 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 17:24:04,232 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 17:24:04,233 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 17:24:04,234 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 17:24:04,236 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 17:24:04,236 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 17:24:04,236 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 17:24:04,236 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 17:24:04,237 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 17:24:04,237 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 17:24:04,238 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 17:24:04,238 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 17:24:04,238 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 17:24:04,238 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 17:24:04,238 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 17:24:04,238 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 17:24:04,239 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 17:24:04,239 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 17:24:04,240 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 17:24:04,240 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 17:24:04,240 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 17:24:04,240 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 17:24:04,240 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 17:24:04,241 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 17:24:04,243 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 17:24:04,243 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 17:24:04,243 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 17:24:04,243 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 17:24:04,243 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 17:24:04,244 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 -> a6ab55767df3b26021df0e39ced39f80ee5a9fd9 [2018-12-31 17:24:04,293 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 17:24:04,310 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 17:24:04,315 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 17:24:04,317 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 17:24:04,317 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 17:24:04,318 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread/stack_longest_false-unreach-call.i [2018-12-31 17:24:04,379 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4df4beee8/f3b82248a84a4aa192331c95d077a7a6/FLAG5b79f4b69 [2018-12-31 17:24:04,968 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 17:24:04,969 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread/stack_longest_false-unreach-call.i [2018-12-31 17:24:04,984 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4df4beee8/f3b82248a84a4aa192331c95d077a7a6/FLAG5b79f4b69 [2018-12-31 17:24:05,229 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4df4beee8/f3b82248a84a4aa192331c95d077a7a6 [2018-12-31 17:24:05,234 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 17:24:05,235 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 17:24:05,237 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 17:24:05,237 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 17:24:05,243 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 17:24:05,244 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 05:24:05" (1/1) ... [2018-12-31 17:24:05,248 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42a64539 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:24:05, skipping insertion in model container [2018-12-31 17:24:05,249 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 05:24:05" (1/1) ... [2018-12-31 17:24:05,258 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 17:24:05,327 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 17:24:05,917 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 17:24:06,043 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 17:24:06,231 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 17:24:06,409 INFO L195 MainTranslator]: Completed translation [2018-12-31 17:24:06,409 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:24:06 WrapperNode [2018-12-31 17:24:06,409 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 17:24:06,410 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 17:24:06,410 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 17:24:06,410 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 17:24:06,421 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:24:06" (1/1) ... [2018-12-31 17:24:06,451 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:24:06" (1/1) ... [2018-12-31 17:24:06,485 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 17:24:06,485 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 17:24:06,485 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 17:24:06,485 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 17:24:06,497 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:24:06" (1/1) ... [2018-12-31 17:24:06,497 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:24:06" (1/1) ... [2018-12-31 17:24:06,502 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:24:06" (1/1) ... [2018-12-31 17:24:06,502 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:24:06" (1/1) ... [2018-12-31 17:24:06,512 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:24:06" (1/1) ... [2018-12-31 17:24:06,522 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:24:06" (1/1) ... [2018-12-31 17:24:06,530 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:24:06" (1/1) ... [2018-12-31 17:24:06,534 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 17:24:06,536 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 17:24:06,538 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 17:24:06,538 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 17:24:06,539 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:24:06" (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 [2018-12-31 17:24:06,614 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2018-12-31 17:24:06,614 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2018-12-31 17:24:06,615 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2018-12-31 17:24:06,615 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2018-12-31 17:24:06,615 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 17:24:06,615 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-31 17:24:06,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-31 17:24:06,615 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-31 17:24:06,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-31 17:24:06,616 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2018-12-31 17:24:06,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-12-31 17:24:06,616 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 17:24:06,616 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 17:24:06,617 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-31 17:24:07,488 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 17:24:07,489 INFO L280 CfgBuilder]: Removed 24 assue(true) statements. [2018-12-31 17:24:07,490 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 05:24:07 BoogieIcfgContainer [2018-12-31 17:24:07,490 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 17:24:07,491 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 17:24:07,491 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 17:24:07,495 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 17:24:07,495 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 05:24:05" (1/3) ... [2018-12-31 17:24:07,496 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2037e2c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 05:24:07, skipping insertion in model container [2018-12-31 17:24:07,496 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:24:06" (2/3) ... [2018-12-31 17:24:07,496 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2037e2c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 05:24:07, skipping insertion in model container [2018-12-31 17:24:07,497 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 05:24:07" (3/3) ... [2018-12-31 17:24:07,500 INFO L112 eAbstractionObserver]: Analyzing ICFG stack_longest_false-unreach-call.i [2018-12-31 17:24:07,543 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,543 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,543 WARN L317 ript$VariableManager]: TermVariabe Thread0_t1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,543 WARN L317 ript$VariableManager]: TermVariabe Thread0_t1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,544 WARN L317 ript$VariableManager]: TermVariabe Thread0_t1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,544 WARN L317 ript$VariableManager]: TermVariabe Thread0_t1_~tmp~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,544 WARN L317 ript$VariableManager]: TermVariabe Thread0_t1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,544 WARN L317 ript$VariableManager]: TermVariabe Thread0_t1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,545 WARN L317 ript$VariableManager]: TermVariabe Thread0_t1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,546 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,546 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,546 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,547 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,547 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_#t~nondet42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,548 WARN L317 ript$VariableManager]: TermVariabe Thread0_t1_~tmp~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,548 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_#t~nondet42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,548 WARN L317 ript$VariableManager]: TermVariabe Thread0_t1_~tmp~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,548 WARN L317 ript$VariableManager]: TermVariabe Thread0_t1_~tmp~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,548 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_push_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,549 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_push_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,549 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_push_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,549 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_push_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,549 WARN L317 ript$VariableManager]: TermVariabe Thread0_t1_push_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,549 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_push_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,549 WARN L317 ript$VariableManager]: TermVariabe Thread0_t1_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,551 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_push_#t~ret34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,551 WARN L317 ript$VariableManager]: TermVariabe Thread0_t1_push_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,552 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_push_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,552 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_push_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,552 WARN L317 ript$VariableManager]: TermVariabe Thread0_t1_push_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,552 WARN L317 ript$VariableManager]: TermVariabe Thread0_t1_push_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,552 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_push_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,552 WARN L317 ript$VariableManager]: TermVariabe Thread0_t1_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,554 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_push_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,554 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,554 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_push_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,554 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,555 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_push_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,555 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_#t~ret43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,556 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,556 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_push_#t~ret34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,556 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_#t~ret43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,556 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_push_#t~ret34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,557 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_#t~ret43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,557 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_#t~ret43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,557 WARN L317 ript$VariableManager]: TermVariabe Thread0_t1_push_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,557 WARN L317 ript$VariableManager]: TermVariabe Thread0_t1_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,557 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_push_#t~ret34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,559 WARN L317 ript$VariableManager]: TermVariabe Thread0_t1_push_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,559 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_#t~ret43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,560 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_#t~ret43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,560 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_push_#t~ret34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,560 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_inc_top_#t~post29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,561 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_inc_top_#t~post29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,561 WARN L317 ript$VariableManager]: TermVariabe Thread0_t1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,561 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,561 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_inc_top_#t~post29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,562 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,562 WARN L317 ript$VariableManager]: TermVariabe Thread0_t1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,562 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_inc_top_#t~post29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,562 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,562 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_push_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,565 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,565 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,565 WARN L317 ript$VariableManager]: TermVariabe Thread1_t2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,565 WARN L317 ript$VariableManager]: TermVariabe Thread1_t2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,566 WARN L317 ript$VariableManager]: TermVariabe Thread1_t2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,566 WARN L317 ript$VariableManager]: TermVariabe Thread1_t2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,567 WARN L317 ript$VariableManager]: TermVariabe Thread1_t2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,567 WARN L317 ript$VariableManager]: TermVariabe Thread1_t2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,567 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,567 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,567 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_#t~nondet45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,568 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_#t~nondet45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,568 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_pop_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,568 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_pop_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,568 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_pop_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,569 WARN L317 ript$VariableManager]: TermVariabe Thread1_t2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,569 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_#t~post44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,569 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_pop_#t~ret38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,569 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_pop_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,569 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_pop_#t~ret35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,572 WARN L317 ript$VariableManager]: TermVariabe Thread1_t2_pop_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,572 WARN L317 ript$VariableManager]: TermVariabe Thread1_t2_pop_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,572 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_pop_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,572 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_#t~post44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,572 WARN L317 ript$VariableManager]: TermVariabe Thread1_t2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,573 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_pop_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,573 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_pop_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,573 WARN L317 ript$VariableManager]: TermVariabe Thread1_t2_pop_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,573 WARN L317 ript$VariableManager]: TermVariabe Thread1_t2_pop_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,573 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_#t~post44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,574 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,574 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,574 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,574 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_pop_#t~ret35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,574 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_pop_#t~ret35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,575 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_pop_#t~ret35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,575 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_pop_#t~ret35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,575 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_pop_#t~ret35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,575 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_pop_#t~ret35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,575 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_pop_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,576 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_dec_top_#t~post30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,576 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_pop_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,576 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_dec_top_#t~post30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,576 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_pop_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,576 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_#t~ret46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,577 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_dec_top_#t~post30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,577 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_#t~ret46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,577 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_dec_top_#t~post30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,577 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_#t~ret46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,577 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_#t~ret46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,578 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,578 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_#t~ret46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,578 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_#t~ret46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,578 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,578 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,579 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_pop_#t~ret38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,579 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_pop_#t~ret38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,579 WARN L317 ript$VariableManager]: TermVariabe Thread1_t2_pop_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,579 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_pop_#t~ret38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,579 WARN L317 ript$VariableManager]: TermVariabe Thread1_t2_pop_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,580 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_pop_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,580 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_pop_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,580 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_pop_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,580 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_pop_#t~ret38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,580 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_pop_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:24:07,625 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-31 17:24:07,626 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 17:24:07,636 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-12-31 17:24:07,655 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2018-12-31 17:24:07,682 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 17:24:07,683 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 17:24:07,683 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 17:24:07,683 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 17:24:07,683 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 17:24:07,684 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 17:24:07,684 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 17:24:07,684 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 17:24:07,684 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 17:24:07,698 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 131places, 139 transitions [2018-12-31 17:24:07,973 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6506 states. [2018-12-31 17:24:07,975 INFO L276 IsEmpty]: Start isEmpty. Operand 6506 states. [2018-12-31 17:24:08,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-31 17:24:08,014 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 17:24:08,016 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 17:24:08,019 INFO L423 AbstractCegarLoop]: === Iteration 1 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 17:24:08,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 17:24:08,027 INFO L82 PathProgramCache]: Analyzing trace with hash 297050223, now seen corresponding path program 1 times [2018-12-31 17:24:08,030 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 17:24:08,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 17:24:08,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:24:08,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 17:24:08,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:24:08,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 17:24:08,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 17:24:08,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 17:24:08,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 17:24:08,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 17:24:08,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 17:24:08,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 17:24:08,437 INFO L87 Difference]: Start difference. First operand 6506 states. Second operand 3 states. [2018-12-31 17:24:08,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 17:24:08,725 INFO L93 Difference]: Finished difference Result 9854 states and 26353 transitions. [2018-12-31 17:24:08,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 17:24:08,727 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2018-12-31 17:24:08,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 17:24:08,831 INFO L225 Difference]: With dead ends: 9854 [2018-12-31 17:24:08,832 INFO L226 Difference]: Without dead ends: 9746 [2018-12-31 17:24:08,834 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 17:24:08,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9746 states. [2018-12-31 17:24:09,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9746 to 8276. [2018-12-31 17:24:09,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8276 states. [2018-12-31 17:24:09,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8276 states to 8276 states and 22334 transitions. [2018-12-31 17:24:09,303 INFO L78 Accepts]: Start accepts. Automaton has 8276 states and 22334 transitions. Word has length 46 [2018-12-31 17:24:09,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 17:24:09,304 INFO L480 AbstractCegarLoop]: Abstraction has 8276 states and 22334 transitions. [2018-12-31 17:24:09,304 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 17:24:09,304 INFO L276 IsEmpty]: Start isEmpty. Operand 8276 states and 22334 transitions. [2018-12-31 17:24:09,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-31 17:24:09,312 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 17:24:09,313 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 17:24:09,313 INFO L423 AbstractCegarLoop]: === Iteration 2 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 17:24:09,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 17:24:09,315 INFO L82 PathProgramCache]: Analyzing trace with hash 2074449763, now seen corresponding path program 1 times [2018-12-31 17:24:09,315 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 17:24:09,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 17:24:09,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:24:09,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 17:24:09,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:24:09,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 17:24:09,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 17:24:09,487 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 17:24:09,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 17:24:09,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 17:24:09,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 17:24:09,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 17:24:09,492 INFO L87 Difference]: Start difference. First operand 8276 states and 22334 transitions. Second operand 3 states. [2018-12-31 17:24:09,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 17:24:09,653 INFO L93 Difference]: Finished difference Result 7697 states and 20469 transitions. [2018-12-31 17:24:09,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 17:24:09,655 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-12-31 17:24:09,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 17:24:09,717 INFO L225 Difference]: With dead ends: 7697 [2018-12-31 17:24:09,717 INFO L226 Difference]: Without dead ends: 7556 [2018-12-31 17:24:09,718 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 17:24:09,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7556 states. [2018-12-31 17:24:09,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7556 to 7328. [2018-12-31 17:24:09,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7328 states. [2018-12-31 17:24:10,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7328 states to 7328 states and 19608 transitions. [2018-12-31 17:24:10,010 INFO L78 Accepts]: Start accepts. Automaton has 7328 states and 19608 transitions. Word has length 50 [2018-12-31 17:24:10,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 17:24:10,012 INFO L480 AbstractCegarLoop]: Abstraction has 7328 states and 19608 transitions. [2018-12-31 17:24:10,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 17:24:10,012 INFO L276 IsEmpty]: Start isEmpty. Operand 7328 states and 19608 transitions. [2018-12-31 17:24:10,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-31 17:24:10,019 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 17:24:10,019 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 17:24:10,019 INFO L423 AbstractCegarLoop]: === Iteration 3 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 17:24:10,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 17:24:10,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1770628852, now seen corresponding path program 1 times [2018-12-31 17:24:10,021 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 17:24:10,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 17:24:10,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:24:10,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 17:24:10,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:24:10,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 17:24:10,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 17:24:10,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 17:24:10,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 17:24:10,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 17:24:10,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 17:24:10,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 17:24:10,206 INFO L87 Difference]: Start difference. First operand 7328 states and 19608 transitions. Second operand 4 states. [2018-12-31 17:24:10,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 17:24:10,536 INFO L93 Difference]: Finished difference Result 10193 states and 27211 transitions. [2018-12-31 17:24:10,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 17:24:10,537 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2018-12-31 17:24:10,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 17:24:10,566 INFO L225 Difference]: With dead ends: 10193 [2018-12-31 17:24:10,566 INFO L226 Difference]: Without dead ends: 10193 [2018-12-31 17:24:10,566 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 17:24:10,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10193 states. [2018-12-31 17:24:10,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10193 to 7652. [2018-12-31 17:24:10,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7652 states. [2018-12-31 17:24:10,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7652 states to 7652 states and 20475 transitions. [2018-12-31 17:24:10,772 INFO L78 Accepts]: Start accepts. Automaton has 7652 states and 20475 transitions. Word has length 55 [2018-12-31 17:24:10,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 17:24:10,772 INFO L480 AbstractCegarLoop]: Abstraction has 7652 states and 20475 transitions. [2018-12-31 17:24:10,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 17:24:10,772 INFO L276 IsEmpty]: Start isEmpty. Operand 7652 states and 20475 transitions. [2018-12-31 17:24:10,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-31 17:24:10,784 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 17:24:10,784 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 17:24:10,784 INFO L423 AbstractCegarLoop]: === Iteration 4 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 17:24:10,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 17:24:10,785 INFO L82 PathProgramCache]: Analyzing trace with hash -1052603674, now seen corresponding path program 1 times [2018-12-31 17:24:10,785 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 17:24:10,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 17:24:10,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:24:10,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 17:24:10,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:24:10,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 17:24:11,084 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 17:24:11,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 17:24:11,085 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 17:24:11,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 17:24:11,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 17:24:11,175 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 17:24:11,250 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 17:24:11,279 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 17:24:11,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-12-31 17:24:11,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 17:24:11,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 17:24:11,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-31 17:24:11,281 INFO L87 Difference]: Start difference. First operand 7652 states and 20475 transitions. Second operand 7 states. [2018-12-31 17:24:11,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 17:24:11,813 INFO L93 Difference]: Finished difference Result 11186 states and 29819 transitions. [2018-12-31 17:24:11,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 17:24:11,814 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 78 [2018-12-31 17:24:11,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 17:24:11,841 INFO L225 Difference]: With dead ends: 11186 [2018-12-31 17:24:11,842 INFO L226 Difference]: Without dead ends: 11186 [2018-12-31 17:24:11,842 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-12-31 17:24:11,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11186 states. [2018-12-31 17:24:12,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11186 to 9716. [2018-12-31 17:24:12,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9716 states. [2018-12-31 17:24:12,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9716 states to 9716 states and 26036 transitions. [2018-12-31 17:24:12,134 INFO L78 Accepts]: Start accepts. Automaton has 9716 states and 26036 transitions. Word has length 78 [2018-12-31 17:24:12,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 17:24:12,135 INFO L480 AbstractCegarLoop]: Abstraction has 9716 states and 26036 transitions. [2018-12-31 17:24:12,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 17:24:12,135 INFO L276 IsEmpty]: Start isEmpty. Operand 9716 states and 26036 transitions. [2018-12-31 17:24:12,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-31 17:24:12,146 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 17:24:12,146 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 17:24:12,146 INFO L423 AbstractCegarLoop]: === Iteration 5 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 17:24:12,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 17:24:12,147 INFO L82 PathProgramCache]: Analyzing trace with hash -337273558, now seen corresponding path program 1 times [2018-12-31 17:24:12,147 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 17:24:12,147 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 17:24:12,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:24:12,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 17:24:12,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:24:12,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 17:24:12,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 17:24:12,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 17:24:12,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 17:24:12,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 17:24:12,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 17:24:12,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-31 17:24:12,365 INFO L87 Difference]: Start difference. First operand 9716 states and 26036 transitions. Second operand 4 states. [2018-12-31 17:24:12,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 17:24:12,433 INFO L93 Difference]: Finished difference Result 4949 states and 12535 transitions. [2018-12-31 17:24:12,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 17:24:12,435 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2018-12-31 17:24:12,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 17:24:12,449 INFO L225 Difference]: With dead ends: 4949 [2018-12-31 17:24:12,449 INFO L226 Difference]: Without dead ends: 4949 [2018-12-31 17:24:12,450 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-31 17:24:12,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4949 states. [2018-12-31 17:24:12,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4949 to 4844. [2018-12-31 17:24:12,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4844 states. [2018-12-31 17:24:12,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4844 states to 4844 states and 12270 transitions. [2018-12-31 17:24:12,561 INFO L78 Accepts]: Start accepts. Automaton has 4844 states and 12270 transitions. Word has length 82 [2018-12-31 17:24:12,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 17:24:12,561 INFO L480 AbstractCegarLoop]: Abstraction has 4844 states and 12270 transitions. [2018-12-31 17:24:12,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 17:24:12,563 INFO L276 IsEmpty]: Start isEmpty. Operand 4844 states and 12270 transitions. [2018-12-31 17:24:12,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-31 17:24:12,572 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 17:24:12,572 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 17:24:12,572 INFO L423 AbstractCegarLoop]: === Iteration 6 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 17:24:12,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 17:24:12,573 INFO L82 PathProgramCache]: Analyzing trace with hash 546566850, now seen corresponding path program 1 times [2018-12-31 17:24:12,573 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 17:24:12,573 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 17:24:12,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:24:12,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 17:24:12,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:24:12,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 17:24:13,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 17:24:13,094 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 17:24:13,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 17:24:13,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 17:24:13,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 17:24:13,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-31 17:24:13,095 INFO L87 Difference]: Start difference. First operand 4844 states and 12270 transitions. Second operand 7 states. [2018-12-31 17:24:13,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 17:24:13,616 INFO L93 Difference]: Finished difference Result 6383 states and 16124 transitions. [2018-12-31 17:24:13,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 17:24:13,617 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 83 [2018-12-31 17:24:13,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 17:24:13,634 INFO L225 Difference]: With dead ends: 6383 [2018-12-31 17:24:13,634 INFO L226 Difference]: Without dead ends: 6383 [2018-12-31 17:24:13,634 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-12-31 17:24:13,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6383 states. [2018-12-31 17:24:13,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6383 to 5249. [2018-12-31 17:24:13,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5249 states. [2018-12-31 17:24:13,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5249 states to 5249 states and 13264 transitions. [2018-12-31 17:24:13,747 INFO L78 Accepts]: Start accepts. Automaton has 5249 states and 13264 transitions. Word has length 83 [2018-12-31 17:24:13,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 17:24:13,747 INFO L480 AbstractCegarLoop]: Abstraction has 5249 states and 13264 transitions. [2018-12-31 17:24:13,747 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 17:24:13,747 INFO L276 IsEmpty]: Start isEmpty. Operand 5249 states and 13264 transitions. [2018-12-31 17:24:13,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-31 17:24:13,757 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 17:24:13,758 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 17:24:13,758 INFO L423 AbstractCegarLoop]: === Iteration 7 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 17:24:13,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 17:24:13,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1264039258, now seen corresponding path program 1 times [2018-12-31 17:24:13,759 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 17:24:13,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 17:24:13,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:24:13,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 17:24:13,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:24:13,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 17:24:14,615 WARN L181 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 21 [2018-12-31 17:24:14,773 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 21 [2018-12-31 17:24:15,536 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 35 [2018-12-31 17:24:15,886 WARN L181 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 29 [2018-12-31 17:24:16,107 WARN L181 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 20 [2018-12-31 17:24:16,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 17:24:16,928 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 17:24:16,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-12-31 17:24:16,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-31 17:24:16,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-31 17:24:16,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2018-12-31 17:24:16,929 INFO L87 Difference]: Start difference. First operand 5249 states and 13264 transitions. Second operand 18 states. [2018-12-31 17:24:17,814 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 41 [2018-12-31 17:24:18,424 WARN L181 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-12-31 17:24:18,644 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2018-12-31 17:24:18,906 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2018-12-31 17:24:19,176 WARN L181 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-12-31 17:24:19,504 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-12-31 17:24:20,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 17:24:20,073 INFO L93 Difference]: Finished difference Result 12071 states and 30657 transitions. [2018-12-31 17:24:20,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-31 17:24:20,074 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 93 [2018-12-31 17:24:20,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 17:24:20,099 INFO L225 Difference]: With dead ends: 12071 [2018-12-31 17:24:20,099 INFO L226 Difference]: Without dead ends: 12071 [2018-12-31 17:24:20,100 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 6 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=160, Invalid=710, Unknown=0, NotChecked=0, Total=870 [2018-12-31 17:24:20,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12071 states. [2018-12-31 17:24:20,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12071 to 7491. [2018-12-31 17:24:20,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7491 states. [2018-12-31 17:24:20,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7491 states to 7491 states and 19180 transitions. [2018-12-31 17:24:20,280 INFO L78 Accepts]: Start accepts. Automaton has 7491 states and 19180 transitions. Word has length 93 [2018-12-31 17:24:20,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 17:24:20,281 INFO L480 AbstractCegarLoop]: Abstraction has 7491 states and 19180 transitions. [2018-12-31 17:24:20,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-31 17:24:20,281 INFO L276 IsEmpty]: Start isEmpty. Operand 7491 states and 19180 transitions. [2018-12-31 17:24:20,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-31 17:24:20,299 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 17:24:20,299 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 17:24:20,299 INFO L423 AbstractCegarLoop]: === Iteration 8 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 17:24:20,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 17:24:20,299 INFO L82 PathProgramCache]: Analyzing trace with hash -287726246, now seen corresponding path program 2 times [2018-12-31 17:24:20,300 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 17:24:20,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 17:24:20,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:24:20,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 17:24:20,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:24:20,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 17:24:21,300 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 32 [2018-12-31 17:24:21,667 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 36 [2018-12-31 17:24:21,864 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 35 [2018-12-31 17:24:22,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 17:24:22,485 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 17:24:22,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2018-12-31 17:24:22,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-31 17:24:22,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-31 17:24:22,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=396, Unknown=0, NotChecked=0, Total=462 [2018-12-31 17:24:22,486 INFO L87 Difference]: Start difference. First operand 7491 states and 19180 transitions. Second operand 22 states. [2018-12-31 17:24:23,466 WARN L181 SmtUtils]: Spent 544.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 38 [2018-12-31 17:24:23,796 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 52 [2018-12-31 17:24:24,102 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 56 [2018-12-31 17:24:24,344 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 61 [2018-12-31 17:24:24,679 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 63 [2018-12-31 17:24:24,969 WARN L181 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 68 [2018-12-31 17:24:25,271 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2018-12-31 17:24:25,566 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 34 [2018-12-31 17:24:25,866 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2018-12-31 17:24:26,231 WARN L181 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 57 [2018-12-31 17:24:26,737 WARN L181 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 63 [2018-12-31 17:24:27,132 WARN L181 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 69 [2018-12-31 17:24:27,561 WARN L181 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 63 [2018-12-31 17:24:27,945 WARN L181 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 68 [2018-12-31 17:24:28,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 17:24:28,485 INFO L93 Difference]: Finished difference Result 17353 states and 44649 transitions. [2018-12-31 17:24:28,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-31 17:24:28,486 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 93 [2018-12-31 17:24:28,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 17:24:28,512 INFO L225 Difference]: With dead ends: 17353 [2018-12-31 17:24:28,512 INFO L226 Difference]: Without dead ends: 17353 [2018-12-31 17:24:28,513 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=289, Invalid=1117, Unknown=0, NotChecked=0, Total=1406 [2018-12-31 17:24:28,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17353 states. [2018-12-31 17:24:28,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17353 to 7497. [2018-12-31 17:24:28,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7497 states. [2018-12-31 17:24:28,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7497 states to 7497 states and 19190 transitions. [2018-12-31 17:24:28,723 INFO L78 Accepts]: Start accepts. Automaton has 7497 states and 19190 transitions. Word has length 93 [2018-12-31 17:24:28,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 17:24:28,723 INFO L480 AbstractCegarLoop]: Abstraction has 7497 states and 19190 transitions. [2018-12-31 17:24:28,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-31 17:24:28,723 INFO L276 IsEmpty]: Start isEmpty. Operand 7497 states and 19190 transitions. [2018-12-31 17:24:28,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-31 17:24:28,743 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 17:24:28,744 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 17:24:28,745 INFO L423 AbstractCegarLoop]: === Iteration 9 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 17:24:28,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 17:24:28,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1890976666, now seen corresponding path program 3 times [2018-12-31 17:24:28,746 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 17:24:28,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 17:24:28,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:24:28,751 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 17:24:28,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:24:28,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 17:24:29,314 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 21 [2018-12-31 17:24:29,703 WARN L181 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 25 [2018-12-31 17:24:30,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 17:24:30,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 17:24:30,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-12-31 17:24:30,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-31 17:24:30,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-31 17:24:30,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2018-12-31 17:24:30,896 INFO L87 Difference]: Start difference. First operand 7497 states and 19190 transitions. Second operand 18 states. [2018-12-31 17:24:32,348 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-12-31 17:24:32,703 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-12-31 17:24:33,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 17:24:33,107 INFO L93 Difference]: Finished difference Result 17521 states and 45063 transitions. [2018-12-31 17:24:33,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-31 17:24:33,108 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 93 [2018-12-31 17:24:33,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 17:24:33,128 INFO L225 Difference]: With dead ends: 17521 [2018-12-31 17:24:33,129 INFO L226 Difference]: Without dead ends: 17521 [2018-12-31 17:24:33,129 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 6 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=162, Invalid=708, Unknown=0, NotChecked=0, Total=870 [2018-12-31 17:24:33,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17521 states. [2018-12-31 17:24:33,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17521 to 7561. [2018-12-31 17:24:33,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7561 states. [2018-12-31 17:24:33,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7561 states to 7561 states and 19358 transitions. [2018-12-31 17:24:33,329 INFO L78 Accepts]: Start accepts. Automaton has 7561 states and 19358 transitions. Word has length 93 [2018-12-31 17:24:33,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 17:24:33,329 INFO L480 AbstractCegarLoop]: Abstraction has 7561 states and 19358 transitions. [2018-12-31 17:24:33,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-31 17:24:33,331 INFO L276 IsEmpty]: Start isEmpty. Operand 7561 states and 19358 transitions. [2018-12-31 17:24:33,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-31 17:24:33,342 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 17:24:33,342 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 17:24:33,343 INFO L423 AbstractCegarLoop]: === Iteration 10 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 17:24:33,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 17:24:33,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1254775254, now seen corresponding path program 4 times [2018-12-31 17:24:33,343 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 17:24:33,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 17:24:33,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:24:33,351 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 17:24:33,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:24:33,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 17:24:34,007 WARN L181 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 21 [2018-12-31 17:24:34,468 WARN L181 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 21 [2018-12-31 17:24:34,912 WARN L181 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 21 [2018-12-31 17:24:35,246 WARN L181 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 29 [2018-12-31 17:24:35,735 WARN L181 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 20 [2018-12-31 17:24:36,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 17:24:36,051 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 17:24:36,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-12-31 17:24:36,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-31 17:24:36,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-31 17:24:36,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2018-12-31 17:24:36,053 INFO L87 Difference]: Start difference. First operand 7561 states and 19358 transitions. Second operand 18 states. [2018-12-31 17:24:37,708 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2018-12-31 17:24:37,888 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-12-31 17:24:38,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 17:24:38,788 INFO L93 Difference]: Finished difference Result 17613 states and 45300 transitions. [2018-12-31 17:24:38,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-31 17:24:38,790 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 93 [2018-12-31 17:24:38,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 17:24:38,810 INFO L225 Difference]: With dead ends: 17613 [2018-12-31 17:24:38,811 INFO L226 Difference]: Without dead ends: 17613 [2018-12-31 17:24:38,811 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 6 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=168, Invalid=762, Unknown=0, NotChecked=0, Total=930 [2018-12-31 17:24:38,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17613 states. [2018-12-31 17:24:38,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17613 to 7577. [2018-12-31 17:24:38,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7577 states. [2018-12-31 17:24:39,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7577 states to 7577 states and 19400 transitions. [2018-12-31 17:24:39,006 INFO L78 Accepts]: Start accepts. Automaton has 7577 states and 19400 transitions. Word has length 93 [2018-12-31 17:24:39,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 17:24:39,006 INFO L480 AbstractCegarLoop]: Abstraction has 7577 states and 19400 transitions. [2018-12-31 17:24:39,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-31 17:24:39,006 INFO L276 IsEmpty]: Start isEmpty. Operand 7577 states and 19400 transitions. [2018-12-31 17:24:39,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-31 17:24:39,018 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 17:24:39,018 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 17:24:39,018 INFO L423 AbstractCegarLoop]: === Iteration 11 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 17:24:39,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 17:24:39,019 INFO L82 PathProgramCache]: Analyzing trace with hash -2058597740, now seen corresponding path program 5 times [2018-12-31 17:24:39,019 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 17:24:39,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 17:24:39,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:24:39,023 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 17:24:39,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:24:39,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 17:24:39,724 WARN L181 SmtUtils]: Spent 450.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 24 [2018-12-31 17:24:40,302 WARN L181 SmtUtils]: Spent 502.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 24 [2018-12-31 17:24:41,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 17:24:41,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 17:24:41,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-12-31 17:24:41,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-31 17:24:41,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-31 17:24:41,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2018-12-31 17:24:41,586 INFO L87 Difference]: Start difference. First operand 7577 states and 19400 transitions. Second operand 18 states. [2018-12-31 17:24:42,401 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 47 [2018-12-31 17:24:42,613 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 50 [2018-12-31 17:24:44,086 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2018-12-31 17:24:44,440 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-12-31 17:24:44,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 17:24:44,931 INFO L93 Difference]: Finished difference Result 17713 states and 45549 transitions. [2018-12-31 17:24:44,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-31 17:24:44,932 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 93 [2018-12-31 17:24:44,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 17:24:44,951 INFO L225 Difference]: With dead ends: 17713 [2018-12-31 17:24:44,951 INFO L226 Difference]: Without dead ends: 17713 [2018-12-31 17:24:44,952 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 6 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=177, Invalid=815, Unknown=0, NotChecked=0, Total=992 [2018-12-31 17:24:44,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17713 states. [2018-12-31 17:24:45,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17713 to 7625. [2018-12-31 17:24:45,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7625 states. [2018-12-31 17:24:45,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7625 states to 7625 states and 19526 transitions. [2018-12-31 17:24:45,110 INFO L78 Accepts]: Start accepts. Automaton has 7625 states and 19526 transitions. Word has length 93 [2018-12-31 17:24:45,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 17:24:45,110 INFO L480 AbstractCegarLoop]: Abstraction has 7625 states and 19526 transitions. [2018-12-31 17:24:45,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-31 17:24:45,111 INFO L276 IsEmpty]: Start isEmpty. Operand 7625 states and 19526 transitions. [2018-12-31 17:24:45,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-31 17:24:45,121 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 17:24:45,121 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 17:24:45,121 INFO L423 AbstractCegarLoop]: === Iteration 12 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 17:24:45,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 17:24:45,121 INFO L82 PathProgramCache]: Analyzing trace with hash -698719250, now seen corresponding path program 6 times [2018-12-31 17:24:45,122 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 17:24:45,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 17:24:45,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:24:45,123 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 17:24:45,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:24:45,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 17:24:45,676 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 31 [2018-12-31 17:24:46,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 17:24:46,958 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 17:24:46,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2018-12-31 17:24:46,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-31 17:24:46,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-31 17:24:46,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=396, Unknown=0, NotChecked=0, Total=462 [2018-12-31 17:24:46,960 INFO L87 Difference]: Start difference. First operand 7625 states and 19526 transitions. Second operand 22 states. [2018-12-31 17:24:47,631 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 49 [2018-12-31 17:24:48,133 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 53 [2018-12-31 17:24:48,365 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 56 [2018-12-31 17:24:48,541 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 38 [2018-12-31 17:24:48,770 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 41 [2018-12-31 17:24:49,040 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 58 [2018-12-31 17:24:49,290 WARN L181 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 60 [2018-12-31 17:24:49,490 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 43 [2018-12-31 17:24:49,876 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 45 [2018-12-31 17:24:50,511 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 36 [2018-12-31 17:24:50,772 WARN L181 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 47 [2018-12-31 17:24:51,156 WARN L181 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2018-12-31 17:24:51,402 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 60 [2018-12-31 17:24:51,626 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2018-12-31 17:24:51,844 WARN L181 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 58 [2018-12-31 17:24:52,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 17:24:52,841 INFO L93 Difference]: Finished difference Result 21002 states and 53934 transitions. [2018-12-31 17:24:52,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-12-31 17:24:52,842 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 93 [2018-12-31 17:24:52,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 17:24:52,866 INFO L225 Difference]: With dead ends: 21002 [2018-12-31 17:24:52,866 INFO L226 Difference]: Without dead ends: 21002 [2018-12-31 17:24:52,867 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 603 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=427, Invalid=1925, Unknown=0, NotChecked=0, Total=2352 [2018-12-31 17:24:52,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21002 states. [2018-12-31 17:24:53,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21002 to 7103. [2018-12-31 17:24:53,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7103 states. [2018-12-31 17:24:53,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7103 states to 7103 states and 18097 transitions. [2018-12-31 17:24:53,044 INFO L78 Accepts]: Start accepts. Automaton has 7103 states and 18097 transitions. Word has length 93 [2018-12-31 17:24:53,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 17:24:53,044 INFO L480 AbstractCegarLoop]: Abstraction has 7103 states and 18097 transitions. [2018-12-31 17:24:53,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-31 17:24:53,045 INFO L276 IsEmpty]: Start isEmpty. Operand 7103 states and 18097 transitions. [2018-12-31 17:24:53,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-31 17:24:53,056 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 17:24:53,056 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 17:24:53,056 INFO L423 AbstractCegarLoop]: === Iteration 13 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 17:24:53,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 17:24:53,056 INFO L82 PathProgramCache]: Analyzing trace with hash -1376724643, now seen corresponding path program 2 times [2018-12-31 17:24:53,057 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 17:24:53,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 17:24:53,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:24:53,061 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 17:24:53,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:24:53,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 17:24:53,525 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 6 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 17:24:53,526 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 17:24:53,526 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 17:24:53,548 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-31 17:24:53,615 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-31 17:24:53,615 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 17:24:53,628 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 17:24:53,782 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 6 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 17:24:53,801 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 17:24:53,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2018-12-31 17:24:53,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-31 17:24:53,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-31 17:24:53,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-12-31 17:24:53,802 INFO L87 Difference]: Start difference. First operand 7103 states and 18097 transitions. Second operand 9 states. [2018-12-31 17:24:53,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 17:24:53,943 INFO L93 Difference]: Finished difference Result 9956 states and 25242 transitions. [2018-12-31 17:24:53,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 17:24:53,944 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 110 [2018-12-31 17:24:53,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 17:24:53,955 INFO L225 Difference]: With dead ends: 9956 [2018-12-31 17:24:53,955 INFO L226 Difference]: Without dead ends: 9956 [2018-12-31 17:24:53,955 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2018-12-31 17:24:53,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9956 states. [2018-12-31 17:24:54,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9956 to 8636. [2018-12-31 17:24:54,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8636 states. [2018-12-31 17:24:54,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8636 states to 8636 states and 22048 transitions. [2018-12-31 17:24:54,073 INFO L78 Accepts]: Start accepts. Automaton has 8636 states and 22048 transitions. Word has length 110 [2018-12-31 17:24:54,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 17:24:54,073 INFO L480 AbstractCegarLoop]: Abstraction has 8636 states and 22048 transitions. [2018-12-31 17:24:54,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-31 17:24:54,074 INFO L276 IsEmpty]: Start isEmpty. Operand 8636 states and 22048 transitions. [2018-12-31 17:24:54,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-31 17:24:54,085 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 17:24:54,085 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 17:24:54,086 INFO L423 AbstractCegarLoop]: === Iteration 14 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 17:24:54,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 17:24:54,086 INFO L82 PathProgramCache]: Analyzing trace with hash 1922546161, now seen corresponding path program 1 times [2018-12-31 17:24:54,086 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 17:24:54,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 17:24:54,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:24:54,088 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 17:24:54,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:24:54,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 17:24:54,612 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 17:24:54,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 17:24:54,612 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 17:24:54,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 17:24:54,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 17:24:54,692 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 17:24:54,770 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-31 17:24:54,788 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 17:24:54,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2018-12-31 17:24:54,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 17:24:54,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 17:24:54,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-31 17:24:54,791 INFO L87 Difference]: Start difference. First operand 8636 states and 22048 transitions. Second operand 8 states. [2018-12-31 17:24:54,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 17:24:54,948 INFO L93 Difference]: Finished difference Result 11783 states and 29878 transitions. [2018-12-31 17:24:54,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-31 17:24:54,949 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 115 [2018-12-31 17:24:54,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 17:24:54,962 INFO L225 Difference]: With dead ends: 11783 [2018-12-31 17:24:54,962 INFO L226 Difference]: Without dead ends: 11783 [2018-12-31 17:24:54,963 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2018-12-31 17:24:54,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11783 states. [2018-12-31 17:24:55,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11783 to 9566. [2018-12-31 17:24:55,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9566 states. [2018-12-31 17:24:55,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9566 states to 9566 states and 24603 transitions. [2018-12-31 17:24:55,089 INFO L78 Accepts]: Start accepts. Automaton has 9566 states and 24603 transitions. Word has length 115 [2018-12-31 17:24:55,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 17:24:55,089 INFO L480 AbstractCegarLoop]: Abstraction has 9566 states and 24603 transitions. [2018-12-31 17:24:55,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 17:24:55,090 INFO L276 IsEmpty]: Start isEmpty. Operand 9566 states and 24603 transitions. [2018-12-31 17:24:55,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-31 17:24:55,098 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 17:24:55,098 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 17:24:55,099 INFO L423 AbstractCegarLoop]: === Iteration 15 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 17:24:55,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 17:24:55,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1067784455, now seen corresponding path program 1 times [2018-12-31 17:24:55,099 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 17:24:55,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 17:24:55,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:24:55,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 17:24:55,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:24:55,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 17:24:55,432 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 17:24:55,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 17:24:55,433 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 17:24:55,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 17:24:55,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 17:24:55,501 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 17:24:55,619 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 17:24:55,638 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-31 17:24:55,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 11 [2018-12-31 17:24:55,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-31 17:24:55,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-31 17:24:55,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-12-31 17:24:55,640 INFO L87 Difference]: Start difference. First operand 9566 states and 24603 transitions. Second operand 11 states. [2018-12-31 17:24:56,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 17:24:56,174 INFO L93 Difference]: Finished difference Result 11693 states and 29799 transitions. [2018-12-31 17:24:56,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-31 17:24:56,175 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 115 [2018-12-31 17:24:56,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 17:24:56,189 INFO L225 Difference]: With dead ends: 11693 [2018-12-31 17:24:56,189 INFO L226 Difference]: Without dead ends: 11693 [2018-12-31 17:24:56,189 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2018-12-31 17:24:56,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11693 states. [2018-12-31 17:24:56,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11693 to 9695. [2018-12-31 17:24:56,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9695 states. [2018-12-31 17:24:56,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9695 states to 9695 states and 24960 transitions. [2018-12-31 17:24:56,412 INFO L78 Accepts]: Start accepts. Automaton has 9695 states and 24960 transitions. Word has length 115 [2018-12-31 17:24:56,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 17:24:56,412 INFO L480 AbstractCegarLoop]: Abstraction has 9695 states and 24960 transitions. [2018-12-31 17:24:56,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-31 17:24:56,413 INFO L276 IsEmpty]: Start isEmpty. Operand 9695 states and 24960 transitions. [2018-12-31 17:24:56,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-12-31 17:24:56,422 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 17:24:56,423 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 17:24:56,423 INFO L423 AbstractCegarLoop]: === Iteration 16 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 17:24:56,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 17:24:56,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1179814500, now seen corresponding path program 1 times [2018-12-31 17:24:56,423 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 17:24:56,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 17:24:56,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:24:56,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 17:24:56,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:24:56,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 17:24:56,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 17:24:56,548 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-31 17:24:56,687 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-31 17:24:56,689 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 05:24:56 BasicIcfg [2018-12-31 17:24:56,690 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 17:24:56,691 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 17:24:56,691 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 17:24:56,691 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 17:24:56,692 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 05:24:07" (3/4) ... [2018-12-31 17:24:56,696 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-31 17:24:56,859 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 17:24:56,863 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 17:24:56,864 INFO L168 Benchmark]: Toolchain (without parser) took 51630.14 ms. Allocated memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: 860.4 MB). Free memory was 947.3 MB in the beginning and 1.6 GB in the end (delta: -682.5 MB). Peak memory consumption was 177.8 MB. Max. memory is 11.5 GB. [2018-12-31 17:24:56,866 INFO L168 Benchmark]: CDTParser took 0.15 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. [2018-12-31 17:24:56,866 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1172.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -148.8 MB). Peak memory consumption was 33.3 MB. Max. memory is 11.5 GB. [2018-12-31 17:24:56,867 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.64 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. [2018-12-31 17:24:56,867 INFO L168 Benchmark]: Boogie Preprocessor took 50.30 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. [2018-12-31 17:24:56,867 INFO L168 Benchmark]: RCFGBuilder took 954.39 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: 39.7 MB). Peak memory consumption was 39.7 MB. Max. memory is 11.5 GB. [2018-12-31 17:24:56,875 INFO L168 Benchmark]: TraceAbstraction took 49199.65 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 709.4 MB). Free memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: -592.7 MB). Peak memory consumption was 116.6 MB. Max. memory is 11.5 GB. [2018-12-31 17:24:56,875 INFO L168 Benchmark]: Witness Printer took 172.61 ms. Allocated memory is still 1.9 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 19.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 11.5 GB. [2018-12-31 17:24:56,883 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.15 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 1172.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -148.8 MB). Peak memory consumption was 33.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 74.64 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. * Boogie Preprocessor took 50.30 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 954.39 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: 39.7 MB). Peak memory consumption was 39.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 49199.65 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 709.4 MB). Free memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: -592.7 MB). Peak memory consumption was 116.6 MB. Max. memory is 11.5 GB. * Witness Printer took 172.61 ms. Allocated memory is still 1.9 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 19.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 920]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L914] -1 static int top=0; VAL [top=0] [L915] -1 static unsigned int arr[(800)]; VAL [arr={2:0}, top=0] [L916] -1 pthread_mutex_t m; VAL [arr={2:0}, m={1:0}, top=0] [L917] -1 _Bool flag=(0); VAL [arr={2:0}, flag=0, m={1:0}, top=0] [L999] -1 pthread_t id1, id2; VAL [arr={2:0}, flag=0, m={1:0}, top=0] [L1001] FCALL, FORK -1 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [arr={2:0}, flag=0, m={1:0}, top=0] [L968] 0 int i; VAL [arr={2:0}, flag=0, m={1:0}, top=0] [L969] 0 unsigned int tmp; VAL [arr={2:0}, flag=0, m={1:0}, top=0] [L970] 0 i=0 VAL [arr={2:0}, flag=0, m={1:0}, top=0] [L970] COND TRUE 0 i<(800) VAL [arr={2:0}, flag=0, m={1:0}, top=0] [L973] 0 tmp = __VERIFIER_nondet_uint() VAL [arr={2:0}, flag=0, m={1:0}, top=0] [L940] COND FALSE 0 !(top==(800)) VAL [arr={2:0}, flag=0, m={1:0}, top=0] [L932] 0 return top; VAL [arr={2:0}, flag=0, m={1:0}, top=0] [L1002] FCALL, FORK -1 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [arr={2:0}, flag=0, m={1:0}, top=0] [L984] 1 int i; VAL [arr={2:0}, flag=0, m={1:0}, top=0] [L985] 1 i=0 VAL [arr={2:0}, flag=0, m={1:0}, top=0] [L985] COND TRUE 1 i<(800) VAL [arr={2:0}, flag=0, m={1:0}, top=0] [L947] 0 stack[get_top()] = x VAL [arr={2:0}, flag=0, m={1:0}, top=0] [L924] 0 top++ VAL [arr={2:0}, flag=0, m={1:0}, top=1] [L950] 0 return 0; VAL [arr={2:0}, flag=0, m={1:0}, top=1] [L975] COND FALSE 0 !(push(arr,tmp)==(-1)) VAL [arr={2:0}, flag=0, m={1:0}, top=1] [L977] 0 flag=(1) VAL [arr={2:0}, flag=1, m={1:0}, top=1] [L988] COND TRUE 1 \read(flag) VAL [arr={2:0}, flag=1, m={1:0}, top=1] [L932] 1 return top; VAL [arr={2:0}, flag=1, m={1:0}, top=1] [L954] COND FALSE 1 !(get_top()==0) VAL [arr={2:0}, flag=1, m={1:0}, top=1] [L928] 1 top-- VAL [arr={2:0}, flag=1, m={1:0}, top=0] [L932] 1 return top; VAL [arr={2:0}, flag=1, m={1:0}, top=0] [L962] EXPR 1 stack[get_top()] VAL [arr={2:0}, flag=1, m={1:0}, top=0] [L962] 1 return stack[get_top()]; VAL [arr={2:0}, flag=1, m={1:0}, top=0] [L990] COND FALSE 1 !(!(pop(arr)!=(-2))) VAL [arr={2:0}, flag=1, m={1:0}, top=0] [L985] 1 i++ VAL [arr={2:0}, flag=1, m={1:0}, top=0] [L985] COND TRUE 1 i<(800) VAL [arr={2:0}, flag=1, m={1:0}, top=0] [L988] COND TRUE 1 \read(flag) VAL [arr={2:0}, flag=1, m={1:0}, top=0] [L932] 1 return top; VAL [arr={2:0}, flag=1, m={1:0}, top=0] [L954] COND TRUE 1 get_top()==0 VAL [arr={2:0}, flag=1, m={1:0}, top=0] [L957] 1 return (-2); VAL [arr={2:0}, flag=1, m={1:0}, top=0] [L990] COND TRUE 1 !(pop(arr)!=(-2)) VAL [arr={2:0}, flag=1, m={1:0}, top=0] [L920] 1 __VERIFIER_error() VAL [arr={2:0}, flag=1, m={1:0}, top=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 221 locations, 4 error locations. UNSAFE Result, 49.0s OverallTime, 16 OverallIterations, 3 TraceHistogramMax, 26.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3032 SDtfs, 7105 SDslu, 21190 SDs, 0 SdLazy, 4299 SolverSat, 165 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 728 GetRequests, 453 SyntacticMatches, 16 SemanticMatches, 259 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1775 ImplicationChecksByTransitivity, 29.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9716occurred in iteration=4, 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: 3.0s AutomataMinimizationTime, 15 MinimizatonAttempts, 70902 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 17.2s InterpolantComputationTime, 1827 NumberOfCodeBlocks, 1827 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1691 ConstructedInterpolants, 0 QuantifiedInterpolants, 2998303 SizeOfPredicates, 20 NumberOfNonLiveVariables, 973 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 19 InterpolantComputations, 12 PerfectInterpolantSequences, 72/242 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...