./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/ldv-races/race-2_5-container_of_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/ldv-races/race-2_5-container_of_false-unreach-call.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f304bbeec274f04c648f2bacc19ae28d00889b1b .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-0ed9222-m [2019-01-13 05:53:03,209 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-13 05:53:03,211 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-13 05:53:03,224 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-13 05:53:03,224 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-13 05:53:03,225 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-13 05:53:03,227 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-13 05:53:03,229 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-13 05:53:03,230 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-13 05:53:03,231 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-13 05:53:03,232 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-13 05:53:03,233 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-13 05:53:03,234 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-13 05:53:03,235 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-13 05:53:03,236 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-13 05:53:03,237 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-13 05:53:03,238 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-13 05:53:03,240 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-13 05:53:03,242 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-13 05:53:03,244 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-13 05:53:03,245 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-13 05:53:03,247 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-13 05:53:03,250 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-13 05:53:03,250 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-13 05:53:03,250 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-13 05:53:03,252 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-13 05:53:03,253 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-13 05:53:03,254 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-13 05:53:03,255 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-13 05:53:03,256 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-13 05:53:03,256 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-13 05:53:03,257 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-13 05:53:03,257 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-13 05:53:03,258 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-13 05:53:03,259 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-13 05:53:03,260 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-13 05:53:03,260 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-13 05:53:03,278 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-13 05:53:03,278 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-13 05:53:03,279 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-13 05:53:03,280 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-13 05:53:03,280 INFO L133 SettingsManager]: * Use SBE=true [2019-01-13 05:53:03,280 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-13 05:53:03,281 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-13 05:53:03,281 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-13 05:53:03,281 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-13 05:53:03,281 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-13 05:53:03,282 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-13 05:53:03,282 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-13 05:53:03,282 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-13 05:53:03,282 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-13 05:53:03,283 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-13 05:53:03,283 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-13 05:53:03,283 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-13 05:53:03,283 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-13 05:53:03,284 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-13 05:53:03,284 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-13 05:53:03,284 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-13 05:53:03,284 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 05:53:03,284 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-13 05:53:03,285 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-13 05:53:03,285 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-13 05:53:03,285 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-13 05:53:03,285 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-13 05:53:03,286 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-13 05:53:03,286 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f304bbeec274f04c648f2bacc19ae28d00889b1b [2019-01-13 05:53:03,323 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-13 05:53:03,337 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-13 05:53:03,341 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-13 05:53:03,342 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-13 05:53:03,343 INFO L276 PluginConnector]: CDTParser initialized [2019-01-13 05:53:03,343 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ldv-races/race-2_5-container_of_false-unreach-call.i [2019-01-13 05:53:03,400 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b71e90a3/94eb2229a28f4a03be9025cac238d7a7/FLAG4f7462e71 [2019-01-13 05:53:04,058 INFO L307 CDTParser]: Found 1 translation units. [2019-01-13 05:53:04,058 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ldv-races/race-2_5-container_of_false-unreach-call.i [2019-01-13 05:53:04,091 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b71e90a3/94eb2229a28f4a03be9025cac238d7a7/FLAG4f7462e71 [2019-01-13 05:53:04,180 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b71e90a3/94eb2229a28f4a03be9025cac238d7a7 [2019-01-13 05:53:04,185 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-13 05:53:04,187 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-13 05:53:04,188 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-13 05:53:04,189 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-13 05:53:04,193 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-13 05:53:04,194 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 05:53:04" (1/1) ... [2019-01-13 05:53:04,197 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63fbcbc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:53:04, skipping insertion in model container [2019-01-13 05:53:04,197 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 05:53:04" (1/1) ... [2019-01-13 05:53:04,206 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-13 05:53:04,298 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-13 05:53:05,084 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 05:53:05,094 INFO L191 MainTranslator]: Completed pre-run [2019-01-13 05:53:05,308 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 05:53:05,724 INFO L195 MainTranslator]: Completed translation [2019-01-13 05:53:05,725 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:53:05 WrapperNode [2019-01-13 05:53:05,725 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-13 05:53:05,726 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-13 05:53:05,726 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-13 05:53:05,727 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-13 05:53:05,738 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:53:05" (1/1) ... [2019-01-13 05:53:05,803 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:53:05" (1/1) ... [2019-01-13 05:53:05,858 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-13 05:53:05,859 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-13 05:53:05,859 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-13 05:53:05,859 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-13 05:53:05,870 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:53:05" (1/1) ... [2019-01-13 05:53:05,871 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:53:05" (1/1) ... [2019-01-13 05:53:05,883 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:53:05" (1/1) ... [2019-01-13 05:53:05,884 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:53:05" (1/1) ... [2019-01-13 05:53:05,918 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:53:05" (1/1) ... [2019-01-13 05:53:05,924 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:53:05" (1/1) ... [2019-01-13 05:53:05,933 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:53:05" (1/1) ... [2019-01-13 05:53:05,945 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-13 05:53:05,946 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-13 05:53:05,946 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-13 05:53:05,946 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-13 05:53:05,949 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:53:05" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 05:53:06,006 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-13 05:53:06,007 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-13 05:53:06,007 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2019-01-13 05:53:06,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-13 05:53:06,007 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-13 05:53:06,007 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-13 05:53:06,008 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2019-01-13 05:53:06,008 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2019-01-13 05:53:06,008 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-13 05:53:06,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-13 05:53:06,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-13 05:53:06,010 WARN L204 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-01-13 05:53:07,036 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-13 05:53:07,037 INFO L286 CfgBuilder]: Removed 24 assue(true) statements. [2019-01-13 05:53:07,038 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 05:53:07 BoogieIcfgContainer [2019-01-13 05:53:07,038 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-13 05:53:07,041 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-13 05:53:07,041 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-13 05:53:07,045 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-13 05:53:07,045 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.01 05:53:04" (1/3) ... [2019-01-13 05:53:07,047 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30487703 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 05:53:07, skipping insertion in model container [2019-01-13 05:53:07,047 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:53:05" (2/3) ... [2019-01-13 05:53:07,047 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30487703 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 05:53:07, skipping insertion in model container [2019-01-13 05:53:07,047 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 05:53:07" (3/3) ... [2019-01-13 05:53:07,050 INFO L112 eAbstractionObserver]: Analyzing ICFG race-2_5-container_of_false-unreach-call.i [2019-01-13 05:53:07,094 WARN L317 ript$VariableManager]: TermVariabe |Thread0_my_callback_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:53:07,094 WARN L317 ript$VariableManager]: TermVariabe |Thread0_my_callback_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:53:07,094 WARN L317 ript$VariableManager]: TermVariabe Thread0_my_callback_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:53:07,094 WARN L317 ript$VariableManager]: TermVariabe Thread0_my_callback_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:53:07,095 WARN L317 ript$VariableManager]: TermVariabe Thread0_my_callback_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:53:07,095 WARN L317 ript$VariableManager]: TermVariabe Thread0_my_callback_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:53:07,095 WARN L317 ript$VariableManager]: TermVariabe Thread0_my_callback_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:53:07,095 WARN L317 ript$VariableManager]: TermVariabe Thread0_my_callback_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:53:07,095 WARN L317 ript$VariableManager]: TermVariabe Thread0_my_callback_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:53:07,096 WARN L317 ript$VariableManager]: TermVariabe Thread0_my_callback_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:53:07,096 WARN L317 ript$VariableManager]: TermVariabe Thread0_my_callback_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:53:07,096 WARN L317 ript$VariableManager]: TermVariabe Thread0_my_callback_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:53:07,096 WARN L317 ript$VariableManager]: TermVariabe Thread0_my_callback_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:53:07,096 WARN L317 ript$VariableManager]: TermVariabe Thread0_my_callback_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:53:07,096 WARN L317 ript$VariableManager]: TermVariabe Thread0_my_callback_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:53:07,097 WARN L317 ript$VariableManager]: TermVariabe Thread0_my_callback_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:53:07,097 WARN L317 ript$VariableManager]: TermVariabe Thread0_my_callback_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:53:07,097 WARN L317 ript$VariableManager]: TermVariabe Thread0_my_callback_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:53:07,097 WARN L317 ript$VariableManager]: TermVariabe Thread0_my_callback_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:53:07,097 WARN L317 ript$VariableManager]: TermVariabe Thread0_my_callback_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:53:07,098 WARN L317 ript$VariableManager]: TermVariabe |Thread0_my_callback_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:53:07,098 WARN L317 ript$VariableManager]: TermVariabe |Thread0_my_callback_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:53:07,098 WARN L317 ript$VariableManager]: TermVariabe Thread0_my_callback_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:53:07,098 WARN L317 ript$VariableManager]: TermVariabe Thread0_my_callback_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:53:07,099 WARN L317 ript$VariableManager]: TermVariabe Thread0_my_callback_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:53:07,099 WARN L317 ript$VariableManager]: TermVariabe Thread0_my_callback_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:53:07,099 WARN L317 ript$VariableManager]: TermVariabe |Thread0_my_callback_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:53:07,099 WARN L317 ript$VariableManager]: TermVariabe Thread0_my_callback_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:53:07,100 WARN L317 ript$VariableManager]: TermVariabe |Thread0_my_callback_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:53:07,100 WARN L317 ript$VariableManager]: TermVariabe Thread0_my_callback_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:53:07,100 WARN L317 ript$VariableManager]: TermVariabe |Thread0_my_callback_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:53:07,100 WARN L317 ript$VariableManager]: TermVariabe Thread0_my_callback_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:53:07,100 WARN L317 ript$VariableManager]: TermVariabe Thread0_my_callback_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:53:07,101 WARN L317 ript$VariableManager]: TermVariabe |Thread0_my_callback_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:53:07,101 WARN L317 ript$VariableManager]: TermVariabe |Thread0_my_callback_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:53:07,101 WARN L317 ript$VariableManager]: TermVariabe |Thread1_my_callback_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:53:07,102 WARN L317 ript$VariableManager]: TermVariabe |Thread1_my_callback_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:53:07,102 WARN L317 ript$VariableManager]: TermVariabe Thread1_my_callback_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:53:07,102 WARN L317 ript$VariableManager]: TermVariabe Thread1_my_callback_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:53:07,102 WARN L317 ript$VariableManager]: TermVariabe Thread1_my_callback_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:53:07,102 WARN L317 ript$VariableManager]: TermVariabe Thread1_my_callback_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:53:07,102 WARN L317 ript$VariableManager]: TermVariabe Thread1_my_callback_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:53:07,103 WARN L317 ript$VariableManager]: TermVariabe Thread1_my_callback_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:53:07,103 WARN L317 ript$VariableManager]: TermVariabe Thread1_my_callback_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:53:07,103 WARN L317 ript$VariableManager]: TermVariabe Thread1_my_callback_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:53:07,103 WARN L317 ript$VariableManager]: TermVariabe Thread1_my_callback_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:53:07,103 WARN L317 ript$VariableManager]: TermVariabe Thread1_my_callback_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:53:07,104 WARN L317 ript$VariableManager]: TermVariabe Thread1_my_callback_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:53:07,104 WARN L317 ript$VariableManager]: TermVariabe Thread1_my_callback_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:53:07,104 WARN L317 ript$VariableManager]: TermVariabe Thread1_my_callback_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:53:07,104 WARN L317 ript$VariableManager]: TermVariabe Thread1_my_callback_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:53:07,104 WARN L317 ript$VariableManager]: TermVariabe Thread1_my_callback_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:53:07,104 WARN L317 ript$VariableManager]: TermVariabe Thread1_my_callback_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:53:07,105 WARN L317 ript$VariableManager]: TermVariabe Thread1_my_callback_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:53:07,105 WARN L317 ript$VariableManager]: TermVariabe Thread1_my_callback_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:53:07,105 WARN L317 ript$VariableManager]: TermVariabe |Thread1_my_callback_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:53:07,105 WARN L317 ript$VariableManager]: TermVariabe |Thread1_my_callback_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:53:07,105 WARN L317 ript$VariableManager]: TermVariabe Thread1_my_callback_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:53:07,110 WARN L317 ript$VariableManager]: TermVariabe Thread1_my_callback_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:53:07,110 WARN L317 ript$VariableManager]: TermVariabe Thread1_my_callback_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:53:07,110 WARN L317 ript$VariableManager]: TermVariabe Thread1_my_callback_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:53:07,111 WARN L317 ript$VariableManager]: TermVariabe |Thread1_my_callback_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:53:07,111 WARN L317 ript$VariableManager]: TermVariabe Thread1_my_callback_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:53:07,111 WARN L317 ript$VariableManager]: TermVariabe |Thread1_my_callback_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:53:07,111 WARN L317 ript$VariableManager]: TermVariabe Thread1_my_callback_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:53:07,111 WARN L317 ript$VariableManager]: TermVariabe |Thread1_my_callback_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:53:07,112 WARN L317 ript$VariableManager]: TermVariabe Thread1_my_callback_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:53:07,112 WARN L317 ript$VariableManager]: TermVariabe Thread1_my_callback_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:53:07,112 WARN L317 ript$VariableManager]: TermVariabe |Thread1_my_callback_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:53:07,112 WARN L317 ript$VariableManager]: TermVariabe |Thread1_my_callback_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:53:07,140 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-01-13 05:53:07,140 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-13 05:53:07,149 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-01-13 05:53:07,167 INFO L257 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-01-13 05:53:07,194 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-13 05:53:07,195 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-13 05:53:07,195 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-13 05:53:07,195 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-13 05:53:07,195 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-13 05:53:07,195 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-13 05:53:07,196 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-13 05:53:07,196 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-13 05:53:07,196 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-13 05:53:07,210 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 146places, 154 transitions [2019-01-13 05:53:07,591 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 9148 states. [2019-01-13 05:53:07,594 INFO L276 IsEmpty]: Start isEmpty. Operand 9148 states. [2019-01-13 05:53:07,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-01-13 05:53:07,616 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:53:07,617 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 05:53:07,619 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:53:07,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:53:07,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1070418997, now seen corresponding path program 1 times [2019-01-13 05:53:07,629 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:53:07,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:53:07,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:53:07,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:53:07,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:53:07,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:53:08,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:53:08,347 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:53:08,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 05:53:08,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 05:53:08,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 05:53:08,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-13 05:53:08,371 INFO L87 Difference]: Start difference. First operand 9148 states. Second operand 6 states. [2019-01-13 05:53:08,938 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2019-01-13 05:53:10,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:53:10,270 INFO L93 Difference]: Finished difference Result 13043 states and 36091 transitions. [2019-01-13 05:53:10,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-13 05:53:10,272 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2019-01-13 05:53:10,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:53:10,367 INFO L225 Difference]: With dead ends: 13043 [2019-01-13 05:53:10,367 INFO L226 Difference]: Without dead ends: 10972 [2019-01-13 05:53:10,369 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2019-01-13 05:53:10,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10972 states. [2019-01-13 05:53:10,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10972 to 8396. [2019-01-13 05:53:10,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8396 states. [2019-01-13 05:53:10,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8396 states to 8396 states and 22955 transitions. [2019-01-13 05:53:10,745 INFO L78 Accepts]: Start accepts. Automaton has 8396 states and 22955 transitions. Word has length 43 [2019-01-13 05:53:10,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:53:10,746 INFO L480 AbstractCegarLoop]: Abstraction has 8396 states and 22955 transitions. [2019-01-13 05:53:10,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 05:53:10,746 INFO L276 IsEmpty]: Start isEmpty. Operand 8396 states and 22955 transitions. [2019-01-13 05:53:10,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-01-13 05:53:10,755 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:53:10,755 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 05:53:10,755 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:53:10,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:53:10,756 INFO L82 PathProgramCache]: Analyzing trace with hash -31792251, now seen corresponding path program 1 times [2019-01-13 05:53:10,756 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:53:10,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:53:10,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:53:10,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:53:10,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:53:10,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:53:11,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:53:11,107 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:53:11,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-13 05:53:11,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-13 05:53:11,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-13 05:53:11,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-01-13 05:53:11,109 INFO L87 Difference]: Start difference. First operand 8396 states and 22955 transitions. Second operand 8 states. [2019-01-13 05:53:11,504 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2019-01-13 05:53:12,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:53:12,766 INFO L93 Difference]: Finished difference Result 11652 states and 31765 transitions. [2019-01-13 05:53:12,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-13 05:53:12,767 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2019-01-13 05:53:12,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:53:12,819 INFO L225 Difference]: With dead ends: 11652 [2019-01-13 05:53:12,819 INFO L226 Difference]: Without dead ends: 9858 [2019-01-13 05:53:12,820 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2019-01-13 05:53:12,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9858 states. [2019-01-13 05:53:13,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9858 to 9536. [2019-01-13 05:53:13,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9536 states. [2019-01-13 05:53:13,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9536 states to 9536 states and 26143 transitions. [2019-01-13 05:53:13,071 INFO L78 Accepts]: Start accepts. Automaton has 9536 states and 26143 transitions. Word has length 49 [2019-01-13 05:53:13,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:53:13,072 INFO L480 AbstractCegarLoop]: Abstraction has 9536 states and 26143 transitions. [2019-01-13 05:53:13,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-13 05:53:13,072 INFO L276 IsEmpty]: Start isEmpty. Operand 9536 states and 26143 transitions. [2019-01-13 05:53:13,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-01-13 05:53:13,086 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:53:13,086 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 05:53:13,087 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:53:13,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:53:13,088 INFO L82 PathProgramCache]: Analyzing trace with hash -1087713938, now seen corresponding path program 1 times [2019-01-13 05:53:13,088 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:53:13,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:53:13,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:53:13,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:53:13,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:53:13,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:53:13,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:53:13,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:53:13,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 05:53:13,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 05:53:13,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 05:53:13,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 05:53:13,362 INFO L87 Difference]: Start difference. First operand 9536 states and 26143 transitions. Second operand 5 states. [2019-01-13 05:53:13,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:53:13,488 INFO L93 Difference]: Finished difference Result 3711 states and 9633 transitions. [2019-01-13 05:53:13,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 05:53:13,490 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2019-01-13 05:53:13,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:53:13,498 INFO L225 Difference]: With dead ends: 3711 [2019-01-13 05:53:13,498 INFO L226 Difference]: Without dead ends: 3711 [2019-01-13 05:53:13,499 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-13 05:53:13,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3711 states. [2019-01-13 05:53:13,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3711 to 3711. [2019-01-13 05:53:13,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3711 states. [2019-01-13 05:53:13,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3711 states to 3711 states and 9633 transitions. [2019-01-13 05:53:13,595 INFO L78 Accepts]: Start accepts. Automaton has 3711 states and 9633 transitions. Word has length 57 [2019-01-13 05:53:13,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:53:13,596 INFO L480 AbstractCegarLoop]: Abstraction has 3711 states and 9633 transitions. [2019-01-13 05:53:13,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 05:53:13,596 INFO L276 IsEmpty]: Start isEmpty. Operand 3711 states and 9633 transitions. [2019-01-13 05:53:13,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-01-13 05:53:13,606 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:53:13,606 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 05:53:13,606 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:53:13,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:53:13,607 INFO L82 PathProgramCache]: Analyzing trace with hash 527323425, now seen corresponding path program 1 times [2019-01-13 05:53:13,607 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:53:13,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:53:13,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:53:13,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:53:13,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:53:13,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:53:14,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:53:14,005 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:53:14,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 05:53:14,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 05:53:14,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 05:53:14,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-13 05:53:14,006 INFO L87 Difference]: Start difference. First operand 3711 states and 9633 transitions. Second operand 6 states. [2019-01-13 05:53:14,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:53:14,594 INFO L93 Difference]: Finished difference Result 4030 states and 10208 transitions. [2019-01-13 05:53:14,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-13 05:53:14,598 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 72 [2019-01-13 05:53:14,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:53:14,607 INFO L225 Difference]: With dead ends: 4030 [2019-01-13 05:53:14,608 INFO L226 Difference]: Without dead ends: 4030 [2019-01-13 05:53:14,608 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2019-01-13 05:53:14,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4030 states. [2019-01-13 05:53:14,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4030 to 3763. [2019-01-13 05:53:14,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3763 states. [2019-01-13 05:53:14,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3763 states to 3763 states and 9725 transitions. [2019-01-13 05:53:14,690 INFO L78 Accepts]: Start accepts. Automaton has 3763 states and 9725 transitions. Word has length 72 [2019-01-13 05:53:14,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:53:14,691 INFO L480 AbstractCegarLoop]: Abstraction has 3763 states and 9725 transitions. [2019-01-13 05:53:14,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 05:53:14,691 INFO L276 IsEmpty]: Start isEmpty. Operand 3763 states and 9725 transitions. [2019-01-13 05:53:14,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-01-13 05:53:14,700 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:53:14,700 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 05:53:14,700 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:53:14,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:53:14,701 INFO L82 PathProgramCache]: Analyzing trace with hash -326132827, now seen corresponding path program 1 times [2019-01-13 05:53:14,701 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:53:14,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:53:14,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:53:14,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:53:14,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:53:14,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:53:15,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:53:15,048 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:53:15,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-13 05:53:15,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-13 05:53:15,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-13 05:53:15,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-01-13 05:53:15,049 INFO L87 Difference]: Start difference. First operand 3763 states and 9725 transitions. Second operand 8 states. [2019-01-13 05:53:16,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:53:16,503 INFO L93 Difference]: Finished difference Result 4117 states and 10347 transitions. [2019-01-13 05:53:16,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-13 05:53:16,504 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 78 [2019-01-13 05:53:16,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:53:16,513 INFO L225 Difference]: With dead ends: 4117 [2019-01-13 05:53:16,514 INFO L226 Difference]: Without dead ends: 4117 [2019-01-13 05:53:16,514 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2019-01-13 05:53:16,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4117 states. [2019-01-13 05:53:16,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4117 to 3941. [2019-01-13 05:53:16,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3941 states. [2019-01-13 05:53:16,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3941 states to 3941 states and 10065 transitions. [2019-01-13 05:53:16,600 INFO L78 Accepts]: Start accepts. Automaton has 3941 states and 10065 transitions. Word has length 78 [2019-01-13 05:53:16,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:53:16,601 INFO L480 AbstractCegarLoop]: Abstraction has 3941 states and 10065 transitions. [2019-01-13 05:53:16,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-13 05:53:16,601 INFO L276 IsEmpty]: Start isEmpty. Operand 3941 states and 10065 transitions. [2019-01-13 05:53:16,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-01-13 05:53:16,610 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:53:16,611 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 05:53:16,611 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:53:16,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:53:16,611 INFO L82 PathProgramCache]: Analyzing trace with hash 496767872, now seen corresponding path program 1 times [2019-01-13 05:53:16,611 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:53:16,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:53:16,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:53:16,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:53:16,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:53:16,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:53:18,022 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 19 [2019-01-13 05:53:18,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:53:18,129 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:53:18,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-01-13 05:53:18,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-13 05:53:18,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-13 05:53:18,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2019-01-13 05:53:18,131 INFO L87 Difference]: Start difference. First operand 3941 states and 10065 transitions. Second operand 20 states. [2019-01-13 05:53:19,097 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 33 [2019-01-13 05:53:19,324 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 38 [2019-01-13 05:53:19,623 WARN L181 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2019-01-13 05:53:19,899 WARN L181 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2019-01-13 05:53:20,170 WARN L181 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 52 [2019-01-13 05:53:20,548 WARN L181 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2019-01-13 05:53:20,864 WARN L181 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 62 [2019-01-13 05:53:21,275 WARN L181 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 69 [2019-01-13 05:53:21,797 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 36 [2019-01-13 05:53:22,089 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 41 [2019-01-13 05:53:22,475 WARN L181 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2019-01-13 05:53:22,659 WARN L181 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 46 [2019-01-13 05:53:22,968 WARN L181 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2019-01-13 05:53:23,198 WARN L181 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2019-01-13 05:53:23,626 WARN L181 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 65 [2019-01-13 05:53:23,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:53:23,868 INFO L93 Difference]: Finished difference Result 13224 states and 33348 transitions. [2019-01-13 05:53:23,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-01-13 05:53:23,869 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 80 [2019-01-13 05:53:23,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:53:23,887 INFO L225 Difference]: With dead ends: 13224 [2019-01-13 05:53:23,888 INFO L226 Difference]: Without dead ends: 13224 [2019-01-13 05:53:23,889 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=534, Invalid=1272, Unknown=0, NotChecked=0, Total=1806 [2019-01-13 05:53:23,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13224 states. [2019-01-13 05:53:24,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13224 to 4240. [2019-01-13 05:53:24,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4240 states. [2019-01-13 05:53:24,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4240 states to 4240 states and 10861 transitions. [2019-01-13 05:53:24,054 INFO L78 Accepts]: Start accepts. Automaton has 4240 states and 10861 transitions. Word has length 80 [2019-01-13 05:53:24,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:53:24,055 INFO L480 AbstractCegarLoop]: Abstraction has 4240 states and 10861 transitions. [2019-01-13 05:53:24,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-13 05:53:24,055 INFO L276 IsEmpty]: Start isEmpty. Operand 4240 states and 10861 transitions. [2019-01-13 05:53:24,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-01-13 05:53:24,066 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:53:24,066 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 05:53:24,067 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:53:24,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:53:24,068 INFO L82 PathProgramCache]: Analyzing trace with hash -116723821, now seen corresponding path program 1 times [2019-01-13 05:53:24,068 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:53:24,068 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:53:24,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:53:24,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:53:24,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:53:24,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:53:24,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:53:24,862 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:53:24,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-13 05:53:24,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-13 05:53:24,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-13 05:53:24,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-01-13 05:53:24,865 INFO L87 Difference]: Start difference. First operand 4240 states and 10861 transitions. Second operand 8 states. [2019-01-13 05:53:25,332 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-13 05:53:26,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:53:26,043 INFO L93 Difference]: Finished difference Result 4454 states and 11267 transitions. [2019-01-13 05:53:26,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-13 05:53:26,044 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 80 [2019-01-13 05:53:26,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:53:26,050 INFO L225 Difference]: With dead ends: 4454 [2019-01-13 05:53:26,050 INFO L226 Difference]: Without dead ends: 4454 [2019-01-13 05:53:26,050 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2019-01-13 05:53:26,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4454 states. [2019-01-13 05:53:26,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4454 to 4409. [2019-01-13 05:53:26,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4409 states. [2019-01-13 05:53:26,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4409 states to 4409 states and 11180 transitions. [2019-01-13 05:53:26,131 INFO L78 Accepts]: Start accepts. Automaton has 4409 states and 11180 transitions. Word has length 80 [2019-01-13 05:53:26,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:53:26,131 INFO L480 AbstractCegarLoop]: Abstraction has 4409 states and 11180 transitions. [2019-01-13 05:53:26,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-13 05:53:26,131 INFO L276 IsEmpty]: Start isEmpty. Operand 4409 states and 11180 transitions. [2019-01-13 05:53:26,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-01-13 05:53:26,141 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:53:26,142 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 05:53:26,142 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:53:26,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:53:26,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1242828129, now seen corresponding path program 2 times [2019-01-13 05:53:26,143 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:53:26,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:53:26,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:53:26,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:53:26,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:53:26,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:53:26,676 WARN L181 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 12 [2019-01-13 05:53:27,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:53:27,198 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:53:27,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-01-13 05:53:27,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-13 05:53:27,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-13 05:53:27,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2019-01-13 05:53:27,200 INFO L87 Difference]: Start difference. First operand 4409 states and 11180 transitions. Second operand 18 states. [2019-01-13 05:53:27,536 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-13 05:53:28,306 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2019-01-13 05:53:28,915 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2019-01-13 05:53:29,067 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-01-13 05:53:29,263 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 62 [2019-01-13 05:53:29,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:53:29,728 INFO L93 Difference]: Finished difference Result 4301 states and 10952 transitions. [2019-01-13 05:53:29,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-13 05:53:29,730 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 80 [2019-01-13 05:53:29,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:53:29,738 INFO L225 Difference]: With dead ends: 4301 [2019-01-13 05:53:29,738 INFO L226 Difference]: Without dead ends: 4301 [2019-01-13 05:53:29,739 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=371, Invalid=819, Unknown=0, NotChecked=0, Total=1190 [2019-01-13 05:53:29,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4301 states. [2019-01-13 05:53:29,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4301 to 4143. [2019-01-13 05:53:29,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4143 states. [2019-01-13 05:53:29,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4143 states to 4143 states and 10658 transitions. [2019-01-13 05:53:29,828 INFO L78 Accepts]: Start accepts. Automaton has 4143 states and 10658 transitions. Word has length 80 [2019-01-13 05:53:29,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:53:29,829 INFO L480 AbstractCegarLoop]: Abstraction has 4143 states and 10658 transitions. [2019-01-13 05:53:29,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-13 05:53:29,829 INFO L276 IsEmpty]: Start isEmpty. Operand 4143 states and 10658 transitions. [2019-01-13 05:53:29,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-01-13 05:53:29,839 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:53:29,839 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 05:53:29,840 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:53:29,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:53:29,840 INFO L82 PathProgramCache]: Analyzing trace with hash -379378452, now seen corresponding path program 2 times [2019-01-13 05:53:29,840 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:53:29,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:53:29,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:53:29,853 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 05:53:29,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:53:29,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:53:31,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:53:31,704 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:53:31,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-01-13 05:53:31,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-13 05:53:31,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-13 05:53:31,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2019-01-13 05:53:31,706 INFO L87 Difference]: Start difference. First operand 4143 states and 10658 transitions. Second operand 20 states. [2019-01-13 05:53:32,618 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 33 [2019-01-13 05:53:32,814 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 38 [2019-01-13 05:53:33,054 WARN L181 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2019-01-13 05:53:33,328 WARN L181 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2019-01-13 05:53:33,664 WARN L181 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 52 [2019-01-13 05:53:34,008 WARN L181 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2019-01-13 05:53:34,331 WARN L181 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2019-01-13 05:53:34,804 WARN L181 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 66 [2019-01-13 05:53:35,385 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 31 [2019-01-13 05:53:35,630 WARN L181 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 46 [2019-01-13 05:53:35,825 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 36 [2019-01-13 05:53:36,119 WARN L181 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2019-01-13 05:53:36,427 WARN L181 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 64 [2019-01-13 05:53:36,724 WARN L181 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2019-01-13 05:53:37,045 WARN L181 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 69 [2019-01-13 05:53:37,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:53:37,275 INFO L93 Difference]: Finished difference Result 12814 states and 32036 transitions. [2019-01-13 05:53:37,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-01-13 05:53:37,276 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 80 [2019-01-13 05:53:37,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:53:37,290 INFO L225 Difference]: With dead ends: 12814 [2019-01-13 05:53:37,290 INFO L226 Difference]: Without dead ends: 12814 [2019-01-13 05:53:37,291 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=509, Invalid=1213, Unknown=0, NotChecked=0, Total=1722 [2019-01-13 05:53:37,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12814 states. [2019-01-13 05:53:37,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12814 to 4238. [2019-01-13 05:53:37,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4238 states. [2019-01-13 05:53:37,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4238 states to 4238 states and 10850 transitions. [2019-01-13 05:53:37,427 INFO L78 Accepts]: Start accepts. Automaton has 4238 states and 10850 transitions. Word has length 80 [2019-01-13 05:53:37,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:53:37,427 INFO L480 AbstractCegarLoop]: Abstraction has 4238 states and 10850 transitions. [2019-01-13 05:53:37,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-13 05:53:37,427 INFO L276 IsEmpty]: Start isEmpty. Operand 4238 states and 10850 transitions. [2019-01-13 05:53:37,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-01-13 05:53:37,437 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:53:37,437 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 05:53:37,438 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:53:37,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:53:37,438 INFO L82 PathProgramCache]: Analyzing trace with hash -970443804, now seen corresponding path program 3 times [2019-01-13 05:53:37,438 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:53:37,439 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:53:37,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:53:37,452 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 05:53:37,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:53:37,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-13 05:53:37,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-13 05:53:37,634 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-13 05:53:37,737 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-01-13 05:53:37,738 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.01 05:53:37 BasicIcfg [2019-01-13 05:53:37,738 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-13 05:53:37,739 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-13 05:53:37,739 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-13 05:53:37,739 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-13 05:53:37,740 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 05:53:07" (3/4) ... [2019-01-13 05:53:37,748 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-13 05:53:37,900 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-13 05:53:37,901 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-13 05:53:37,902 INFO L168 Benchmark]: Toolchain (without parser) took 33716.17 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 621.3 MB). Free memory was 941.9 MB in the beginning and 1.3 GB in the end (delta: -394.7 MB). Peak memory consumption was 226.6 MB. Max. memory is 11.5 GB. [2019-01-13 05:53:37,903 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 05:53:37,903 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1537.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.6 MB). Free memory was 941.9 MB in the beginning and 984.0 MB in the end (delta: -42.0 MB). Peak memory consumption was 94.3 MB. Max. memory is 11.5 GB. [2019-01-13 05:53:37,904 INFO L168 Benchmark]: Boogie Procedure Inliner took 132.76 ms. Allocated memory is still 1.2 GB. Free memory was 984.0 MB in the beginning and 977.1 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-01-13 05:53:37,904 INFO L168 Benchmark]: Boogie Preprocessor took 86.39 ms. Allocated memory is still 1.2 GB. Free memory is still 977.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 05:53:37,905 INFO L168 Benchmark]: RCFGBuilder took 1094.13 ms. Allocated memory is still 1.2 GB. Free memory was 977.1 MB in the beginning and 923.9 MB in the end (delta: 53.3 MB). Peak memory consumption was 53.3 MB. Max. memory is 11.5 GB. [2019-01-13 05:53:37,905 INFO L168 Benchmark]: TraceAbstraction took 30697.35 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 499.6 MB). Free memory was 923.9 MB in the beginning and 1.4 GB in the end (delta: -428.7 MB). Peak memory consumption was 70.9 MB. Max. memory is 11.5 GB. [2019-01-13 05:53:37,908 INFO L168 Benchmark]: Witness Printer took 161.85 ms. Allocated memory is still 1.7 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 16.0 MB). Peak memory consumption was 16.0 MB. Max. memory is 11.5 GB. [2019-01-13 05:53:37,912 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1537.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.6 MB). Free memory was 941.9 MB in the beginning and 984.0 MB in the end (delta: -42.0 MB). Peak memory consumption was 94.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 132.76 ms. Allocated memory is still 1.2 GB. Free memory was 984.0 MB in the beginning and 977.1 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 86.39 ms. Allocated memory is still 1.2 GB. Free memory is still 977.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1094.13 ms. Allocated memory is still 1.2 GB. Free memory was 977.1 MB in the beginning and 923.9 MB in the end (delta: 53.3 MB). Peak memory consumption was 53.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 30697.35 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 499.6 MB). Free memory was 923.9 MB in the beginning and 1.4 GB in the end (delta: -428.7 MB). Peak memory consumption was 70.9 MB. Max. memory is 11.5 GB. * Witness Printer took 161.85 ms. Allocated memory is still 1.7 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 16.0 MB). Peak memory consumption was 16.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 3772]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L3774] -1 pthread_t t1,t2; VAL [t1={1:0}, t2={-3:0}] [L3839] -1 return 0; VAL [t1={1:0}, t2={-3:0}] [L3847] -1 int ret = my_drv_init(); VAL [t1={1:0}, t2={-3:0}] [L3848] COND TRUE -1 ret==0 VAL [t1={1:0}, t2={-3:0}] [L3849] -1 int probe_ret; VAL [t1={1:0}, t2={-3:0}] [L3850] -1 struct my_data data; VAL [t1={1:0}, t2={-3:0}] [L3804] -1 struct device *d = &data->dev; VAL [t1={1:0}, t2={-3:0}] [L3809] -1 data->shared.a = 0 VAL [t1={1:0}, t2={-3:0}] [L3810] -1 data->shared.b = 0 VAL [t1={1:0}, t2={-3:0}] [L3812] -1 int res = __VERIFIER_nondet_int(); VAL [t1={1:0}, t2={-3:0}] [L3813] COND FALSE -1 !(\read(res)) VAL [t1={1:0}, t2={-3:0}] [L3816] FCALL, FORK -1 pthread_create(&t1, ((void *)0), my_callback, (void *)d) VAL [arg={-2:40}, t1={1:0}, t2={-3:0}] [L3817] FCALL, FORK -1 pthread_create(&t2, ((void *)0), my_callback, (void *)d) VAL [arg={-2:40}, t1={1:0}, t2={-3:0}] [L3818] -1 return 0; VAL [arg={-2:40}, t1={1:0}, t2={-3:0}] [L3792] 0 struct device *dev = (struct device*)arg; VAL [arg={-2:40}, arg={-2:40}, dev={-2:40}, t1={1:0}, t2={-3:0}] [L3793] 0 struct my_data *data; VAL [arg={-2:40}, arg={-2:40}, dev={-2:40}, t1={1:0}, t2={-3:0}] [L3792] 1 struct device *dev = (struct device*)arg; VAL [arg={-2:40}, arg={-2:40}, dev={-2:40}, t1={1:0}, t2={-3:0}] [L3794] 0 const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); VAL [__mptr={-2:40}, arg={-2:40}, arg={-2:40}, dev={-2:40}, t1={1:0}, t2={-3:0}] [L3793] 1 struct my_data *data; VAL [__mptr={-2:40}, arg={-2:40}, arg={-2:40}, dev={-2:40}, t1={1:0}, t2={-3:0}] [L3794] 0 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:40}, arg={-2:40}, arg={-2:40}, data={-2:0}, dev={-2:40}, t1={1:0}, t2={-3:0}] [L3794] 1 const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); VAL [__mptr={-2:40}, arg={-2:40}, arg={-2:40}, data={-2:0}, dev={-2:40}, t1={1:0}, t2={-3:0}] [L3851] -1 probe_ret = my_drv_probe(&data) VAL [__mptr={-2:40}, arg={-2:40}, arg={-2:40}, data={-2:0}, dev={-2:40}, t1={1:0}, t2={-3:0}] [L3852] COND TRUE -1 probe_ret==0 VAL [__mptr={-2:40}, arg={-2:40}, arg={-2:40}, data={-2:0}, dev={-2:40}, t1={1:0}, t2={-3:0}] [L3826] -1 void *status; VAL [__mptr={-2:40}, arg={-2:40}, arg={-2:40}, data={-2:0}, dev={-2:40}, t1={1:0}, t2={-3:0}] [L3827] -1 \read(t1) VAL [__mptr={-2:40}, arg={-2:40}, arg={-2:40}, data={-2:0}, dev={-2:40}, t1={1:0}, t2={-3:0}] [L3794] 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:40}, arg={-2:40}, arg={-2:40}, data={-2:0}, dev={-2:40}, t1={1:0}, t2={-3:0}] [L3797] 1 data->shared.a = 1 VAL [__mptr={-2:40}, arg={-2:40}, arg={-2:40}, data={-2:0}, dev={-2:40}, t1={1:0}, t2={-3:0}] [L3798] EXPR 1 data->shared.b VAL [__mptr={-2:40}, arg={-2:40}, arg={-2:40}, data={-2:0}, data->shared.b=0, dev={-2:40}, t1={1:0}, t2={-3:0}] [L3798] 1 data->shared.b = data->shared.b + 1 VAL [__mptr={-2:40}, arg={-2:40}, arg={-2:40}, data={-2:0}, data->shared.b=0, dev={-2:40}, t1={1:0}, t2={-3:0}] [L3800] 1 return 0; VAL [\result={0:0}, __mptr={-2:40}, arg={-2:40}, arg={-2:40}, data={-2:0}, dev={-2:40}, t1={1:0}, t2={-3:0}] [L3827] FCALL, JOIN 1 pthread_join(t1, &status) VAL [\result={0:0}, __mptr={-2:40}, arg={-2:40}, arg={-2:40}, data={-2:0}, dev={-2:40}, t1={1:0}, t2={-3:0}] [L3829] -1 data->shared.a = 3 VAL [\result={0:0}, __mptr={-2:40}, arg={-2:40}, arg={-2:40}, data={-2:0}, dev={-2:40}, t1={1:0}, t2={-3:0}] [L3830] -1 data->shared.b = 3 VAL [\result={0:0}, __mptr={-2:40}, arg={-2:40}, arg={-2:40}, data={-2:0}, dev={-2:40}, t1={1:0}, t2={-3:0}] [L3797] 0 data->shared.a = 1 VAL [\result={0:0}, __mptr={-2:40}, arg={-2:40}, arg={-2:40}, data={-2:0}, dev={-2:40}, t1={1:0}, t2={-3:0}] [L3831] -1 data->shared.a VAL [\result={0:0}, __mptr={-2:40}, arg={-2:40}, arg={-2:40}, data={-2:0}, dev={-2:40}, t1={1:0}, t2={-3:0}] [L3772] COND TRUE -1 !expression VAL [\result={0:0}, __mptr={-2:40}, arg={-2:40}, arg={-2:40}, data={-2:0}, dev={-2:40}, t1={1:0}, t2={-3:0}] [L3772] -1 __VERIFIER_error() VAL [\result={0:0}, __mptr={-2:40}, arg={-2:40}, arg={-2:40}, data={-2:0}, dev={-2:40}, t1={1:0}, t2={-3:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 161 locations, 6 error locations. UNSAFE Result, 30.5s OverallTime, 10 OverallIterations, 1 TraceHistogramMax, 21.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2377 SDtfs, 7265 SDslu, 10576 SDs, 0 SdLazy, 3056 SolverSat, 185 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 236 GetRequests, 38 SyntacticMatches, 10 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 544 ImplicationChecksByTransitivity, 17.0s 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 AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 21104 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.5s InterpolantComputationTime, 699 NumberOfCodeBlocks, 699 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 610 ConstructedInterpolants, 0 QuantifiedInterpolants, 241201 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...