./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/working_dir_2c265d7b-3896-4c8a-b09a-97d71aa8c2dc/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_2c265d7b-3896-4c8a-b09a-97d71aa8c2dc/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_2c265d7b-3896-4c8a-b09a-97d71aa8c2dc/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_2c265d7b-3896-4c8a-b09a-97d71aa8c2dc/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ldv-races/race-2_5-container_of.i -s /tmp/vcloud-vcloud-master/worker/working_dir_2c265d7b-3896-4c8a-b09a-97d71aa8c2dc/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_2c265d7b-3896-4c8a-b09a-97d71aa8c2dc/bin/utaipan --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 Taipan --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-10-22 11:26:56,971 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:26:56,974 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:26:56,984 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:26:56,985 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:26:56,986 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:26:56,987 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:26:56,989 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:26:56,991 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:26:56,994 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:26:56,996 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:26:56,997 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:26:56,997 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:26:56,998 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:26:56,999 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:26:57,000 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:26:57,006 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:26:57,009 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:26:57,011 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:26:57,014 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:26:57,016 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:26:57,017 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:26:57,018 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:26:57,018 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:26:57,020 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:26:57,020 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:26:57,020 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:26:57,021 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:26:57,021 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:26:57,022 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:26:57,022 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:26:57,022 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:26:57,023 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:26:57,023 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:26:57,024 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:26:57,024 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:26:57,025 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:26:57,025 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:26:57,025 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:26:57,026 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:26:57,027 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:26:57,027 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_2c265d7b-3896-4c8a-b09a-97d71aa8c2dc/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-10-22 11:26:57,038 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:26:57,038 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:26:57,038 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:26:57,039 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:26:57,039 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:26:57,039 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:26:57,039 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-10-22 11:26:57,039 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:26:57,040 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:26:57,040 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-10-22 11:26:57,040 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-10-22 11:26:57,040 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:26:57,041 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:26:57,041 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:26:57,041 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 11:26:57,041 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:26:57,042 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:26:57,042 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 11:26:57,042 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:26:57,042 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 11:26:57,042 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:26:57,042 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 11:26:57,043 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 11:26:57,043 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:26:57,043 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:26:57,043 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:26:57,043 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:26:57,043 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:26:57,044 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:26:57,044 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:26:57,044 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 11:26:57,045 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-22 11:26:57,045 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 11:26:57,045 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 11:26:57,045 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:26:57,045 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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/working_dir_2c265d7b-3896-4c8a-b09a-97d71aa8c2dc/bin/utaipan 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 -> Taipan 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-10-22 11:26:57,070 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:26:57,082 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:26:57,085 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:26:57,088 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:26:57,088 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:26:57,089 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_2c265d7b-3896-4c8a-b09a-97d71aa8c2dc/bin/utaipan/../../sv-benchmarks/c/ldv-races/race-2_5-container_of.i [2019-10-22 11:26:57,139 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2c265d7b-3896-4c8a-b09a-97d71aa8c2dc/bin/utaipan/data/56bef8ec9/19a94b26038641419ab6df38a7ec3bf7/FLAGce60b23ba [2019-10-22 11:26:57,656 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:26:57,660 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_2c265d7b-3896-4c8a-b09a-97d71aa8c2dc/sv-benchmarks/c/ldv-races/race-2_5-container_of.i [2019-10-22 11:26:57,681 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2c265d7b-3896-4c8a-b09a-97d71aa8c2dc/bin/utaipan/data/56bef8ec9/19a94b26038641419ab6df38a7ec3bf7/FLAGce60b23ba [2019-10-22 11:26:58,106 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_2c265d7b-3896-4c8a-b09a-97d71aa8c2dc/bin/utaipan/data/56bef8ec9/19a94b26038641419ab6df38a7ec3bf7 [2019-10-22 11:26:58,109 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:26:58,110 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:26:58,111 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:26:58,111 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:26:58,115 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:26:58,116 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:26:58" (1/1) ... [2019-10-22 11:26:58,118 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e562b88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:58, skipping insertion in model container [2019-10-22 11:26:58,118 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:26:58" (1/1) ... [2019-10-22 11:26:58,125 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:26:58,190 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:26:58,938 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:26:58,947 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:26:59,002 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:26:59,274 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:26:59,274 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:59 WrapperNode [2019-10-22 11:26:59,274 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:26:59,275 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:26:59,275 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:26:59,275 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:26:59,283 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:59" (1/1) ... [2019-10-22 11:26:59,306 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:59" (1/1) ... [2019-10-22 11:26:59,331 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:26:59,331 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:26:59,332 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:26:59,332 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:26:59,341 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:59" (1/1) ... [2019-10-22 11:26:59,341 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:59" (1/1) ... [2019-10-22 11:26:59,346 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:59" (1/1) ... [2019-10-22 11:26:59,346 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:59" (1/1) ... [2019-10-22 11:26:59,359 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:59" (1/1) ... [2019-10-22 11:26:59,361 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:59" (1/1) ... [2019-10-22 11:26:59,365 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:59" (1/1) ... [2019-10-22 11:26:59,370 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:26:59,370 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:26:59,371 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:26:59,371 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:26:59,372 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:59" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2c265d7b-3896-4c8a-b09a-97d71aa8c2dc/bin/utaipan/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-10-22 11:26:59,443 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 11:26:59,446 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 11:26:59,446 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2019-10-22 11:26:59,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-22 11:26:59,446 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:26:59,447 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:26:59,447 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2019-10-22 11:26:59,447 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2019-10-22 11:26:59,447 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 11:26:59,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 11:26:59,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-22 11:26:59,449 WARN L202 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-10-22 11:27:00,301 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:27:00,302 INFO L284 CfgBuilder]: Removed 24 assume(true) statements. [2019-10-22 11:27:00,303 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:27:00 BoogieIcfgContainer [2019-10-22 11:27:00,303 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:27:00,304 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:27:00,304 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:27:00,307 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:27:00,307 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:26:58" (1/3) ... [2019-10-22 11:27:00,308 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49f51bb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:27:00, skipping insertion in model container [2019-10-22 11:27:00,308 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:59" (2/3) ... [2019-10-22 11:27:00,308 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49f51bb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:27:00, skipping insertion in model container [2019-10-22 11:27:00,308 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:27:00" (3/3) ... [2019-10-22 11:27:00,310 INFO L109 eAbstractionObserver]: Analyzing ICFG race-2_5-container_of.i [2019-10-22 11:27:00,341 WARN L315 ript$VariableManager]: TermVariabe |Thread0_my_callback_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:00,341 WARN L315 ript$VariableManager]: TermVariabe |Thread0_my_callback_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:00,341 WARN L315 ript$VariableManager]: TermVariabe Thread0_my_callback_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:00,341 WARN L315 ript$VariableManager]: TermVariabe Thread0_my_callback_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:00,342 WARN L315 ript$VariableManager]: TermVariabe Thread0_my_callback_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:00,342 WARN L315 ript$VariableManager]: TermVariabe Thread0_my_callback_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:00,342 WARN L315 ript$VariableManager]: TermVariabe Thread0_my_callback_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:00,342 WARN L315 ript$VariableManager]: TermVariabe Thread0_my_callback_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:00,343 WARN L315 ript$VariableManager]: TermVariabe Thread0_my_callback_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:00,343 WARN L315 ript$VariableManager]: TermVariabe Thread0_my_callback_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:00,343 WARN L315 ript$VariableManager]: TermVariabe Thread0_my_callback_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:00,343 WARN L315 ript$VariableManager]: TermVariabe Thread0_my_callback_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:00,343 WARN L315 ript$VariableManager]: TermVariabe Thread0_my_callback_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:00,343 WARN L315 ript$VariableManager]: TermVariabe Thread0_my_callback_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:00,344 WARN L315 ript$VariableManager]: TermVariabe Thread0_my_callback_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:00,344 WARN L315 ript$VariableManager]: TermVariabe Thread0_my_callback_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:00,344 WARN L315 ript$VariableManager]: TermVariabe Thread0_my_callback_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:00,344 WARN L315 ript$VariableManager]: TermVariabe Thread0_my_callback_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:00,344 WARN L315 ript$VariableManager]: TermVariabe Thread0_my_callback_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:00,345 WARN L315 ript$VariableManager]: TermVariabe Thread0_my_callback_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:00,345 WARN L315 ript$VariableManager]: TermVariabe |Thread0_my_callback_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:00,345 WARN L315 ript$VariableManager]: TermVariabe |Thread0_my_callback_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:00,345 WARN L315 ript$VariableManager]: TermVariabe Thread0_my_callback_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:00,346 WARN L315 ript$VariableManager]: TermVariabe Thread0_my_callback_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:00,346 WARN L315 ript$VariableManager]: TermVariabe Thread0_my_callback_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:00,346 WARN L315 ript$VariableManager]: TermVariabe Thread0_my_callback_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:00,346 WARN L315 ript$VariableManager]: TermVariabe |Thread0_my_callback_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:00,346 WARN L315 ript$VariableManager]: TermVariabe Thread0_my_callback_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:00,347 WARN L315 ript$VariableManager]: TermVariabe |Thread0_my_callback_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:00,347 WARN L315 ript$VariableManager]: TermVariabe Thread0_my_callback_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:00,347 WARN L315 ript$VariableManager]: TermVariabe |Thread0_my_callback_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:00,347 WARN L315 ript$VariableManager]: TermVariabe Thread0_my_callback_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:00,347 WARN L315 ript$VariableManager]: TermVariabe Thread0_my_callback_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:00,348 WARN L315 ript$VariableManager]: TermVariabe |Thread0_my_callback_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:00,348 WARN L315 ript$VariableManager]: TermVariabe |Thread0_my_callback_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:00,348 WARN L315 ript$VariableManager]: TermVariabe |Thread1_my_callback_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:00,348 WARN L315 ript$VariableManager]: TermVariabe |Thread1_my_callback_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:00,349 WARN L315 ript$VariableManager]: TermVariabe Thread1_my_callback_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:00,349 WARN L315 ript$VariableManager]: TermVariabe Thread1_my_callback_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:00,349 WARN L315 ript$VariableManager]: TermVariabe Thread1_my_callback_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:00,349 WARN L315 ript$VariableManager]: TermVariabe Thread1_my_callback_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:00,349 WARN L315 ript$VariableManager]: TermVariabe Thread1_my_callback_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:00,349 WARN L315 ript$VariableManager]: TermVariabe Thread1_my_callback_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:00,350 WARN L315 ript$VariableManager]: TermVariabe Thread1_my_callback_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:00,350 WARN L315 ript$VariableManager]: TermVariabe Thread1_my_callback_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:00,350 WARN L315 ript$VariableManager]: TermVariabe Thread1_my_callback_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:00,350 WARN L315 ript$VariableManager]: TermVariabe Thread1_my_callback_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:00,350 WARN L315 ript$VariableManager]: TermVariabe Thread1_my_callback_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:00,350 WARN L315 ript$VariableManager]: TermVariabe Thread1_my_callback_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:00,351 WARN L315 ript$VariableManager]: TermVariabe Thread1_my_callback_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:00,351 WARN L315 ript$VariableManager]: TermVariabe Thread1_my_callback_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:00,351 WARN L315 ript$VariableManager]: TermVariabe Thread1_my_callback_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:00,351 WARN L315 ript$VariableManager]: TermVariabe Thread1_my_callback_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:00,351 WARN L315 ript$VariableManager]: TermVariabe Thread1_my_callback_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:00,352 WARN L315 ript$VariableManager]: TermVariabe Thread1_my_callback_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:00,352 WARN L315 ript$VariableManager]: TermVariabe |Thread1_my_callback_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:00,352 WARN L315 ript$VariableManager]: TermVariabe |Thread1_my_callback_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:00,352 WARN L315 ript$VariableManager]: TermVariabe Thread1_my_callback_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:00,352 WARN L315 ript$VariableManager]: TermVariabe Thread1_my_callback_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:00,353 WARN L315 ript$VariableManager]: TermVariabe Thread1_my_callback_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:00,353 WARN L315 ript$VariableManager]: TermVariabe Thread1_my_callback_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:00,353 WARN L315 ript$VariableManager]: TermVariabe |Thread1_my_callback_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:00,353 WARN L315 ript$VariableManager]: TermVariabe Thread1_my_callback_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:00,353 WARN L315 ript$VariableManager]: TermVariabe |Thread1_my_callback_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:00,354 WARN L315 ript$VariableManager]: TermVariabe Thread1_my_callback_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:00,354 WARN L315 ript$VariableManager]: TermVariabe |Thread1_my_callback_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:00,354 WARN L315 ript$VariableManager]: TermVariabe Thread1_my_callback_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:00,354 WARN L315 ript$VariableManager]: TermVariabe Thread1_my_callback_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:00,354 WARN L315 ript$VariableManager]: TermVariabe |Thread1_my_callback_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:00,355 WARN L315 ript$VariableManager]: TermVariabe |Thread1_my_callback_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:27:00,398 WARN L141 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-10-22 11:27:00,398 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:27:00,413 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-10-22 11:27:00,423 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-10-22 11:27:00,441 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:27:00,442 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 11:27:00,442 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:27:00,442 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:27:00,442 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:27:00,442 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:27:00,442 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:27:00,442 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:27:00,455 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 146 places, 154 transitions [2019-10-22 11:27:00,872 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 9148 states. [2019-10-22 11:27:00,875 INFO L276 IsEmpty]: Start isEmpty. Operand 9148 states. [2019-10-22 11:27:00,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-22 11:27:00,893 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:00,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] [2019-10-22 11:27:00,896 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:00,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:00,903 INFO L82 PathProgramCache]: Analyzing trace with hash -1224475003, now seen corresponding path program 1 times [2019-10-22 11:27:00,912 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:00,912 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789861271] [2019-10-22 11:27:00,913 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:00,914 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:00,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:01,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:01,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:27:01,443 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789861271] [2019-10-22 11:27:01,445 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:01,446 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 11:27:01,446 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699594406] [2019-10-22 11:27:01,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:27:01,508 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:01,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:27:01,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:27:01,527 INFO L87 Difference]: Start difference. First operand 9148 states. Second operand 6 states. [2019-10-22 11:27:02,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:02,379 INFO L93 Difference]: Finished difference Result 12891 states and 35646 transitions. [2019-10-22 11:27:02,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-22 11:27:02,381 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2019-10-22 11:27:02,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:02,467 INFO L225 Difference]: With dead ends: 12891 [2019-10-22 11:27:02,468 INFO L226 Difference]: Without dead ends: 10816 [2019-10-22 11:27:02,473 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2019-10-22 11:27:02,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10816 states. [2019-10-22 11:27:02,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10816 to 8396. [2019-10-22 11:27:02,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8396 states. [2019-10-22 11:27:02,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8396 states to 8396 states and 22955 transitions. [2019-10-22 11:27:02,866 INFO L78 Accepts]: Start accepts. Automaton has 8396 states and 22955 transitions. Word has length 43 [2019-10-22 11:27:02,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:02,867 INFO L462 AbstractCegarLoop]: Abstraction has 8396 states and 22955 transitions. [2019-10-22 11:27:02,867 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:27:02,867 INFO L276 IsEmpty]: Start isEmpty. Operand 8396 states and 22955 transitions. [2019-10-22 11:27:02,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-22 11:27:02,874 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:02,875 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-10-22 11:27:02,875 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:02,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:02,876 INFO L82 PathProgramCache]: Analyzing trace with hash -883751660, now seen corresponding path program 1 times [2019-10-22 11:27:02,876 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:02,882 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915455362] [2019-10-22 11:27:02,883 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:02,883 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:02,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:02,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:03,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:27:03,049 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915455362] [2019-10-22 11:27:03,049 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:03,049 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 11:27:03,049 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553984183] [2019-10-22 11:27:03,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:27:03,051 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:03,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:27:03,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:27:03,051 INFO L87 Difference]: Start difference. First operand 8396 states and 22955 transitions. Second operand 6 states. [2019-10-22 11:27:03,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:03,710 INFO L93 Difference]: Finished difference Result 11652 states and 31765 transitions. [2019-10-22 11:27:03,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-22 11:27:03,711 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2019-10-22 11:27:03,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:03,767 INFO L225 Difference]: With dead ends: 11652 [2019-10-22 11:27:03,767 INFO L226 Difference]: Without dead ends: 9858 [2019-10-22 11:27:03,768 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-10-22 11:27:03,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9858 states. [2019-10-22 11:27:04,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9858 to 9536. [2019-10-22 11:27:04,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9536 states. [2019-10-22 11:27:04,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9536 states to 9536 states and 26143 transitions. [2019-10-22 11:27:04,076 INFO L78 Accepts]: Start accepts. Automaton has 9536 states and 26143 transitions. Word has length 49 [2019-10-22 11:27:04,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:04,077 INFO L462 AbstractCegarLoop]: Abstraction has 9536 states and 26143 transitions. [2019-10-22 11:27:04,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:27:04,077 INFO L276 IsEmpty]: Start isEmpty. Operand 9536 states and 26143 transitions. [2019-10-22 11:27:04,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-22 11:27:04,087 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:04,087 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-10-22 11:27:04,087 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:04,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:04,088 INFO L82 PathProgramCache]: Analyzing trace with hash 260691299, now seen corresponding path program 1 times [2019-10-22 11:27:04,088 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:04,089 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115984165] [2019-10-22 11:27:04,090 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:04,090 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:04,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:04,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:04,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:27:04,249 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115984165] [2019-10-22 11:27:04,250 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:04,250 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:27:04,250 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984420722] [2019-10-22 11:27:04,251 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:27:04,251 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:04,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:27:04,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:27:04,252 INFO L87 Difference]: Start difference. First operand 9536 states and 26143 transitions. Second operand 5 states. [2019-10-22 11:27:04,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:04,362 INFO L93 Difference]: Finished difference Result 3711 states and 9633 transitions. [2019-10-22 11:27:04,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 11:27:04,363 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2019-10-22 11:27:04,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:04,372 INFO L225 Difference]: With dead ends: 3711 [2019-10-22 11:27:04,372 INFO L226 Difference]: Without dead ends: 3711 [2019-10-22 11:27:04,372 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-22 11:27:04,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3711 states. [2019-10-22 11:27:04,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3711 to 3711. [2019-10-22 11:27:04,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3711 states. [2019-10-22 11:27:04,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3711 states to 3711 states and 9633 transitions. [2019-10-22 11:27:04,548 INFO L78 Accepts]: Start accepts. Automaton has 3711 states and 9633 transitions. Word has length 57 [2019-10-22 11:27:04,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:04,551 INFO L462 AbstractCegarLoop]: Abstraction has 3711 states and 9633 transitions. [2019-10-22 11:27:04,551 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:27:04,551 INFO L276 IsEmpty]: Start isEmpty. Operand 3711 states and 9633 transitions. [2019-10-22 11:27:04,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-10-22 11:27:04,560 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:04,560 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-10-22 11:27:04,560 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:04,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:04,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1114285814, now seen corresponding path program 1 times [2019-10-22 11:27:04,561 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:04,561 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400166749] [2019-10-22 11:27:04,561 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:04,561 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:04,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:04,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:04,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:27:04,704 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400166749] [2019-10-22 11:27:04,704 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:04,704 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 11:27:04,704 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763582635] [2019-10-22 11:27:04,705 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:27:04,705 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:04,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:27:04,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:27:04,706 INFO L87 Difference]: Start difference. First operand 3711 states and 9633 transitions. Second operand 6 states. [2019-10-22 11:27:05,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:05,305 INFO L93 Difference]: Finished difference Result 4016 states and 10182 transitions. [2019-10-22 11:27:05,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-22 11:27:05,305 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 72 [2019-10-22 11:27:05,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:05,314 INFO L225 Difference]: With dead ends: 4016 [2019-10-22 11:27:05,314 INFO L226 Difference]: Without dead ends: 4016 [2019-10-22 11:27:05,314 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2019-10-22 11:27:05,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4016 states. [2019-10-22 11:27:05,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4016 to 3763. [2019-10-22 11:27:05,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3763 states. [2019-10-22 11:27:05,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3763 states to 3763 states and 9725 transitions. [2019-10-22 11:27:05,408 INFO L78 Accepts]: Start accepts. Automaton has 3763 states and 9725 transitions. Word has length 72 [2019-10-22 11:27:05,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:05,408 INFO L462 AbstractCegarLoop]: Abstraction has 3763 states and 9725 transitions. [2019-10-22 11:27:05,408 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:27:05,408 INFO L276 IsEmpty]: Start isEmpty. Operand 3763 states and 9725 transitions. [2019-10-22 11:27:05,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-10-22 11:27:05,415 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:05,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, 1, 1, 1, 1, 1, 1] [2019-10-22 11:27:05,416 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:05,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:05,416 INFO L82 PathProgramCache]: Analyzing trace with hash -941065813, now seen corresponding path program 1 times [2019-10-22 11:27:05,417 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:05,417 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900092794] [2019-10-22 11:27:05,417 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:05,417 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:05,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:05,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:05,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:27:05,569 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900092794] [2019-10-22 11:27:05,569 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:05,569 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 11:27:05,570 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523332754] [2019-10-22 11:27:05,570 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:27:05,570 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:05,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:27:05,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:27:05,571 INFO L87 Difference]: Start difference. First operand 3763 states and 9725 transitions. Second operand 6 states. [2019-10-22 11:27:06,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:06,115 INFO L93 Difference]: Finished difference Result 4117 states and 10347 transitions. [2019-10-22 11:27:06,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-22 11:27:06,115 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2019-10-22 11:27:06,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:06,122 INFO L225 Difference]: With dead ends: 4117 [2019-10-22 11:27:06,123 INFO L226 Difference]: Without dead ends: 4117 [2019-10-22 11:27:06,123 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2019-10-22 11:27:06,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4117 states. [2019-10-22 11:27:06,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4117 to 3941. [2019-10-22 11:27:06,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3941 states. [2019-10-22 11:27:06,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3941 states to 3941 states and 10065 transitions. [2019-10-22 11:27:06,202 INFO L78 Accepts]: Start accepts. Automaton has 3941 states and 10065 transitions. Word has length 78 [2019-10-22 11:27:06,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:06,202 INFO L462 AbstractCegarLoop]: Abstraction has 3941 states and 10065 transitions. [2019-10-22 11:27:06,202 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:27:06,202 INFO L276 IsEmpty]: Start isEmpty. Operand 3941 states and 10065 transitions. [2019-10-22 11:27:06,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-10-22 11:27:06,208 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:06,209 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-10-22 11:27:06,209 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:06,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:06,209 INFO L82 PathProgramCache]: Analyzing trace with hash -1947996212, now seen corresponding path program 1 times [2019-10-22 11:27:06,209 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:06,210 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911758026] [2019-10-22 11:27:06,210 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:06,210 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:06,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:06,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:06,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:27:06,460 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911758026] [2019-10-22 11:27:06,461 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:06,461 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-22 11:27:06,461 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857200534] [2019-10-22 11:27:06,461 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-22 11:27:06,461 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:06,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-22 11:27:06,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-22 11:27:06,462 INFO L87 Difference]: Start difference. First operand 3941 states and 10065 transitions. Second operand 8 states. [2019-10-22 11:27:06,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:06,891 INFO L93 Difference]: Finished difference Result 4147 states and 10459 transitions. [2019-10-22 11:27:06,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-22 11:27:06,891 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 80 [2019-10-22 11:27:06,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:06,899 INFO L225 Difference]: With dead ends: 4147 [2019-10-22 11:27:06,899 INFO L226 Difference]: Without dead ends: 4147 [2019-10-22 11:27:06,899 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2019-10-22 11:27:06,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4147 states. [2019-10-22 11:27:06,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4147 to 4102. [2019-10-22 11:27:06,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4102 states. [2019-10-22 11:27:06,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4102 states to 4102 states and 10372 transitions. [2019-10-22 11:27:06,981 INFO L78 Accepts]: Start accepts. Automaton has 4102 states and 10372 transitions. Word has length 80 [2019-10-22 11:27:06,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:06,981 INFO L462 AbstractCegarLoop]: Abstraction has 4102 states and 10372 transitions. [2019-10-22 11:27:06,981 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-22 11:27:06,981 INFO L276 IsEmpty]: Start isEmpty. Operand 4102 states and 10372 transitions. [2019-10-22 11:27:06,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-10-22 11:27:06,989 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:06,990 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-10-22 11:27:06,990 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:06,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:06,990 INFO L82 PathProgramCache]: Analyzing trace with hash -1874700151, now seen corresponding path program 1 times [2019-10-22 11:27:06,990 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:06,990 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354569754] [2019-10-22 11:27:06,991 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:06,991 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:06,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:07,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:08,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:27:08,129 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354569754] [2019-10-22 11:27:08,129 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:08,129 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-10-22 11:27:08,129 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222372458] [2019-10-22 11:27:08,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-22 11:27:08,130 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:08,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-22 11:27:08,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2019-10-22 11:27:08,130 INFO L87 Difference]: Start difference. First operand 4102 states and 10372 transitions. Second operand 18 states. [2019-10-22 11:27:08,983 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2019-10-22 11:27:09,196 WARN L191 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-10-22 11:27:09,480 WARN L191 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-10-22 11:27:09,681 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-10-22 11:27:09,945 WARN L191 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-10-22 11:27:10,174 WARN L191 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 63 [2019-10-22 11:27:10,431 WARN L191 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 67 [2019-10-22 11:27:10,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:10,739 INFO L93 Difference]: Finished difference Result 13804 states and 34451 transitions. [2019-10-22 11:27:10,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-22 11:27:10,744 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 80 [2019-10-22 11:27:10,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:10,784 INFO L225 Difference]: With dead ends: 13804 [2019-10-22 11:27:10,784 INFO L226 Difference]: Without dead ends: 13804 [2019-10-22 11:27:10,785 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=287, Invalid=705, Unknown=0, NotChecked=0, Total=992 [2019-10-22 11:27:10,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13804 states. [2019-10-22 11:27:11,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13804 to 4409. [2019-10-22 11:27:11,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4409 states. [2019-10-22 11:27:11,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4409 states to 4409 states and 11180 transitions. [2019-10-22 11:27:11,021 INFO L78 Accepts]: Start accepts. Automaton has 4409 states and 11180 transitions. Word has length 80 [2019-10-22 11:27:11,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:11,022 INFO L462 AbstractCegarLoop]: Abstraction has 4409 states and 11180 transitions. [2019-10-22 11:27:11,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-22 11:27:11,022 INFO L276 IsEmpty]: Start isEmpty. Operand 4409 states and 11180 transitions. [2019-10-22 11:27:11,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-10-22 11:27:11,033 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:11,033 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-10-22 11:27:11,033 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:11,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:11,034 INFO L82 PathProgramCache]: Analyzing trace with hash 367320024, now seen corresponding path program 2 times [2019-10-22 11:27:11,034 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:11,034 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176969848] [2019-10-22 11:27:11,034 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:11,034 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:11,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:11,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:11,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:27:11,676 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176969848] [2019-10-22 11:27:11,676 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:11,676 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-10-22 11:27:11,676 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427956097] [2019-10-22 11:27:11,677 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-22 11:27:11,677 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:11,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-22 11:27:11,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-10-22 11:27:11,678 INFO L87 Difference]: Start difference. First operand 4409 states and 11180 transitions. Second operand 17 states. [2019-10-22 11:27:13,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:13,322 INFO L93 Difference]: Finished difference Result 4301 states and 10952 transitions. [2019-10-22 11:27:13,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-22 11:27:13,322 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 80 [2019-10-22 11:27:13,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:13,330 INFO L225 Difference]: With dead ends: 4301 [2019-10-22 11:27:13,331 INFO L226 Difference]: Without dead ends: 4301 [2019-10-22 11:27:13,331 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=356, Invalid=766, Unknown=0, NotChecked=0, Total=1122 [2019-10-22 11:27:13,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4301 states. [2019-10-22 11:27:13,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4301 to 4143. [2019-10-22 11:27:13,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4143 states. [2019-10-22 11:27:13,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4143 states to 4143 states and 10658 transitions. [2019-10-22 11:27:13,405 INFO L78 Accepts]: Start accepts. Automaton has 4143 states and 10658 transitions. Word has length 80 [2019-10-22 11:27:13,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:13,405 INFO L462 AbstractCegarLoop]: Abstraction has 4143 states and 10658 transitions. [2019-10-22 11:27:13,405 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-22 11:27:13,405 INFO L276 IsEmpty]: Start isEmpty. Operand 4143 states and 10658 transitions. [2019-10-22 11:27:13,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-10-22 11:27:13,412 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:13,412 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-10-22 11:27:13,412 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:13,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:13,413 INFO L82 PathProgramCache]: Analyzing trace with hash 9575591, now seen corresponding path program 2 times [2019-10-22 11:27:13,413 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:13,413 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511009391] [2019-10-22 11:27:13,413 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:13,413 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:13,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:13,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:14,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:27:14,163 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511009391] [2019-10-22 11:27:14,163 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:14,163 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-10-22 11:27:14,163 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232495537] [2019-10-22 11:27:14,163 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-22 11:27:14,164 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:14,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-22 11:27:14,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2019-10-22 11:27:14,164 INFO L87 Difference]: Start difference. First operand 4143 states and 10658 transitions. Second operand 18 states. [2019-10-22 11:27:15,071 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-10-22 11:27:15,285 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-10-22 11:27:15,547 WARN L191 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-10-22 11:27:15,781 WARN L191 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-10-22 11:27:16,044 WARN L191 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2019-10-22 11:27:16,286 WARN L191 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 67 [2019-10-22 11:27:16,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:16,491 INFO L93 Difference]: Finished difference Result 12814 states and 32036 transitions. [2019-10-22 11:27:16,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-22 11:27:16,492 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 80 [2019-10-22 11:27:16,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:16,511 INFO L225 Difference]: With dead ends: 12814 [2019-10-22 11:27:16,511 INFO L226 Difference]: Without dead ends: 12814 [2019-10-22 11:27:16,511 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=287, Invalid=705, Unknown=0, NotChecked=0, Total=992 [2019-10-22 11:27:16,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12814 states. [2019-10-22 11:27:16,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12814 to 4238. [2019-10-22 11:27:16,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4238 states. [2019-10-22 11:27:16,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4238 states to 4238 states and 10850 transitions. [2019-10-22 11:27:16,646 INFO L78 Accepts]: Start accepts. Automaton has 4238 states and 10850 transitions. Word has length 80 [2019-10-22 11:27:16,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:16,646 INFO L462 AbstractCegarLoop]: Abstraction has 4238 states and 10850 transitions. [2019-10-22 11:27:16,646 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-22 11:27:16,646 INFO L276 IsEmpty]: Start isEmpty. Operand 4238 states and 10850 transitions. [2019-10-22 11:27:16,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-10-22 11:27:16,654 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:16,654 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-10-22 11:27:16,654 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:16,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:16,654 INFO L82 PathProgramCache]: Analyzing trace with hash 681481127, now seen corresponding path program 3 times [2019-10-22 11:27:16,655 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:16,655 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189782524] [2019-10-22 11:27:16,655 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:16,655 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:16,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:16,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 11:27:16,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 11:27:16,783 INFO L168 tionRefinementEngine]: Strategy TAIPAN found a feasible trace [2019-10-22 11:27:16,784 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-10-22 11:27:16,852 INFO L303 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-10-22 11:27:16,853 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 11:27:16 BasicIcfg [2019-10-22 11:27:16,853 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 11:27:16,854 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 11:27:16,854 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 11:27:16,854 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 11:27:16,855 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:27:00" (3/4) ... [2019-10-22 11:27:16,857 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-10-22 11:27:16,935 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_2c265d7b-3896-4c8a-b09a-97d71aa8c2dc/bin/utaipan/witness.graphml [2019-10-22 11:27:16,935 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 11:27:16,937 INFO L168 Benchmark]: Toolchain (without parser) took 18826.49 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 516.9 MB). Free memory was 944.5 MB in the beginning and 1.2 GB in the end (delta: -218.7 MB). Peak memory consumption was 298.2 MB. Max. memory is 11.5 GB. [2019-10-22 11:27:16,937 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:27:16,937 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1163.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 944.5 MB in the beginning and 1.0 GB in the end (delta: -56.1 MB). Peak memory consumption was 95.4 MB. Max. memory is 11.5 GB. [2019-10-22 11:27:16,938 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.24 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 993.9 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-10-22 11:27:16,938 INFO L168 Benchmark]: Boogie Preprocessor took 38.79 ms. Allocated memory is still 1.2 GB. Free memory is still 993.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:27:16,938 INFO L168 Benchmark]: RCFGBuilder took 932.93 ms. Allocated memory is still 1.2 GB. Free memory was 993.9 MB in the beginning and 939.4 MB in the end (delta: 54.5 MB). Peak memory consumption was 54.5 MB. Max. memory is 11.5 GB. [2019-10-22 11:27:16,939 INFO L168 Benchmark]: TraceAbstraction took 16549.28 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 378.5 MB). Free memory was 939.4 MB in the beginning and 1.2 GB in the end (delta: -241.2 MB). Peak memory consumption was 137.3 MB. Max. memory is 11.5 GB. [2019-10-22 11:27:16,939 INFO L168 Benchmark]: Witness Printer took 81.43 ms. Allocated memory is still 1.5 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 17.4 MB). Peak memory consumption was 17.4 MB. Max. memory is 11.5 GB. [2019-10-22 11:27:16,941 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1163.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 944.5 MB in the beginning and 1.0 GB in the end (delta: -56.1 MB). Peak memory consumption was 95.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 56.24 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 993.9 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 38.79 ms. Allocated memory is still 1.2 GB. Free memory is still 993.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 932.93 ms. Allocated memory is still 1.2 GB. Free memory was 993.9 MB in the beginning and 939.4 MB in the end (delta: 54.5 MB). Peak memory consumption was 54.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 16549.28 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 378.5 MB). Free memory was 939.4 MB in the beginning and 1.2 GB in the end (delta: -241.2 MB). Peak memory consumption was 137.3 MB. Max. memory is 11.5 GB. * Witness Printer took 81.43 ms. Allocated memory is still 1.5 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 17.4 MB). Peak memory consumption was 17.4 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}] [L1715] 0 return 0; 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}] [L1697] 1 struct my_data *data; 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}, 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}, 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: 16.4s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 10.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2275 SDtfs, 6822 SDslu, 8412 SDs, 0 SdLazy, 2281 SolverSat, 171 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 206 GetRequests, 38 SyntacticMatches, 9 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 7.1s 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.5s AutomataMinimizationTime, 9 MinimizatonAttempts, 21345 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 699 NumberOfCodeBlocks, 699 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 610 ConstructedInterpolants, 0 QuantifiedInterpolants, 237019 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...