./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-races/race-2_5-container_of.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_dbb7757f-aa42-4f03-afcd-0050e56a4978/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_dbb7757f-aa42-4f03-afcd-0050e56a4978/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_dbb7757f-aa42-4f03-afcd-0050e56a4978/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_dbb7757f-aa42-4f03-afcd-0050e56a4978/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-races/race-2_5-container_of.i -s /tmp/vcloud-vcloud-master/worker/run_dir_dbb7757f-aa42-4f03-afcd-0050e56a4978/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_dbb7757f-aa42-4f03-afcd-0050e56a4978/bin/uautomizer --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 e37bff872449928e42940d4b386c473c3ec58753 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 20:39:31,189 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 20:39:31,192 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 20:39:31,210 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 20:39:31,210 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 20:39:31,212 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 20:39:31,215 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 20:39:31,226 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 20:39:31,231 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 20:39:31,234 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 20:39:31,236 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 20:39:31,237 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 20:39:31,237 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 20:39:31,238 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 20:39:31,239 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 20:39:31,240 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 20:39:31,241 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 20:39:31,242 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 20:39:31,244 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 20:39:31,246 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 20:39:31,248 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 20:39:31,249 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 20:39:31,250 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 20:39:31,251 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 20:39:31,253 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 20:39:31,254 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 20:39:31,254 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 20:39:31,255 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 20:39:31,255 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 20:39:31,256 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 20:39:31,257 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 20:39:31,258 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 20:39:31,258 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 20:39:31,259 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 20:39:31,260 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 20:39:31,260 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 20:39:31,261 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 20:39:31,261 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 20:39:31,262 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 20:39:31,263 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 20:39:31,263 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 20:39:31,264 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_dbb7757f-aa42-4f03-afcd-0050e56a4978/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 20:39:31,278 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 20:39:31,279 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 20:39:31,280 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 20:39:31,280 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 20:39:31,281 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 20:39:31,281 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 20:39:31,281 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 20:39:31,282 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 20:39:31,282 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 20:39:31,282 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 20:39:31,282 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 20:39:31,283 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 20:39:31,283 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 20:39:31,283 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 20:39:31,283 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 20:39:31,284 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 20:39:31,284 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 20:39:31,284 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 20:39:31,284 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 20:39:31,285 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 20:39:31,285 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 20:39:31,285 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 20:39:31,286 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 20:39:31,286 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 20:39:31,286 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 20:39:31,286 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 20:39:31,287 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 20:39:31,287 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 20:39:31,287 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 -> /tmp/vcloud-vcloud-master/worker/run_dir_dbb7757f-aa42-4f03-afcd-0050e56a4978/bin/uautomizer 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 -> e37bff872449928e42940d4b386c473c3ec58753 [2019-11-15 20:39:31,316 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 20:39:31,329 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 20:39:31,333 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 20:39:31,334 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 20:39:31,335 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 20:39:31,336 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_dbb7757f-aa42-4f03-afcd-0050e56a4978/bin/uautomizer/../../sv-benchmarks/c/ldv-races/race-2_5-container_of.i [2019-11-15 20:39:31,398 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_dbb7757f-aa42-4f03-afcd-0050e56a4978/bin/uautomizer/data/e25df79c5/4d6bb809269b4337be3a819bdccc9871/FLAG2a3ed550a [2019-11-15 20:39:31,994 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 20:39:31,994 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_dbb7757f-aa42-4f03-afcd-0050e56a4978/sv-benchmarks/c/ldv-races/race-2_5-container_of.i [2019-11-15 20:39:32,029 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_dbb7757f-aa42-4f03-afcd-0050e56a4978/bin/uautomizer/data/e25df79c5/4d6bb809269b4337be3a819bdccc9871/FLAG2a3ed550a [2019-11-15 20:39:32,243 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_dbb7757f-aa42-4f03-afcd-0050e56a4978/bin/uautomizer/data/e25df79c5/4d6bb809269b4337be3a819bdccc9871 [2019-11-15 20:39:32,246 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 20:39:32,248 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 20:39:32,249 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 20:39:32,250 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 20:39:32,254 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 20:39:32,255 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:39:32" (1/1) ... [2019-11-15 20:39:32,258 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a63fd57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:39:32, skipping insertion in model container [2019-11-15 20:39:32,259 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:39:32" (1/1) ... [2019-11-15 20:39:32,267 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 20:39:32,340 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 20:39:33,242 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:39:33,252 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 20:39:33,317 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:39:33,657 INFO L192 MainTranslator]: Completed translation [2019-11-15 20:39:33,658 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:39:33 WrapperNode [2019-11-15 20:39:33,658 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 20:39:33,659 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 20:39:33,659 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 20:39:33,659 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 20:39:33,668 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:39:33" (1/1) ... [2019-11-15 20:39:33,728 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:39:33" (1/1) ... [2019-11-15 20:39:33,772 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 20:39:33,773 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 20:39:33,773 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 20:39:33,773 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 20:39:33,784 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:39:33" (1/1) ... [2019-11-15 20:39:33,784 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:39:33" (1/1) ... [2019-11-15 20:39:33,789 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:39:33" (1/1) ... [2019-11-15 20:39:33,789 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:39:33" (1/1) ... [2019-11-15 20:39:33,807 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:39:33" (1/1) ... [2019-11-15 20:39:33,809 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:39:33" (1/1) ... [2019-11-15 20:39:33,816 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:39:33" (1/1) ... [2019-11-15 20:39:33,824 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 20:39:33,825 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 20:39:33,825 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 20:39:33,825 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 20:39:33,836 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:39:33" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_dbb7757f-aa42-4f03-afcd-0050e56a4978/bin/uautomizer/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-15 20:39:33,919 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 20:39:33,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 20:39:33,921 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2019-11-15 20:39:33,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 20:39:33,923 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 20:39:33,923 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 20:39:33,923 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2019-11-15 20:39:33,923 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2019-11-15 20:39:33,924 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 20:39:33,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 20:39:33,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-15 20:39:33,928 WARN L202 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-11-15 20:39:34,981 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 20:39:34,981 INFO L284 CfgBuilder]: Removed 24 assume(true) statements. [2019-11-15 20:39:34,983 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:39:34 BoogieIcfgContainer [2019-11-15 20:39:34,983 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 20:39:34,984 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 20:39:34,984 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 20:39:34,988 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 20:39:34,988 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 08:39:32" (1/3) ... [2019-11-15 20:39:34,989 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14ae3da8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 08:39:34, skipping insertion in model container [2019-11-15 20:39:34,989 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:39:33" (2/3) ... [2019-11-15 20:39:34,990 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14ae3da8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 08:39:34, skipping insertion in model container [2019-11-15 20:39:34,990 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:39:34" (3/3) ... [2019-11-15 20:39:34,992 INFO L109 eAbstractionObserver]: Analyzing ICFG race-2_5-container_of.i [2019-11-15 20:39:35,033 WARN L315 ript$VariableManager]: TermVariabe |Thread0_my_callback_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:39:35,034 WARN L315 ript$VariableManager]: TermVariabe |Thread0_my_callback_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:39:35,034 WARN L315 ript$VariableManager]: TermVariabe Thread0_my_callback_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:39:35,035 WARN L315 ript$VariableManager]: TermVariabe Thread0_my_callback_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:39:35,035 WARN L315 ript$VariableManager]: TermVariabe Thread0_my_callback_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:39:35,035 WARN L315 ript$VariableManager]: TermVariabe Thread0_my_callback_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:39:35,036 WARN L315 ript$VariableManager]: TermVariabe Thread0_my_callback_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:39:35,036 WARN L315 ript$VariableManager]: TermVariabe Thread0_my_callback_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:39:35,036 WARN L315 ript$VariableManager]: TermVariabe Thread0_my_callback_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:39:35,037 WARN L315 ript$VariableManager]: TermVariabe Thread0_my_callback_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:39:35,037 WARN L315 ript$VariableManager]: TermVariabe Thread0_my_callback_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:39:35,037 WARN L315 ript$VariableManager]: TermVariabe Thread0_my_callback_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:39:35,037 WARN L315 ript$VariableManager]: TermVariabe Thread0_my_callback_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:39:35,038 WARN L315 ript$VariableManager]: TermVariabe Thread0_my_callback_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:39:35,038 WARN L315 ript$VariableManager]: TermVariabe Thread0_my_callback_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:39:35,038 WARN L315 ript$VariableManager]: TermVariabe Thread0_my_callback_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:39:35,038 WARN L315 ript$VariableManager]: TermVariabe Thread0_my_callback_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:39:35,039 WARN L315 ript$VariableManager]: TermVariabe Thread0_my_callback_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:39:35,039 WARN L315 ript$VariableManager]: TermVariabe Thread0_my_callback_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:39:35,039 WARN L315 ript$VariableManager]: TermVariabe Thread0_my_callback_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:39:35,040 WARN L315 ript$VariableManager]: TermVariabe |Thread0_my_callback_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:39:35,040 WARN L315 ript$VariableManager]: TermVariabe |Thread0_my_callback_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:39:35,040 WARN L315 ript$VariableManager]: TermVariabe Thread0_my_callback_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:39:35,041 WARN L315 ript$VariableManager]: TermVariabe Thread0_my_callback_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:39:35,041 WARN L315 ript$VariableManager]: TermVariabe Thread0_my_callback_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:39:35,041 WARN L315 ript$VariableManager]: TermVariabe Thread0_my_callback_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:39:35,042 WARN L315 ript$VariableManager]: TermVariabe |Thread0_my_callback_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:39:35,042 WARN L315 ript$VariableManager]: TermVariabe Thread0_my_callback_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:39:35,042 WARN L315 ript$VariableManager]: TermVariabe |Thread0_my_callback_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:39:35,042 WARN L315 ript$VariableManager]: TermVariabe Thread0_my_callback_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:39:35,043 WARN L315 ript$VariableManager]: TermVariabe |Thread0_my_callback_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:39:35,043 WARN L315 ript$VariableManager]: TermVariabe Thread0_my_callback_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:39:35,043 WARN L315 ript$VariableManager]: TermVariabe Thread0_my_callback_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:39:35,044 WARN L315 ript$VariableManager]: TermVariabe |Thread0_my_callback_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:39:35,044 WARN L315 ript$VariableManager]: TermVariabe |Thread0_my_callback_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:39:35,044 WARN L315 ript$VariableManager]: TermVariabe |Thread1_my_callback_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:39:35,044 WARN L315 ript$VariableManager]: TermVariabe |Thread1_my_callback_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:39:35,045 WARN L315 ript$VariableManager]: TermVariabe Thread1_my_callback_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:39:35,045 WARN L315 ript$VariableManager]: TermVariabe Thread1_my_callback_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:39:35,045 WARN L315 ript$VariableManager]: TermVariabe Thread1_my_callback_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:39:35,045 WARN L315 ript$VariableManager]: TermVariabe Thread1_my_callback_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:39:35,046 WARN L315 ript$VariableManager]: TermVariabe Thread1_my_callback_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:39:35,046 WARN L315 ript$VariableManager]: TermVariabe Thread1_my_callback_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:39:35,046 WARN L315 ript$VariableManager]: TermVariabe Thread1_my_callback_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:39:35,047 WARN L315 ript$VariableManager]: TermVariabe Thread1_my_callback_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:39:35,047 WARN L315 ript$VariableManager]: TermVariabe Thread1_my_callback_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:39:35,047 WARN L315 ript$VariableManager]: TermVariabe Thread1_my_callback_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:39:35,047 WARN L315 ript$VariableManager]: TermVariabe Thread1_my_callback_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:39:35,048 WARN L315 ript$VariableManager]: TermVariabe Thread1_my_callback_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:39:35,048 WARN L315 ript$VariableManager]: TermVariabe Thread1_my_callback_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:39:35,048 WARN L315 ript$VariableManager]: TermVariabe Thread1_my_callback_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:39:35,048 WARN L315 ript$VariableManager]: TermVariabe Thread1_my_callback_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:39:35,049 WARN L315 ript$VariableManager]: TermVariabe Thread1_my_callback_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:39:35,049 WARN L315 ript$VariableManager]: TermVariabe Thread1_my_callback_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:39:35,049 WARN L315 ript$VariableManager]: TermVariabe Thread1_my_callback_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:39:35,050 WARN L315 ript$VariableManager]: TermVariabe |Thread1_my_callback_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:39:35,050 WARN L315 ript$VariableManager]: TermVariabe |Thread1_my_callback_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:39:35,050 WARN L315 ript$VariableManager]: TermVariabe Thread1_my_callback_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:39:35,050 WARN L315 ript$VariableManager]: TermVariabe Thread1_my_callback_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:39:35,051 WARN L315 ript$VariableManager]: TermVariabe Thread1_my_callback_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:39:35,051 WARN L315 ript$VariableManager]: TermVariabe Thread1_my_callback_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:39:35,051 WARN L315 ript$VariableManager]: TermVariabe |Thread1_my_callback_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:39:35,051 WARN L315 ript$VariableManager]: TermVariabe Thread1_my_callback_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:39:35,051 WARN L315 ript$VariableManager]: TermVariabe |Thread1_my_callback_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:39:35,051 WARN L315 ript$VariableManager]: TermVariabe Thread1_my_callback_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:39:35,052 WARN L315 ript$VariableManager]: TermVariabe |Thread1_my_callback_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:39:35,052 WARN L315 ript$VariableManager]: TermVariabe Thread1_my_callback_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:39:35,052 WARN L315 ript$VariableManager]: TermVariabe Thread1_my_callback_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:39:35,053 WARN L315 ript$VariableManager]: TermVariabe |Thread1_my_callback_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:39:35,053 WARN L315 ript$VariableManager]: TermVariabe |Thread1_my_callback_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:39:35,089 WARN L141 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-15 20:39:35,089 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 20:39:35,098 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-11-15 20:39:35,110 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-11-15 20:39:35,127 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 20:39:35,127 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 20:39:35,127 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 20:39:35,127 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 20:39:35,127 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 20:39:35,127 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 20:39:35,128 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 20:39:35,128 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 20:39:35,142 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 146 places, 154 transitions [2019-11-15 20:39:35,616 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 9148 states. [2019-11-15 20:39:35,619 INFO L276 IsEmpty]: Start isEmpty. Operand 9148 states. [2019-11-15 20:39:35,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-15 20:39:35,649 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:39:35,650 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:39:35,654 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:39:35,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:39:35,660 INFO L82 PathProgramCache]: Analyzing trace with hash -1224475003, now seen corresponding path program 1 times [2019-11-15 20:39:35,670 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:39:35,671 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482075309] [2019-11-15 20:39:35,671 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:39:35,672 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:39:35,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:39:35,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:39:36,254 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-15 20:39:36,255 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482075309] [2019-11-15 20:39:36,256 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:39:36,257 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 20:39:36,261 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944546368] [2019-11-15 20:39:36,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 20:39:36,267 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:39:36,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 20:39:36,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:39:36,287 INFO L87 Difference]: Start difference. First operand 9148 states. Second operand 6 states. [2019-11-15 20:39:37,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:39:37,547 INFO L93 Difference]: Finished difference Result 12891 states and 35646 transitions. [2019-11-15 20:39:37,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 20:39:37,549 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2019-11-15 20:39:37,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:39:37,689 INFO L225 Difference]: With dead ends: 12891 [2019-11-15 20:39:37,697 INFO L226 Difference]: Without dead ends: 10816 [2019-11-15 20:39:37,699 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2019-11-15 20:39:37,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10816 states. [2019-11-15 20:39:38,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10816 to 8396. [2019-11-15 20:39:38,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8396 states. [2019-11-15 20:39:38,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8396 states to 8396 states and 22955 transitions. [2019-11-15 20:39:38,213 INFO L78 Accepts]: Start accepts. Automaton has 8396 states and 22955 transitions. Word has length 43 [2019-11-15 20:39:38,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:39:38,214 INFO L462 AbstractCegarLoop]: Abstraction has 8396 states and 22955 transitions. [2019-11-15 20:39:38,214 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 20:39:38,215 INFO L276 IsEmpty]: Start isEmpty. Operand 8396 states and 22955 transitions. [2019-11-15 20:39:38,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-15 20:39:38,219 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:39:38,219 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:39:38,220 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:39:38,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:39:38,220 INFO L82 PathProgramCache]: Analyzing trace with hash -883751660, now seen corresponding path program 1 times [2019-11-15 20:39:38,220 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:39:38,221 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990877818] [2019-11-15 20:39:38,221 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:39:38,221 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:39:38,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:39:38,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:39:38,562 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-15 20:39:38,563 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990877818] [2019-11-15 20:39:38,563 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:39:38,563 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 20:39:38,563 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90331016] [2019-11-15 20:39:38,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 20:39:38,565 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:39:38,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 20:39:38,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:39:38,566 INFO L87 Difference]: Start difference. First operand 8396 states and 22955 transitions. Second operand 6 states. [2019-11-15 20:39:39,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:39:39,591 INFO L93 Difference]: Finished difference Result 11652 states and 31765 transitions. [2019-11-15 20:39:39,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 20:39:39,592 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2019-11-15 20:39:39,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:39:39,676 INFO L225 Difference]: With dead ends: 11652 [2019-11-15 20:39:39,676 INFO L226 Difference]: Without dead ends: 9858 [2019-11-15 20:39:39,677 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2019-11-15 20:39:39,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9858 states. [2019-11-15 20:39:39,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9858 to 9536. [2019-11-15 20:39:39,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9536 states. [2019-11-15 20:39:40,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9536 states to 9536 states and 26143 transitions. [2019-11-15 20:39:40,005 INFO L78 Accepts]: Start accepts. Automaton has 9536 states and 26143 transitions. Word has length 49 [2019-11-15 20:39:40,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:39:40,005 INFO L462 AbstractCegarLoop]: Abstraction has 9536 states and 26143 transitions. [2019-11-15 20:39:40,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 20:39:40,006 INFO L276 IsEmpty]: Start isEmpty. Operand 9536 states and 26143 transitions. [2019-11-15 20:39:40,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-15 20:39:40,016 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:39:40,016 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:39:40,017 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:39:40,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:39:40,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1709085979, now seen corresponding path program 1 times [2019-11-15 20:39:40,018 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:39:40,018 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318761178] [2019-11-15 20:39:40,018 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:39:40,018 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:39:40,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:39:40,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:39:40,151 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-15 20:39:40,152 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318761178] [2019-11-15 20:39:40,152 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:39:40,152 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:39:40,153 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563167607] [2019-11-15 20:39:40,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 20:39:40,153 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:39:40,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:39:40,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:39:40,154 INFO L87 Difference]: Start difference. First operand 9536 states and 26143 transitions. Second operand 5 states. [2019-11-15 20:39:40,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:39:40,284 INFO L93 Difference]: Finished difference Result 3711 states and 9633 transitions. [2019-11-15 20:39:40,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 20:39:40,285 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2019-11-15 20:39:40,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:39:40,294 INFO L225 Difference]: With dead ends: 3711 [2019-11-15 20:39:40,294 INFO L226 Difference]: Without dead ends: 3711 [2019-11-15 20:39:40,295 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:39:40,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3711 states. [2019-11-15 20:39:40,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3711 to 3711. [2019-11-15 20:39:40,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3711 states. [2019-11-15 20:39:40,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3711 states to 3711 states and 9633 transitions. [2019-11-15 20:39:40,406 INFO L78 Accepts]: Start accepts. Automaton has 3711 states and 9633 transitions. Word has length 57 [2019-11-15 20:39:40,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:39:40,407 INFO L462 AbstractCegarLoop]: Abstraction has 3711 states and 9633 transitions. [2019-11-15 20:39:40,407 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 20:39:40,407 INFO L276 IsEmpty]: Start isEmpty. Operand 3711 states and 9633 transitions. [2019-11-15 20:39:40,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-15 20:39:40,416 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:39:40,416 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:39:40,417 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:39:40,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:39:40,417 INFO L82 PathProgramCache]: Analyzing trace with hash -285769666, now seen corresponding path program 1 times [2019-11-15 20:39:40,418 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:39:40,418 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882070505] [2019-11-15 20:39:40,418 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:39:40,418 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:39:40,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:39:40,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:39:40,620 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-15 20:39:40,620 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882070505] [2019-11-15 20:39:40,620 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:39:40,620 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 20:39:40,621 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209637894] [2019-11-15 20:39:40,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 20:39:40,621 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:39:40,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 20:39:40,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:39:40,622 INFO L87 Difference]: Start difference. First operand 3711 states and 9633 transitions. Second operand 6 states. [2019-11-15 20:39:41,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:39:41,520 INFO L93 Difference]: Finished difference Result 4016 states and 10182 transitions. [2019-11-15 20:39:41,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-15 20:39:41,521 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 72 [2019-11-15 20:39:41,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:39:41,532 INFO L225 Difference]: With dead ends: 4016 [2019-11-15 20:39:41,533 INFO L226 Difference]: Without dead ends: 4016 [2019-11-15 20:39:41,533 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2019-11-15 20:39:41,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4016 states. [2019-11-15 20:39:41,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4016 to 3763. [2019-11-15 20:39:41,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3763 states. [2019-11-15 20:39:41,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3763 states to 3763 states and 9725 transitions. [2019-11-15 20:39:41,721 INFO L78 Accepts]: Start accepts. Automaton has 3763 states and 9725 transitions. Word has length 72 [2019-11-15 20:39:41,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:39:41,722 INFO L462 AbstractCegarLoop]: Abstraction has 3763 states and 9725 transitions. [2019-11-15 20:39:41,722 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 20:39:41,722 INFO L276 IsEmpty]: Start isEmpty. Operand 3763 states and 9725 transitions. [2019-11-15 20:39:41,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-15 20:39:41,731 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:39:41,733 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:39:41,733 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:39:41,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:39:41,734 INFO L82 PathProgramCache]: Analyzing trace with hash -462471949, now seen corresponding path program 1 times [2019-11-15 20:39:41,734 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:39:41,734 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986427138] [2019-11-15 20:39:41,735 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:39:41,735 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:39:41,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:39:41,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:39:41,937 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-15 20:39:41,937 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986427138] [2019-11-15 20:39:41,937 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:39:41,938 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 20:39:41,938 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635047746] [2019-11-15 20:39:41,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 20:39:41,939 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:39:41,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 20:39:41,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:39:41,940 INFO L87 Difference]: Start difference. First operand 3763 states and 9725 transitions. Second operand 6 states. [2019-11-15 20:39:42,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:39:42,749 INFO L93 Difference]: Finished difference Result 4117 states and 10347 transitions. [2019-11-15 20:39:42,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-15 20:39:42,751 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2019-11-15 20:39:42,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:39:42,760 INFO L225 Difference]: With dead ends: 4117 [2019-11-15 20:39:42,760 INFO L226 Difference]: Without dead ends: 4117 [2019-11-15 20:39:42,761 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2019-11-15 20:39:42,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4117 states. [2019-11-15 20:39:42,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4117 to 3941. [2019-11-15 20:39:42,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3941 states. [2019-11-15 20:39:42,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3941 states to 3941 states and 10065 transitions. [2019-11-15 20:39:42,874 INFO L78 Accepts]: Start accepts. Automaton has 3941 states and 10065 transitions. Word has length 78 [2019-11-15 20:39:42,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:39:42,875 INFO L462 AbstractCegarLoop]: Abstraction has 3941 states and 10065 transitions. [2019-11-15 20:39:42,875 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 20:39:42,876 INFO L276 IsEmpty]: Start isEmpty. Operand 3941 states and 10065 transitions. [2019-11-15 20:39:42,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-15 20:39:42,885 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:39:42,886 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:39:42,886 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:39:42,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:39:42,887 INFO L82 PathProgramCache]: Analyzing trace with hash 70738761, now seen corresponding path program 1 times [2019-11-15 20:39:42,887 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:39:42,887 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540919907] [2019-11-15 20:39:42,887 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:39:42,888 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:39:42,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:39:42,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:39:44,216 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-15 20:39:44,217 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540919907] [2019-11-15 20:39:44,217 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:39:44,218 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-11-15 20:39:44,218 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380891984] [2019-11-15 20:39:44,218 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-15 20:39:44,219 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:39:44,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-15 20:39:44,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2019-11-15 20:39:44,220 INFO L87 Difference]: Start difference. First operand 3941 states and 10065 transitions. Second operand 18 states. [2019-11-15 20:39:44,969 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2019-11-15 20:39:45,130 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2019-11-15 20:39:45,387 WARN L191 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2019-11-15 20:39:45,634 WARN L191 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-11-15 20:39:46,005 WARN L191 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-11-15 20:39:46,295 WARN L191 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-11-15 20:39:46,701 WARN L191 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-11-15 20:39:47,078 WARN L191 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 63 [2019-11-15 20:39:47,443 WARN L191 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 67 [2019-11-15 20:39:47,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:39:47,742 INFO L93 Difference]: Finished difference Result 13224 states and 33348 transitions. [2019-11-15 20:39:47,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-15 20:39:47,743 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 80 [2019-11-15 20:39:47,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:39:47,766 INFO L225 Difference]: With dead ends: 13224 [2019-11-15 20:39:47,766 INFO L226 Difference]: Without dead ends: 13224 [2019-11-15 20:39:47,767 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=287, Invalid=705, Unknown=0, NotChecked=0, Total=992 [2019-11-15 20:39:47,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13224 states. [2019-11-15 20:39:47,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13224 to 4240. [2019-11-15 20:39:47,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4240 states. [2019-11-15 20:39:47,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4240 states to 4240 states and 10861 transitions. [2019-11-15 20:39:47,952 INFO L78 Accepts]: Start accepts. Automaton has 4240 states and 10861 transitions. Word has length 80 [2019-11-15 20:39:47,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:39:47,952 INFO L462 AbstractCegarLoop]: Abstraction has 4240 states and 10861 transitions. [2019-11-15 20:39:47,953 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-15 20:39:47,953 INFO L276 IsEmpty]: Start isEmpty. Operand 4240 states and 10861 transitions. [2019-11-15 20:39:47,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-15 20:39:47,964 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:39:47,964 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:39:47,965 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:39:47,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:39:47,965 INFO L82 PathProgramCache]: Analyzing trace with hash -2557300, now seen corresponding path program 1 times [2019-11-15 20:39:47,966 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:39:47,966 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844385491] [2019-11-15 20:39:47,966 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:39:47,966 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:39:47,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:39:48,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:39:48,439 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-15 20:39:48,439 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844385491] [2019-11-15 20:39:48,440 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:39:48,440 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 20:39:48,440 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371361764] [2019-11-15 20:39:48,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 20:39:48,441 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:39:48,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 20:39:48,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:39:48,441 INFO L87 Difference]: Start difference. First operand 4240 states and 10861 transitions. Second operand 8 states. [2019-11-15 20:39:48,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:39:48,995 INFO L93 Difference]: Finished difference Result 4439 states and 11238 transitions. [2019-11-15 20:39:48,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 20:39:48,996 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 80 [2019-11-15 20:39:48,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:39:49,002 INFO L225 Difference]: With dead ends: 4439 [2019-11-15 20:39:49,002 INFO L226 Difference]: Without dead ends: 4439 [2019-11-15 20:39:49,003 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2019-11-15 20:39:49,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4439 states. [2019-11-15 20:39:49,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4439 to 4409. [2019-11-15 20:39:49,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4409 states. [2019-11-15 20:39:49,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4409 states to 4409 states and 11180 transitions. [2019-11-15 20:39:49,101 INFO L78 Accepts]: Start accepts. Automaton has 4409 states and 11180 transitions. Word has length 80 [2019-11-15 20:39:49,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:39:49,101 INFO L462 AbstractCegarLoop]: Abstraction has 4409 states and 11180 transitions. [2019-11-15 20:39:49,101 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 20:39:49,102 INFO L276 IsEmpty]: Start isEmpty. Operand 4409 states and 11180 transitions. [2019-11-15 20:39:49,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-15 20:39:49,111 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:39:49,111 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:39:49,112 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:39:49,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:39:49,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1982208360, now seen corresponding path program 2 times [2019-11-15 20:39:49,112 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:39:49,113 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969277466] [2019-11-15 20:39:49,113 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:39:49,113 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:39:49,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:39:49,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:39:50,001 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-15 20:39:50,002 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969277466] [2019-11-15 20:39:50,002 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:39:50,003 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-11-15 20:39:50,003 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4728783] [2019-11-15 20:39:50,004 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-15 20:39:50,004 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:39:50,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-15 20:39:50,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-11-15 20:39:50,005 INFO L87 Difference]: Start difference. First operand 4409 states and 11180 transitions. Second operand 17 states. [2019-11-15 20:39:51,837 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-11-15 20:39:52,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:39:52,520 INFO L93 Difference]: Finished difference Result 4286 states and 10923 transitions. [2019-11-15 20:39:52,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-15 20:39:52,520 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 80 [2019-11-15 20:39:52,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:39:52,528 INFO L225 Difference]: With dead ends: 4286 [2019-11-15 20:39:52,528 INFO L226 Difference]: Without dead ends: 4286 [2019-11-15 20:39:52,529 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=356, Invalid=766, Unknown=0, NotChecked=0, Total=1122 [2019-11-15 20:39:52,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4286 states. [2019-11-15 20:39:52,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4286 to 4143. [2019-11-15 20:39:52,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4143 states. [2019-11-15 20:39:52,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4143 states to 4143 states and 10658 transitions. [2019-11-15 20:39:52,621 INFO L78 Accepts]: Start accepts. Automaton has 4143 states and 10658 transitions. Word has length 80 [2019-11-15 20:39:52,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:39:52,621 INFO L462 AbstractCegarLoop]: Abstraction has 4143 states and 10658 transitions. [2019-11-15 20:39:52,621 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-15 20:39:52,621 INFO L276 IsEmpty]: Start isEmpty. Operand 4143 states and 10658 transitions. [2019-11-15 20:39:52,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-15 20:39:52,630 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:39:52,630 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:39:52,631 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:39:52,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:39:52,631 INFO L82 PathProgramCache]: Analyzing trace with hash -822154873, now seen corresponding path program 2 times [2019-11-15 20:39:52,632 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:39:52,632 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118269068] [2019-11-15 20:39:52,632 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:39:52,632 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:39:52,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:39:52,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:39:53,751 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-15 20:39:53,752 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118269068] [2019-11-15 20:39:53,752 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:39:53,752 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-11-15 20:39:53,752 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156328249] [2019-11-15 20:39:53,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-15 20:39:53,753 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:39:53,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-15 20:39:53,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2019-11-15 20:39:53,754 INFO L87 Difference]: Start difference. First operand 4143 states and 10658 transitions. Second operand 18 states. [2019-11-15 20:39:54,450 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2019-11-15 20:39:54,633 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2019-11-15 20:39:54,843 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-11-15 20:39:55,092 WARN L191 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-11-15 20:39:55,340 WARN L191 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-11-15 20:39:55,668 WARN L191 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-11-15 20:39:56,077 WARN L191 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2019-11-15 20:39:56,401 WARN L191 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 67 [2019-11-15 20:39:56,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:39:56,701 INFO L93 Difference]: Finished difference Result 12814 states and 32036 transitions. [2019-11-15 20:39:56,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-15 20:39:56,702 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 80 [2019-11-15 20:39:56,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:39:56,718 INFO L225 Difference]: With dead ends: 12814 [2019-11-15 20:39:56,718 INFO L226 Difference]: Without dead ends: 12814 [2019-11-15 20:39:56,719 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=287, Invalid=705, Unknown=0, NotChecked=0, Total=992 [2019-11-15 20:39:56,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12814 states. [2019-11-15 20:39:56,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12814 to 4238. [2019-11-15 20:39:56,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4238 states. [2019-11-15 20:39:56,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4238 states to 4238 states and 10850 transitions. [2019-11-15 20:39:56,882 INFO L78 Accepts]: Start accepts. Automaton has 4238 states and 10850 transitions. Word has length 80 [2019-11-15 20:39:56,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:39:56,883 INFO L462 AbstractCegarLoop]: Abstraction has 4238 states and 10850 transitions. [2019-11-15 20:39:56,883 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-15 20:39:56,883 INFO L276 IsEmpty]: Start isEmpty. Operand 4238 states and 10850 transitions. [2019-11-15 20:39:56,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-15 20:39:56,894 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:39:56,894 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:39:56,895 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:39:56,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:39:56,896 INFO L82 PathProgramCache]: Analyzing trace with hash -62580533, now seen corresponding path program 3 times [2019-11-15 20:39:56,896 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:39:56,896 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608096476] [2019-11-15 20:39:56,897 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:39:56,901 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:39:56,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:39:56,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:39:57,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:39:57,099 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:39:57,100 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-15 20:39:57,250 INFO L303 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-11-15 20:39:57,251 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 08:39:57 BasicIcfg [2019-11-15 20:39:57,251 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 20:39:57,252 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 20:39:57,252 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 20:39:57,252 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 20:39:57,253 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:39:34" (3/4) ... [2019-11-15 20:39:57,255 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-15 20:39:57,411 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_dbb7757f-aa42-4f03-afcd-0050e56a4978/bin/uautomizer/witness.graphml [2019-11-15 20:39:57,411 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 20:39:57,412 INFO L168 Benchmark]: Toolchain (without parser) took 25164.66 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 525.3 MB). Free memory was 946.1 MB in the beginning and 1.5 GB in the end (delta: -553.9 MB). Peak memory consumption was 606.0 MB. Max. memory is 11.5 GB. [2019-11-15 20:39:57,413 INFO L168 Benchmark]: CDTParser took 0.41 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:39:57,414 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1409.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.0 MB). Free memory was 946.1 MB in the beginning and 1.0 GB in the end (delta: -79.7 MB). Peak memory consumption was 95.3 MB. Max. memory is 11.5 GB. [2019-11-15 20:39:57,414 INFO L168 Benchmark]: Boogie Procedure Inliner took 113.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 20:39:57,415 INFO L168 Benchmark]: Boogie Preprocessor took 51.75 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:39:57,415 INFO L168 Benchmark]: RCFGBuilder took 1158.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 965.7 MB in the end (delta: 54.6 MB). Peak memory consumption was 54.6 MB. Max. memory is 11.5 GB. [2019-11-15 20:39:57,416 INFO L168 Benchmark]: TraceAbstraction took 22267.31 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 360.2 MB). Free memory was 965.7 MB in the beginning and 871.4 MB in the end (delta: 94.4 MB). Peak memory consumption was 454.6 MB. Max. memory is 11.5 GB. [2019-11-15 20:39:57,416 INFO L168 Benchmark]: Witness Printer took 159.09 ms. Allocated memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 3.1 MB). Free memory was 871.4 MB in the beginning and 1.5 GB in the end (delta: -628.6 MB). Peak memory consumption was 9.1 MB. Max. memory is 11.5 GB. [2019-11-15 20:39:57,419 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.41 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1409.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.0 MB). Free memory was 946.1 MB in the beginning and 1.0 GB in the end (delta: -79.7 MB). Peak memory consumption was 95.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 113.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 51.75 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1158.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 965.7 MB in the end (delta: 54.6 MB). Peak memory consumption was 54.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 22267.31 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 360.2 MB). Free memory was 965.7 MB in the beginning and 871.4 MB in the end (delta: 94.4 MB). Peak memory consumption was 454.6 MB. Max. memory is 11.5 GB. * Witness Printer took 159.09 ms. Allocated memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 3.1 MB). Free memory was 871.4 MB in the beginning and 1.5 GB in the end (delta: -628.6 MB). Peak memory consumption was 9.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1682]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L1683] 0 pthread_t t1,t2; VAL [t1={1:0}, t2={-3:0}] [L1731] 0 return 0; VAL [t1={1:0}, t2={-3:0}] [L1737] 0 int ret = my_drv_init(); VAL [t1={1:0}, t2={-3:0}] [L1738] COND TRUE 0 ret==0 VAL [t1={1:0}, t2={-3:0}] [L1739] 0 int probe_ret; VAL [t1={1:0}, t2={-3:0}] [L1740] 0 struct my_data data; VAL [t1={1:0}, t2={-3:0}] [L1706] 0 struct device *d = &data->dev; VAL [t1={1:0}, t2={-3:0}] [L1708] 0 data->shared.a = 0 VAL [t1={1:0}, t2={-3:0}] [L1709] 0 data->shared.b = 0 VAL [t1={1:0}, t2={-3:0}] [L1710] 0 int res = __VERIFIER_nondet_int(); VAL [t1={1:0}, t2={-3:0}] [L1711] COND FALSE 0 !(\read(res)) VAL [t1={1:0}, t2={-3:0}] [L1713] FCALL, FORK 0 pthread_create(&t1, ((void *)0), my_callback, (void *)d) VAL [arg={-2:24}, t1={1:0}, t2={-3:0}] [L1714] FCALL, FORK 0 pthread_create(&t2, ((void *)0), my_callback, (void *)d) VAL [arg={-2:24}, t1={1:0}, t2={-3:0}] [L1696] 2 struct device *dev = (struct device*)arg; VAL [arg={-2:24}, arg={-2:24}, dev={-2:24}, t1={1:0}, t2={-3:0}] [L1697] 2 struct my_data *data; VAL [arg={-2:24}, arg={-2:24}, dev={-2:24}, t1={1:0}, t2={-3:0}] [L1696] 1 struct device *dev = (struct device*)arg; VAL [arg={-2:24}, arg={-2:24}, dev={-2:24}, t1={1:0}, t2={-3:0}] [L1698] 2 const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); VAL [__mptr={-2:24}, arg={-2:24}, arg={-2:24}, dev={-2:24}, t1={1:0}, t2={-3:0}] [L1697] 1 struct my_data *data; VAL [__mptr={-2:24}, arg={-2:24}, arg={-2:24}, dev={-2:24}, t1={1:0}, t2={-3:0}] [L1698] 2 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );}) VAL [__mptr={-2:24}, arg={-2:24}, arg={-2:24}, data={-2:0}, dev={-2:24}, t1={1:0}, t2={-3:0}] [L1715] 0 return 0; VAL [__mptr={-2:24}, arg={-2:24}, arg={-2:24}, data={-2:0}, dev={-2:24}, t1={1:0}, t2={-3:0}] [L1698] 1 const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); VAL [__mptr={-2:24}, arg={-2:24}, arg={-2:24}, data={-2:0}, dev={-2:24}, t1={1:0}, t2={-3:0}] [L1698] 1 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );}) VAL [__mptr={-2:24}, arg={-2:24}, arg={-2:24}, data={-2:0}, dev={-2:24}, t1={1:0}, t2={-3:0}] [L1741] 0 probe_ret = my_drv_probe(&data) VAL [__mptr={-2:24}, arg={-2:24}, arg={-2:24}, data={-2:0}, dev={-2:24}, t1={1:0}, t2={-3:0}] [L1742] COND TRUE 0 probe_ret==0 VAL [__mptr={-2:24}, arg={-2:24}, arg={-2:24}, data={-2:0}, dev={-2:24}, t1={1:0}, t2={-3:0}] [L1721] 0 void *status; VAL [__mptr={-2:24}, arg={-2:24}, arg={-2:24}, data={-2:0}, dev={-2:24}, t1={1:0}, t2={-3:0}] [L1722] 0 \read(t1) VAL [__mptr={-2:24}, arg={-2:24}, arg={-2:24}, data={-2:0}, dev={-2:24}, t1={1:0}, t2={-3:0}] [L1700] 1 data->shared.a = 1 VAL [__mptr={-2:24}, arg={-2:24}, arg={-2:24}, data={-2:0}, dev={-2:24}, t1={1:0}, t2={-3:0}] [L1701] EXPR 1 data->shared.b VAL [__mptr={-2:24}, arg={-2:24}, arg={-2:24}, data={-2:0}, data->shared.b=0, dev={-2:24}, t1={1:0}, t2={-3:0}] [L1701] 1 data->shared.b = data->shared.b + 1 VAL [__mptr={-2:24}, arg={-2:24}, arg={-2:24}, data={-2:0}, data->shared.b=0, dev={-2:24}, t1={1:0}, t2={-3:0}] [L1703] 1 return 0; VAL [\result={0:0}, __mptr={-2:24}, arg={-2:24}, arg={-2:24}, data={-2:0}, dev={-2:24}, t1={1:0}, t2={-3:0}] [L1722] FCALL, JOIN 1 pthread_join(t1, &status) VAL [\result={0:0}, __mptr={-2:24}, arg={-2:24}, arg={-2:24}, data={-2:0}, dev={-2:24}, t1={1:0}, t2={-3:0}] [L1723] 0 data->shared.a = 3 VAL [\result={0:0}, __mptr={-2:24}, arg={-2:24}, arg={-2:24}, data={-2:0}, dev={-2:24}, pthread_mutex_lock (&data->lock)=0, t1={1:0}, t2={-3:0}] [L1724] 0 data->shared.b = 3 VAL [\result={0:0}, __mptr={-2:24}, arg={-2:24}, arg={-2:24}, data={-2:0}, dev={-2:24}, pthread_mutex_lock (&data->lock)=0, t1={1:0}, t2={-3:0}] [L1700] 2 data->shared.a = 1 VAL [\result={0:0}, __mptr={-2:24}, arg={-2:24}, arg={-2:24}, data={-2:0}, dev={-2:24}, t1={1:0}, t2={-3:0}] [L1725] 0 data->shared.a VAL [\result={0:0}, __mptr={-2:24}, arg={-2:24}, arg={-2:24}, data={-2:0}, dev={-2:24}, t1={1:0}, t2={-3:0}] [L1682] COND TRUE 0 !expression VAL [\result={0:0}, __mptr={-2:24}, arg={-2:24}, arg={-2:24}, data={-2:0}, dev={-2:24}, t1={1:0}, t2={-3:0}] [L1682] 0 __VERIFIER_error() VAL [\result={0:0}, __mptr={-2:24}, arg={-2:24}, arg={-2:24}, data={-2:0}, dev={-2:24}, t1={1:0}, t2={-3:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 161 locations, 6 error locations. Result: UNSAFE, OverallTime: 22.1s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 14.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2274 SDtfs, 6893 SDslu, 8749 SDs, 0 SdLazy, 2409 SolverSat, 178 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 206 GetRequests, 38 SyntacticMatches, 9 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 9.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9536occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.7s AutomataMinimizationTime, 9 MinimizatonAttempts, 20904 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 699 NumberOfCodeBlocks, 699 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 610 ConstructedInterpolants, 0 QuantifiedInterpolants, 236749 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 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 incorrect! Received shutdown request...