./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-nondet/nondet-loop-bound-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b5699aa Calling Ultimate with: /usr/bin/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 ../sv-benchmarks/c/pthread-nondet/nondet-loop-bound-1.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 18f8c11d6085f6594f0f2021411e68b8ac706f42 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-6b5699a [2019-11-21 21:47:45,869 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-21 21:47:45,871 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-21 21:47:45,883 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-21 21:47:45,884 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-21 21:47:45,885 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-21 21:47:45,886 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-21 21:47:45,888 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-21 21:47:45,890 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-21 21:47:45,891 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-21 21:47:45,892 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-21 21:47:45,894 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-21 21:47:45,894 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-21 21:47:45,895 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-21 21:47:45,896 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-21 21:47:45,897 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-21 21:47:45,900 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-21 21:47:45,901 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-21 21:47:45,904 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-21 21:47:45,910 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-21 21:47:45,913 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-21 21:47:45,915 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-21 21:47:45,917 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-21 21:47:45,918 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-21 21:47:45,922 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-21 21:47:45,924 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-21 21:47:45,924 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-21 21:47:45,925 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-21 21:47:45,926 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-21 21:47:45,927 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-21 21:47:45,928 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-21 21:47:45,929 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-21 21:47:45,930 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-21 21:47:45,931 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-21 21:47:45,934 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-21 21:47:45,936 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-21 21:47:45,937 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-21 21:47:45,938 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-21 21:47:45,938 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-21 21:47:45,941 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-21 21:47:45,943 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-21 21:47:45,945 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-21 21:47:45,965 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-21 21:47:45,966 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-21 21:47:45,967 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-21 21:47:45,968 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-21 21:47:45,968 INFO L138 SettingsManager]: * Use SBE=true [2019-11-21 21:47:45,969 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-21 21:47:45,969 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-21 21:47:45,969 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-21 21:47:45,970 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-21 21:47:45,970 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-21 21:47:45,971 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-21 21:47:45,971 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-21 21:47:45,972 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-21 21:47:45,972 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-21 21:47:45,972 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-21 21:47:45,973 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-21 21:47:45,973 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-21 21:47:45,973 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-21 21:47:45,974 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-21 21:47:45,975 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-21 21:47:45,976 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-21 21:47:45,977 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-21 21:47:45,977 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-21 21:47:45,977 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-21 21:47:45,977 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-21 21:47:45,979 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-21 21:47:45,979 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-21 21:47:45,980 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-21 21:47:45,980 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> 18f8c11d6085f6594f0f2021411e68b8ac706f42 [2019-11-21 21:47:46,268 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-21 21:47:46,281 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-21 21:47:46,284 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-21 21:47:46,286 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-21 21:47:46,286 INFO L275 PluginConnector]: CDTParser initialized [2019-11-21 21:47:46,287 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-nondet/nondet-loop-bound-1.i [2019-11-21 21:47:46,362 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7ced1b94/d579c50770ff4409b5d10f94ed26d001/FLAG78f34b04a [2019-11-21 21:47:46,891 INFO L306 CDTParser]: Found 1 translation units. [2019-11-21 21:47:46,892 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-nondet/nondet-loop-bound-1.i [2019-11-21 21:47:46,906 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7ced1b94/d579c50770ff4409b5d10f94ed26d001/FLAG78f34b04a [2019-11-21 21:47:47,187 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7ced1b94/d579c50770ff4409b5d10f94ed26d001 [2019-11-21 21:47:47,191 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-21 21:47:47,193 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-21 21:47:47,194 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-21 21:47:47,194 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-21 21:47:47,198 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-21 21:47:47,199 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 09:47:47" (1/1) ... [2019-11-21 21:47:47,202 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ee02efd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:47:47, skipping insertion in model container [2019-11-21 21:47:47,203 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 09:47:47" (1/1) ... [2019-11-21 21:47:47,211 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-21 21:47:47,260 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-21 21:47:47,816 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-21 21:47:47,827 INFO L201 MainTranslator]: Completed pre-run [2019-11-21 21:47:47,882 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-21 21:47:47,962 INFO L205 MainTranslator]: Completed translation [2019-11-21 21:47:47,963 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:47:47 WrapperNode [2019-11-21 21:47:47,963 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-21 21:47:47,964 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-21 21:47:47,964 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-21 21:47:47,964 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-21 21:47:47,973 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:47:47" (1/1) ... [2019-11-21 21:47:47,989 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:47:47" (1/1) ... [2019-11-21 21:47:48,012 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-21 21:47:48,012 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-21 21:47:48,012 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-21 21:47:48,013 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-21 21:47:48,022 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:47:47" (1/1) ... [2019-11-21 21:47:48,022 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:47:47" (1/1) ... [2019-11-21 21:47:48,025 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:47:47" (1/1) ... [2019-11-21 21:47:48,026 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:47:47" (1/1) ... [2019-11-21 21:47:48,031 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:47:47" (1/1) ... [2019-11-21 21:47:48,035 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:47:47" (1/1) ... [2019-11-21 21:47:48,037 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:47:47" (1/1) ... [2019-11-21 21:47:48,040 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-21 21:47:48,040 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-21 21:47:48,041 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-21 21:47:48,041 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-21 21:47:48,042 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:47:47" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-21 21:47:48,103 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2019-11-21 21:47:48,103 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2019-11-21 21:47:48,104 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2019-11-21 21:47:48,104 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2019-11-21 21:47:48,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-21 21:47:48,104 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-21 21:47:48,104 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-21 21:47:48,105 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-21 21:47:48,105 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-21 21:47:48,107 WARN L202 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-11-21 21:47:48,464 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-21 21:47:48,465 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-21 21:47:48,466 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 09:47:48 BoogieIcfgContainer [2019-11-21 21:47:48,466 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-21 21:47:48,467 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-21 21:47:48,468 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-21 21:47:48,471 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-21 21:47:48,471 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 09:47:47" (1/3) ... [2019-11-21 21:47:48,472 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a3ff0d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 09:47:48, skipping insertion in model container [2019-11-21 21:47:48,472 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:47:47" (2/3) ... [2019-11-21 21:47:48,472 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a3ff0d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 09:47:48, skipping insertion in model container [2019-11-21 21:47:48,473 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 09:47:48" (3/3) ... [2019-11-21 21:47:48,474 INFO L109 eAbstractionObserver]: Analyzing ICFG nondet-loop-bound-1.i [2019-11-21 21:47:48,520 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-21 21:47:48,521 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-21 21:47:48,521 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-21 21:47:48,521 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-21 21:47:48,522 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-21 21:47:48,522 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-21 21:47:48,522 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-21 21:47:48,524 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-21 21:47:48,524 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-21 21:47:48,525 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-21 21:47:48,525 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-21 21:47:48,526 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-21 21:47:48,526 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-21 21:47:48,528 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-21 21:47:48,528 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-21 21:47:48,529 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-21 21:47:48,529 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-21 21:47:48,529 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-21 21:47:48,530 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-21 21:47:48,530 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-21 21:47:48,530 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-21 21:47:48,531 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-21 21:47:48,531 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-21 21:47:48,532 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-21 21:47:48,532 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-21 21:47:48,532 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-21 21:47:48,533 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-21 21:47:48,533 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-21 21:47:48,533 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-21 21:47:48,534 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-21 21:47:48,534 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-21 21:47:48,536 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-21 21:47:48,536 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-21 21:47:48,536 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-21 21:47:48,537 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-21 21:47:48,538 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-21 21:47:48,538 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-21 21:47:48,538 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-21 21:47:48,539 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-21 21:47:48,539 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-21 21:47:48,540 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-21 21:47:48,541 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-21 21:47:48,541 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-21 21:47:48,542 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-21 21:47:48,542 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-21 21:47:48,542 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-21 21:47:48,542 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-21 21:47:48,543 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-21 21:47:48,544 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-21 21:47:48,544 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-21 21:47:48,544 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-21 21:47:48,562 WARN L142 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-21 21:47:48,562 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-21 21:47:48,570 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-11-21 21:47:48,579 INFO L249 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-11-21 21:47:48,599 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-21 21:47:48,600 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-21 21:47:48,600 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-21 21:47:48,600 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-21 21:47:48,600 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-21 21:47:48,600 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-21 21:47:48,601 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-21 21:47:48,601 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-21 21:47:48,613 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 93 places, 83 transitions [2019-11-21 21:47:52,251 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34966 states. [2019-11-21 21:47:52,253 INFO L276 IsEmpty]: Start isEmpty. Operand 34966 states. [2019-11-21 21:47:52,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-21 21:47:52,260 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 21:47:52,261 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 21:47:52,261 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-21 21:47:52,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 21:47:52,266 INFO L82 PathProgramCache]: Analyzing trace with hash -902852624, now seen corresponding path program 1 times [2019-11-21 21:47:52,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-21 21:47:52,274 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811232479] [2019-11-21 21:47:52,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-21 21:47:52,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 21:47:52,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 21:47:52,540 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811232479] [2019-11-21 21:47:52,543 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-21 21:47:52,543 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-21 21:47:52,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839655539] [2019-11-21 21:47:52,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-21 21:47:52,549 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-21 21:47:52,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-21 21:47:52,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-21 21:47:52,564 INFO L87 Difference]: Start difference. First operand 34966 states. Second operand 6 states. [2019-11-21 21:47:53,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 21:47:53,734 INFO L93 Difference]: Finished difference Result 45470 states and 184962 transitions. [2019-11-21 21:47:53,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-21 21:47:53,736 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-11-21 21:47:53,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 21:47:53,933 INFO L225 Difference]: With dead ends: 45470 [2019-11-21 21:47:53,933 INFO L226 Difference]: Without dead ends: 20819 [2019-11-21 21:47:53,935 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-21 21:47:54,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20819 states. [2019-11-21 21:47:54,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20819 to 20819. [2019-11-21 21:47:54,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20819 states. [2019-11-21 21:47:55,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20819 states to 20819 states and 82977 transitions. [2019-11-21 21:47:55,007 INFO L78 Accepts]: Start accepts. Automaton has 20819 states and 82977 transitions. Word has length 25 [2019-11-21 21:47:55,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 21:47:55,009 INFO L462 AbstractCegarLoop]: Abstraction has 20819 states and 82977 transitions. [2019-11-21 21:47:55,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-21 21:47:55,010 INFO L276 IsEmpty]: Start isEmpty. Operand 20819 states and 82977 transitions. [2019-11-21 21:47:55,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-21 21:47:55,020 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 21:47:55,021 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 21:47:55,021 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-21 21:47:55,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 21:47:55,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1950343494, now seen corresponding path program 1 times [2019-11-21 21:47:55,022 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-21 21:47:55,023 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323961477] [2019-11-21 21:47:55,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-21 21:47:55,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 21:47:55,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 21:47:55,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323961477] [2019-11-21 21:47:55,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-21 21:47:55,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-21 21:47:55,230 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948527194] [2019-11-21 21:47:55,233 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-21 21:47:55,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-21 21:47:55,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-21 21:47:55,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-21 21:47:55,234 INFO L87 Difference]: Start difference. First operand 20819 states and 82977 transitions. Second operand 8 states. [2019-11-21 21:47:56,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 21:47:56,103 INFO L93 Difference]: Finished difference Result 35069 states and 134196 transitions. [2019-11-21 21:47:56,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-21 21:47:56,104 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2019-11-21 21:47:56,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 21:47:56,224 INFO L225 Difference]: With dead ends: 35069 [2019-11-21 21:47:56,224 INFO L226 Difference]: Without dead ends: 28819 [2019-11-21 21:47:56,225 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-11-21 21:47:56,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28819 states. [2019-11-21 21:47:56,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28819 to 19249. [2019-11-21 21:47:56,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19249 states. [2019-11-21 21:47:57,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19249 states to 19249 states and 75732 transitions. [2019-11-21 21:47:57,047 INFO L78 Accepts]: Start accepts. Automaton has 19249 states and 75732 transitions. Word has length 34 [2019-11-21 21:47:57,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 21:47:57,048 INFO L462 AbstractCegarLoop]: Abstraction has 19249 states and 75732 transitions. [2019-11-21 21:47:57,048 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-21 21:47:57,048 INFO L276 IsEmpty]: Start isEmpty. Operand 19249 states and 75732 transitions. [2019-11-21 21:47:57,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-21 21:47:57,052 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 21:47:57,053 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-21 21:47:57,053 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-21 21:47:57,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 21:47:57,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1707268840, now seen corresponding path program 1 times [2019-11-21 21:47:57,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-21 21:47:57,055 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048868606] [2019-11-21 21:47:57,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-21 21:47:57,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 21:47:57,167 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-21 21:47:57,168 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048868606] [2019-11-21 21:47:57,168 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-21 21:47:57,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-21 21:47:57,169 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851224037] [2019-11-21 21:47:57,169 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-21 21:47:57,169 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-21 21:47:57,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-21 21:47:57,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-21 21:47:57,170 INFO L87 Difference]: Start difference. First operand 19249 states and 75732 transitions. Second operand 8 states. [2019-11-21 21:47:57,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 21:47:57,598 INFO L93 Difference]: Finished difference Result 31729 states and 119978 transitions. [2019-11-21 21:47:57,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-21 21:47:57,599 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2019-11-21 21:47:57,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 21:47:57,694 INFO L225 Difference]: With dead ends: 31729 [2019-11-21 21:47:57,695 INFO L226 Difference]: Without dead ends: 25345 [2019-11-21 21:47:57,696 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-11-21 21:47:57,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25345 states. [2019-11-21 21:47:58,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25345 to 17369. [2019-11-21 21:47:58,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17369 states. [2019-11-21 21:47:58,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17369 states to 17369 states and 66928 transitions. [2019-11-21 21:47:58,995 INFO L78 Accepts]: Start accepts. Automaton has 17369 states and 66928 transitions. Word has length 41 [2019-11-21 21:47:58,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 21:47:58,998 INFO L462 AbstractCegarLoop]: Abstraction has 17369 states and 66928 transitions. [2019-11-21 21:47:58,998 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-21 21:47:58,998 INFO L276 IsEmpty]: Start isEmpty. Operand 17369 states and 66928 transitions. [2019-11-21 21:47:59,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-21 21:47:59,007 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 21:47:59,009 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-21 21:47:59,009 INFO L410 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-21 21:47:59,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 21:47:59,010 INFO L82 PathProgramCache]: Analyzing trace with hash -539445418, now seen corresponding path program 1 times [2019-11-21 21:47:59,010 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-21 21:47:59,010 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831766817] [2019-11-21 21:47:59,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-21 21:47:59,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 21:47:59,213 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 21:47:59,214 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831766817] [2019-11-21 21:47:59,215 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2118757693] [2019-11-21 21:47:59,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-21 21:47:59,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 21:47:59,294 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-21 21:47:59,301 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 21:47:59,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 21:47:59,529 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 21:47:59,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-21 21:47:59,530 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2019-11-21 21:47:59,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210414913] [2019-11-21 21:47:59,531 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-21 21:47:59,532 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-21 21:47:59,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-21 21:47:59,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2019-11-21 21:47:59,533 INFO L87 Difference]: Start difference. First operand 17369 states and 66928 transitions. Second operand 18 states. [2019-11-21 21:48:00,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 21:48:00,433 INFO L93 Difference]: Finished difference Result 34675 states and 128863 transitions. [2019-11-21 21:48:00,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-21 21:48:00,434 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 45 [2019-11-21 21:48:00,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 21:48:00,584 INFO L225 Difference]: With dead ends: 34675 [2019-11-21 21:48:00,584 INFO L226 Difference]: Without dead ends: 32095 [2019-11-21 21:48:00,585 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=222, Invalid=770, Unknown=0, NotChecked=0, Total=992 [2019-11-21 21:48:00,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32095 states. [2019-11-21 21:48:01,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32095 to 16565. [2019-11-21 21:48:01,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16565 states. [2019-11-21 21:48:01,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16565 states to 16565 states and 63900 transitions. [2019-11-21 21:48:01,974 INFO L78 Accepts]: Start accepts. Automaton has 16565 states and 63900 transitions. Word has length 45 [2019-11-21 21:48:01,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 21:48:01,975 INFO L462 AbstractCegarLoop]: Abstraction has 16565 states and 63900 transitions. [2019-11-21 21:48:01,975 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-21 21:48:01,975 INFO L276 IsEmpty]: Start isEmpty. Operand 16565 states and 63900 transitions. [2019-11-21 21:48:01,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-21 21:48:01,980 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 21:48:01,980 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-21 21:48:02,192 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-21 21:48:02,193 INFO L410 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-21 21:48:02,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 21:48:02,193 INFO L82 PathProgramCache]: Analyzing trace with hash -548416362, now seen corresponding path program 2 times [2019-11-21 21:48:02,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-21 21:48:02,194 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142374128] [2019-11-21 21:48:02,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-21 21:48:02,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 21:48:02,344 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-21 21:48:02,345 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142374128] [2019-11-21 21:48:02,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-21 21:48:02,345 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-21 21:48:02,346 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349612934] [2019-11-21 21:48:02,346 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-21 21:48:02,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-21 21:48:02,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-21 21:48:02,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-21 21:48:02,347 INFO L87 Difference]: Start difference. First operand 16565 states and 63900 transitions. Second operand 10 states. [2019-11-21 21:48:02,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 21:48:02,876 INFO L93 Difference]: Finished difference Result 32695 states and 121435 transitions. [2019-11-21 21:48:02,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-21 21:48:02,882 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2019-11-21 21:48:02,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 21:48:02,969 INFO L225 Difference]: With dead ends: 32695 [2019-11-21 21:48:02,969 INFO L226 Difference]: Without dead ends: 29971 [2019-11-21 21:48:02,970 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2019-11-21 21:48:03,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29971 states. [2019-11-21 21:48:03,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29971 to 13517. [2019-11-21 21:48:03,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13517 states. [2019-11-21 21:48:03,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13517 states to 13517 states and 52896 transitions. [2019-11-21 21:48:03,536 INFO L78 Accepts]: Start accepts. Automaton has 13517 states and 52896 transitions. Word has length 45 [2019-11-21 21:48:03,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 21:48:03,537 INFO L462 AbstractCegarLoop]: Abstraction has 13517 states and 52896 transitions. [2019-11-21 21:48:03,537 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-21 21:48:03,537 INFO L276 IsEmpty]: Start isEmpty. Operand 13517 states and 52896 transitions. [2019-11-21 21:48:03,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-21 21:48:03,555 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 21:48:03,555 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-11-21 21:48:03,555 INFO L410 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-21 21:48:03,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 21:48:03,556 INFO L82 PathProgramCache]: Analyzing trace with hash 337207879, now seen corresponding path program 1 times [2019-11-21 21:48:03,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-21 21:48:03,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133900942] [2019-11-21 21:48:03,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-21 21:48:03,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 21:48:03,673 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-21 21:48:03,674 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133900942] [2019-11-21 21:48:03,675 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-21 21:48:03,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-21 21:48:03,676 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081758734] [2019-11-21 21:48:03,677 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-21 21:48:03,677 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-21 21:48:03,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-21 21:48:03,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-21 21:48:03,678 INFO L87 Difference]: Start difference. First operand 13517 states and 52896 transitions. Second operand 8 states. [2019-11-21 21:48:03,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 21:48:03,992 INFO L93 Difference]: Finished difference Result 22637 states and 85048 transitions. [2019-11-21 21:48:03,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-21 21:48:03,993 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 48 [2019-11-21 21:48:03,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 21:48:04,038 INFO L225 Difference]: With dead ends: 22637 [2019-11-21 21:48:04,038 INFO L226 Difference]: Without dead ends: 16787 [2019-11-21 21:48:04,039 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-11-21 21:48:04,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16787 states. [2019-11-21 21:48:04,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16787 to 12107. [2019-11-21 21:48:04,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12107 states. [2019-11-21 21:48:04,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12107 states to 12107 states and 45415 transitions. [2019-11-21 21:48:04,331 INFO L78 Accepts]: Start accepts. Automaton has 12107 states and 45415 transitions. Word has length 48 [2019-11-21 21:48:04,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 21:48:04,332 INFO L462 AbstractCegarLoop]: Abstraction has 12107 states and 45415 transitions. [2019-11-21 21:48:04,332 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-21 21:48:04,332 INFO L276 IsEmpty]: Start isEmpty. Operand 12107 states and 45415 transitions. [2019-11-21 21:48:04,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-21 21:48:04,347 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 21:48:04,347 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-11-21 21:48:04,348 INFO L410 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-21 21:48:04,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 21:48:04,348 INFO L82 PathProgramCache]: Analyzing trace with hash -297898423, now seen corresponding path program 1 times [2019-11-21 21:48:04,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-21 21:48:04,349 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164232519] [2019-11-21 21:48:04,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-21 21:48:04,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 21:48:04,481 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-21 21:48:04,482 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164232519] [2019-11-21 21:48:04,483 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1079322252] [2019-11-21 21:48:04,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-21 21:48:04,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 21:48:04,556 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-21 21:48:04,565 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 21:48:04,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 21:48:04,721 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-21 21:48:04,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-21 21:48:04,722 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2019-11-21 21:48:04,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301239567] [2019-11-21 21:48:04,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-21 21:48:04,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-21 21:48:04,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-21 21:48:04,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2019-11-21 21:48:04,725 INFO L87 Difference]: Start difference. First operand 12107 states and 45415 transitions. Second operand 18 states. [2019-11-21 21:48:05,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 21:48:05,461 INFO L93 Difference]: Finished difference Result 22447 states and 81039 transitions. [2019-11-21 21:48:05,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-21 21:48:05,462 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 52 [2019-11-21 21:48:05,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 21:48:05,518 INFO L225 Difference]: With dead ends: 22447 [2019-11-21 21:48:05,518 INFO L226 Difference]: Without dead ends: 19931 [2019-11-21 21:48:05,519 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=222, Invalid=770, Unknown=0, NotChecked=0, Total=992 [2019-11-21 21:48:05,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19931 states. [2019-11-21 21:48:05,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19931 to 12075. [2019-11-21 21:48:05,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12075 states. [2019-11-21 21:48:06,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12075 states to 12075 states and 44995 transitions. [2019-11-21 21:48:06,216 INFO L78 Accepts]: Start accepts. Automaton has 12075 states and 44995 transitions. Word has length 52 [2019-11-21 21:48:06,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 21:48:06,217 INFO L462 AbstractCegarLoop]: Abstraction has 12075 states and 44995 transitions. [2019-11-21 21:48:06,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-21 21:48:06,217 INFO L276 IsEmpty]: Start isEmpty. Operand 12075 states and 44995 transitions. [2019-11-21 21:48:06,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-21 21:48:06,234 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 21:48:06,234 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-11-21 21:48:06,437 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-21 21:48:06,438 INFO L410 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-21 21:48:06,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 21:48:06,438 INFO L82 PathProgramCache]: Analyzing trace with hash 2054262665, now seen corresponding path program 2 times [2019-11-21 21:48:06,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-21 21:48:06,439 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278053277] [2019-11-21 21:48:06,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-21 21:48:06,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 21:48:06,530 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-21 21:48:06,531 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278053277] [2019-11-21 21:48:06,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-21 21:48:06,531 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-21 21:48:06,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386003154] [2019-11-21 21:48:06,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-21 21:48:06,532 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-21 21:48:06,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-21 21:48:06,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-21 21:48:06,533 INFO L87 Difference]: Start difference. First operand 12075 states and 44995 transitions. Second operand 10 states. [2019-11-21 21:48:06,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 21:48:06,975 INFO L93 Difference]: Finished difference Result 20531 states and 73675 transitions. [2019-11-21 21:48:06,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-21 21:48:06,975 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 52 [2019-11-21 21:48:06,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 21:48:07,008 INFO L225 Difference]: With dead ends: 20531 [2019-11-21 21:48:07,008 INFO L226 Difference]: Without dead ends: 17621 [2019-11-21 21:48:07,009 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2019-11-21 21:48:07,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17621 states. [2019-11-21 21:48:07,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17621 to 9225. [2019-11-21 21:48:07,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9225 states. [2019-11-21 21:48:07,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9225 states to 9225 states and 34430 transitions. [2019-11-21 21:48:07,244 INFO L78 Accepts]: Start accepts. Automaton has 9225 states and 34430 transitions. Word has length 52 [2019-11-21 21:48:07,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 21:48:07,244 INFO L462 AbstractCegarLoop]: Abstraction has 9225 states and 34430 transitions. [2019-11-21 21:48:07,244 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-21 21:48:07,244 INFO L276 IsEmpty]: Start isEmpty. Operand 9225 states and 34430 transitions. [2019-11-21 21:48:07,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-21 21:48:07,256 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 21:48:07,256 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-11-21 21:48:07,257 INFO L410 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-21 21:48:07,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 21:48:07,257 INFO L82 PathProgramCache]: Analyzing trace with hash 795640873, now seen corresponding path program 1 times [2019-11-21 21:48:07,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-21 21:48:07,258 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741421310] [2019-11-21 21:48:07,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-21 21:48:07,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 21:48:07,348 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-21 21:48:07,349 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741421310] [2019-11-21 21:48:07,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-21 21:48:07,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-21 21:48:07,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196784715] [2019-11-21 21:48:07,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-21 21:48:07,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-21 21:48:07,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-21 21:48:07,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-21 21:48:07,351 INFO L87 Difference]: Start difference. First operand 9225 states and 34430 transitions. Second operand 10 states. [2019-11-21 21:48:07,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 21:48:07,755 INFO L93 Difference]: Finished difference Result 16565 states and 59274 transitions. [2019-11-21 21:48:07,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-21 21:48:07,756 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 52 [2019-11-21 21:48:07,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 21:48:07,782 INFO L225 Difference]: With dead ends: 16565 [2019-11-21 21:48:07,782 INFO L226 Difference]: Without dead ends: 13655 [2019-11-21 21:48:07,782 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=316, Unknown=0, NotChecked=0, Total=420 [2019-11-21 21:48:07,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13655 states. [2019-11-21 21:48:07,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13655 to 9375. [2019-11-21 21:48:07,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9375 states. [2019-11-21 21:48:07,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9375 states to 9375 states and 34645 transitions. [2019-11-21 21:48:07,985 INFO L78 Accepts]: Start accepts. Automaton has 9375 states and 34645 transitions. Word has length 52 [2019-11-21 21:48:07,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 21:48:07,986 INFO L462 AbstractCegarLoop]: Abstraction has 9375 states and 34645 transitions. [2019-11-21 21:48:07,986 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-21 21:48:07,986 INFO L276 IsEmpty]: Start isEmpty. Operand 9375 states and 34645 transitions. [2019-11-21 21:48:07,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-21 21:48:07,994 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 21:48:07,994 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-11-21 21:48:07,994 INFO L410 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-21 21:48:07,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 21:48:07,995 INFO L82 PathProgramCache]: Analyzing trace with hash 844196999, now seen corresponding path program 2 times [2019-11-21 21:48:07,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-21 21:48:07,995 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811660125] [2019-11-21 21:48:07,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-21 21:48:08,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 21:48:08,078 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-21 21:48:08,078 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811660125] [2019-11-21 21:48:08,079 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-21 21:48:08,079 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-21 21:48:08,079 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661494188] [2019-11-21 21:48:08,080 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-21 21:48:08,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-21 21:48:08,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-21 21:48:08,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-21 21:48:08,081 INFO L87 Difference]: Start difference. First operand 9375 states and 34645 transitions. Second operand 10 states. [2019-11-21 21:48:08,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 21:48:08,538 INFO L93 Difference]: Finished difference Result 14255 states and 50473 transitions. [2019-11-21 21:48:08,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-21 21:48:08,539 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 52 [2019-11-21 21:48:08,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 21:48:08,558 INFO L225 Difference]: With dead ends: 14255 [2019-11-21 21:48:08,558 INFO L226 Difference]: Without dead ends: 11219 [2019-11-21 21:48:08,559 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=316, Unknown=0, NotChecked=0, Total=420 [2019-11-21 21:48:08,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11219 states. [2019-11-21 21:48:08,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11219 to 7203. [2019-11-21 21:48:08,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7203 states. [2019-11-21 21:48:08,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7203 states to 7203 states and 26359 transitions. [2019-11-21 21:48:08,691 INFO L78 Accepts]: Start accepts. Automaton has 7203 states and 26359 transitions. Word has length 52 [2019-11-21 21:48:08,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 21:48:08,691 INFO L462 AbstractCegarLoop]: Abstraction has 7203 states and 26359 transitions. [2019-11-21 21:48:08,692 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-21 21:48:08,692 INFO L276 IsEmpty]: Start isEmpty. Operand 7203 states and 26359 transitions. [2019-11-21 21:48:08,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-21 21:48:08,702 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 21:48:08,702 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-11-21 21:48:08,702 INFO L410 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-21 21:48:08,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 21:48:08,703 INFO L82 PathProgramCache]: Analyzing trace with hash 407355179, now seen corresponding path program 1 times [2019-11-21 21:48:08,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-21 21:48:08,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734630652] [2019-11-21 21:48:08,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-21 21:48:08,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 21:48:08,829 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-21 21:48:08,829 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734630652] [2019-11-21 21:48:08,830 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [606444835] [2019-11-21 21:48:08,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-21 21:48:08,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 21:48:08,916 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-21 21:48:08,919 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 21:48:09,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 21:48:09,136 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-21 21:48:09,137 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-21 21:48:09,137 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2019-11-21 21:48:09,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078683518] [2019-11-21 21:48:09,138 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-21 21:48:09,138 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-21 21:48:09,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-21 21:48:09,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2019-11-21 21:48:09,139 INFO L87 Difference]: Start difference. First operand 7203 states and 26359 transitions. Second operand 22 states. [2019-11-21 21:48:10,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 21:48:10,001 INFO L93 Difference]: Finished difference Result 11819 states and 41675 transitions. [2019-11-21 21:48:10,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-21 21:48:10,001 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 56 [2019-11-21 21:48:10,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 21:48:10,026 INFO L225 Difference]: With dead ends: 11819 [2019-11-21 21:48:10,026 INFO L226 Difference]: Without dead ends: 10559 [2019-11-21 21:48:10,027 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=317, Invalid=1323, Unknown=0, NotChecked=0, Total=1640 [2019-11-21 21:48:10,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10559 states. [2019-11-21 21:48:10,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10559 to 7023. [2019-11-21 21:48:10,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7023 states. [2019-11-21 21:48:10,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7023 states to 7023 states and 25531 transitions. [2019-11-21 21:48:10,154 INFO L78 Accepts]: Start accepts. Automaton has 7023 states and 25531 transitions. Word has length 56 [2019-11-21 21:48:10,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 21:48:10,154 INFO L462 AbstractCegarLoop]: Abstraction has 7023 states and 25531 transitions. [2019-11-21 21:48:10,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-21 21:48:10,154 INFO L276 IsEmpty]: Start isEmpty. Operand 7023 states and 25531 transitions. [2019-11-21 21:48:10,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-21 21:48:10,165 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 21:48:10,165 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-11-21 21:48:10,367 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-21 21:48:10,368 INFO L410 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-21 21:48:10,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 21:48:10,368 INFO L82 PathProgramCache]: Analyzing trace with hash 455911305, now seen corresponding path program 2 times [2019-11-21 21:48:10,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-21 21:48:10,369 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472616737] [2019-11-21 21:48:10,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-21 21:48:10,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 21:48:10,517 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-21 21:48:10,518 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472616737] [2019-11-21 21:48:10,518 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [810289762] [2019-11-21 21:48:10,518 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-21 21:48:10,588 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-21 21:48:10,589 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-21 21:48:10,590 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-21 21:48:10,596 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 21:48:10,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 21:48:10,781 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-21 21:48:10,781 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-21 21:48:10,781 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2019-11-21 21:48:10,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278678177] [2019-11-21 21:48:10,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-21 21:48:10,782 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-21 21:48:10,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-21 21:48:10,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2019-11-21 21:48:10,783 INFO L87 Difference]: Start difference. First operand 7023 states and 25531 transitions. Second operand 22 states. [2019-11-21 21:48:11,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 21:48:11,559 INFO L93 Difference]: Finished difference Result 10319 states and 36435 transitions. [2019-11-21 21:48:11,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-21 21:48:11,560 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 56 [2019-11-21 21:48:11,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 21:48:11,573 INFO L225 Difference]: With dead ends: 10319 [2019-11-21 21:48:11,574 INFO L226 Difference]: Without dead ends: 7997 [2019-11-21 21:48:11,575 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=277, Invalid=1129, Unknown=0, NotChecked=0, Total=1406 [2019-11-21 21:48:11,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7997 states. [2019-11-21 21:48:11,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7997 to 5837. [2019-11-21 21:48:11,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5837 states. [2019-11-21 21:48:11,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5837 states to 5837 states and 21036 transitions. [2019-11-21 21:48:11,674 INFO L78 Accepts]: Start accepts. Automaton has 5837 states and 21036 transitions. Word has length 56 [2019-11-21 21:48:11,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 21:48:11,674 INFO L462 AbstractCegarLoop]: Abstraction has 5837 states and 21036 transitions. [2019-11-21 21:48:11,674 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-21 21:48:11,674 INFO L276 IsEmpty]: Start isEmpty. Operand 5837 states and 21036 transitions. [2019-11-21 21:48:11,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-21 21:48:11,682 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 21:48:11,682 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-11-21 21:48:11,882 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-21 21:48:11,883 INFO L410 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-21 21:48:11,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 21:48:11,883 INFO L82 PathProgramCache]: Analyzing trace with hash 663240811, now seen corresponding path program 3 times [2019-11-21 21:48:11,884 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-21 21:48:11,884 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382976521] [2019-11-21 21:48:11,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-21 21:48:11,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 21:48:11,994 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-21 21:48:11,994 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382976521] [2019-11-21 21:48:11,995 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-21 21:48:11,995 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-21 21:48:11,995 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337676797] [2019-11-21 21:48:11,995 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-21 21:48:11,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-21 21:48:11,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-21 21:48:11,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-11-21 21:48:11,996 INFO L87 Difference]: Start difference. First operand 5837 states and 21036 transitions. Second operand 12 states. [2019-11-21 21:48:12,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 21:48:12,406 INFO L93 Difference]: Finished difference Result 7757 states and 27388 transitions. [2019-11-21 21:48:12,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-21 21:48:12,407 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-11-21 21:48:12,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 21:48:12,418 INFO L225 Difference]: With dead ends: 7757 [2019-11-21 21:48:12,418 INFO L226 Difference]: Without dead ends: 6497 [2019-11-21 21:48:12,419 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=462, Unknown=0, NotChecked=0, Total=600 [2019-11-21 21:48:12,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6497 states. [2019-11-21 21:48:12,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6497 to 5177. [2019-11-21 21:48:12,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5177 states. [2019-11-21 21:48:12,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5177 states to 5177 states and 18560 transitions. [2019-11-21 21:48:12,498 INFO L78 Accepts]: Start accepts. Automaton has 5177 states and 18560 transitions. Word has length 56 [2019-11-21 21:48:12,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 21:48:12,498 INFO L462 AbstractCegarLoop]: Abstraction has 5177 states and 18560 transitions. [2019-11-21 21:48:12,499 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-21 21:48:12,499 INFO L276 IsEmpty]: Start isEmpty. Operand 5177 states and 18560 transitions. [2019-11-21 21:48:12,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-21 21:48:12,506 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 21:48:12,506 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-11-21 21:48:12,506 INFO L410 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-21 21:48:12,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 21:48:12,507 INFO L82 PathProgramCache]: Analyzing trace with hash 641585993, now seen corresponding path program 4 times [2019-11-21 21:48:12,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-21 21:48:12,507 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651164685] [2019-11-21 21:48:12,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-21 21:48:12,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 21:48:12,624 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-21 21:48:12,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651164685] [2019-11-21 21:48:12,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-21 21:48:12,625 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-21 21:48:12,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777829058] [2019-11-21 21:48:12,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-21 21:48:12,626 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-21 21:48:12,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-21 21:48:12,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-11-21 21:48:12,627 INFO L87 Difference]: Start difference. First operand 5177 states and 18560 transitions. Second operand 12 states. [2019-11-21 21:48:13,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 21:48:13,012 INFO L93 Difference]: Finished difference Result 7097 states and 24912 transitions. [2019-11-21 21:48:13,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-21 21:48:13,013 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-11-21 21:48:13,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 21:48:13,022 INFO L225 Difference]: With dead ends: 7097 [2019-11-21 21:48:13,022 INFO L226 Difference]: Without dead ends: 5027 [2019-11-21 21:48:13,022 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=464, Unknown=0, NotChecked=0, Total=600 [2019-11-21 21:48:13,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5027 states. [2019-11-21 21:48:13,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5027 to 4187. [2019-11-21 21:48:13,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4187 states. [2019-11-21 21:48:13,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4187 states to 4187 states and 14681 transitions. [2019-11-21 21:48:13,086 INFO L78 Accepts]: Start accepts. Automaton has 4187 states and 14681 transitions. Word has length 56 [2019-11-21 21:48:13,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 21:48:13,086 INFO L462 AbstractCegarLoop]: Abstraction has 4187 states and 14681 transitions. [2019-11-21 21:48:13,086 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-21 21:48:13,086 INFO L276 IsEmpty]: Start isEmpty. Operand 4187 states and 14681 transitions. [2019-11-21 21:48:13,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-21 21:48:13,092 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 21:48:13,092 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-11-21 21:48:13,092 INFO L410 AbstractCegarLoop]: === Iteration 15 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-21 21:48:13,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 21:48:13,092 INFO L82 PathProgramCache]: Analyzing trace with hash 59382823, now seen corresponding path program 5 times [2019-11-21 21:48:13,092 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-21 21:48:13,093 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645063097] [2019-11-21 21:48:13,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-21 21:48:13,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 21:48:13,211 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-21 21:48:13,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645063097] [2019-11-21 21:48:13,213 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-21 21:48:13,213 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-21 21:48:13,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903913802] [2019-11-21 21:48:13,214 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-21 21:48:13,215 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-21 21:48:13,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-21 21:48:13,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-11-21 21:48:13,215 INFO L87 Difference]: Start difference. First operand 4187 states and 14681 transitions. Second operand 12 states. [2019-11-21 21:48:13,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 21:48:13,564 INFO L93 Difference]: Finished difference Result 4787 states and 16621 transitions. [2019-11-21 21:48:13,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-21 21:48:13,565 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-11-21 21:48:13,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 21:48:13,576 INFO L225 Difference]: With dead ends: 4787 [2019-11-21 21:48:13,576 INFO L226 Difference]: Without dead ends: 3527 [2019-11-21 21:48:13,580 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=387, Unknown=0, NotChecked=0, Total=506 [2019-11-21 21:48:13,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3527 states. [2019-11-21 21:48:13,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3527 to 3527. [2019-11-21 21:48:13,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3527 states. [2019-11-21 21:48:13,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3527 states to 3527 states and 12205 transitions. [2019-11-21 21:48:13,672 INFO L78 Accepts]: Start accepts. Automaton has 3527 states and 12205 transitions. Word has length 56 [2019-11-21 21:48:13,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 21:48:13,672 INFO L462 AbstractCegarLoop]: Abstraction has 3527 states and 12205 transitions. [2019-11-21 21:48:13,673 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-21 21:48:13,673 INFO L276 IsEmpty]: Start isEmpty. Operand 3527 states and 12205 transitions. [2019-11-21 21:48:13,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-21 21:48:13,679 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 21:48:13,680 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-11-21 21:48:13,680 INFO L410 AbstractCegarLoop]: === Iteration 16 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-21 21:48:13,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 21:48:13,681 INFO L82 PathProgramCache]: Analyzing trace with hash 1277217831, now seen corresponding path program 6 times [2019-11-21 21:48:13,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-21 21:48:13,682 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419617941] [2019-11-21 21:48:13,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-21 21:48:13,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 21:48:13,838 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-21 21:48:13,838 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419617941] [2019-11-21 21:48:13,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-21 21:48:13,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-21 21:48:13,839 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332227273] [2019-11-21 21:48:13,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-21 21:48:13,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-21 21:48:13,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-21 21:48:13,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-11-21 21:48:13,841 INFO L87 Difference]: Start difference. First operand 3527 states and 12205 transitions. Second operand 12 states. [2019-11-21 21:48:14,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 21:48:14,091 INFO L93 Difference]: Finished difference Result 3287 states and 11381 transitions. [2019-11-21 21:48:14,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-21 21:48:14,092 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-11-21 21:48:14,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 21:48:14,092 INFO L225 Difference]: With dead ends: 3287 [2019-11-21 21:48:14,092 INFO L226 Difference]: Without dead ends: 0 [2019-11-21 21:48:14,093 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2019-11-21 21:48:14,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-21 21:48:14,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-21 21:48:14,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-21 21:48:14,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-21 21:48:14,094 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 56 [2019-11-21 21:48:14,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 21:48:14,094 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-21 21:48:14,095 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-21 21:48:14,095 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-21 21:48:14,095 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-21 21:48:14,098 INFO L304 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-11-21 21:48:14,105 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 09:48:14 BasicIcfg [2019-11-21 21:48:14,105 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-21 21:48:14,106 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-21 21:48:14,106 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-21 21:48:14,106 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-21 21:48:14,107 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 09:47:48" (3/4) ... [2019-11-21 21:48:14,111 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-21 21:48:14,118 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thr2 [2019-11-21 21:48:14,118 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thr1 [2019-11-21 21:48:14,123 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2019-11-21 21:48:14,124 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-21 21:48:14,124 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-21 21:48:14,194 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-21 21:48:14,195 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-21 21:48:14,198 INFO L168 Benchmark]: Toolchain (without parser) took 27004.35 ms. Allocated memory was 1.0 GB in the beginning and 2.8 GB in the end (delta: 1.8 GB). Free memory was 956.3 MB in the beginning and 1.6 GB in the end (delta: -605.7 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2019-11-21 21:48:14,199 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-21 21:48:14,202 INFO L168 Benchmark]: CACSL2BoogieTranslator took 769.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.3 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -175.4 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. [2019-11-21 21:48:14,203 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.24 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-21 21:48:14,208 INFO L168 Benchmark]: Boogie Preprocessor took 27.77 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-21 21:48:14,209 INFO L168 Benchmark]: RCFGBuilder took 425.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2019-11-21 21:48:14,210 INFO L168 Benchmark]: TraceAbstraction took 25638.00 ms. Allocated memory was 1.2 GB in the beginning and 2.8 GB in the end (delta: 1.6 GB). Free memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: -467.3 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2019-11-21 21:48:14,210 INFO L168 Benchmark]: Witness Printer took 88.97 ms. Allocated memory is still 2.8 GB. Free memory is still 1.6 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-21 21:48:14,216 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 769.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.3 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -175.4 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 48.24 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.77 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 425.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 25638.00 ms. Allocated memory was 1.2 GB in the beginning and 2.8 GB in the end (delta: 1.6 GB). Free memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: -467.3 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. * Witness Printer took 88.97 ms. Allocated memory is still 2.8 GB. Free memory is still 1.6 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 675]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 675]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 675]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 675]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 96 locations, 4 error locations. Result: SAFE, OverallTime: 25.5s, OverallIterations: 16, TraceHistogramMax: 3, AutomataDifference: 10.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2462 SDtfs, 7849 SDslu, 13500 SDs, 0 SdLazy, 3663 SolverSat, 203 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 542 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 341 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1709 ImplicationChecksByTransitivity, 4.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34966occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 7.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 86614 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 991 NumberOfCodeBlocks, 991 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 971 ConstructedInterpolants, 0 QuantifiedInterpolants, 244626 SizeOfPredicates, 36 NumberOfNonLiveVariables, 504 ConjunctsInSsa, 52 ConjunctsInUnsatCore, 20 InterpolantComputations, 12 PerfectInterpolantSequences, 128/194 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...